Sciweavers

263 search results - page 40 / 53
» kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
Sort
View
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 8 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
ECML
2007
Springer
14 years 15 days ago
Finding Composite Episodes
Mining frequent patterns is a major topic in data mining research, resulting in many seminal papers and algorithms on item set and episode discovery. The combination of these, call...
Ronnie Bathoorn, Arno Siebes
KDD
2007
ACM
206views Data Mining» more  KDD 2007»
14 years 9 months ago
Automatic labeling of multinomial topic models
Multinomial distributions over words are frequently used to model topics in text collections. A common, major challenge in applying all such topic models to any text mining proble...
Qiaozhu Mei, Xuehua Shen, ChengXiang Zhai
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
13 years 8 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
CIDM
2009
IEEE
14 years 15 days ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...