Sciweavers

155 search results - page 18 / 31
» Discovering Structural Patterns in Telecommunications Data
Sort
View
65
Voted
WEBI
2005
Springer
15 years 3 months ago
Tracking Information Epidemics in Blogspace
Beyond serving as online diaries, weblogs have evolved into a complex social structure, one which is in many ways ideal for the study of the propagation of information. As weblog ...
Eytan Adar, Lada A. Adamic
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
15 years 10 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 2 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
15 years 11 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 1 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing