Sciweavers

370 search results - page 37 / 74
» A framework for mining interesting pattern sets
Sort
View
DATAMINE
2006
230views more  DATAMINE 2006»
15 years 1 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
KDD
2010
ACM
233views Data Mining» more  KDD 2010»
15 years 5 months ago
Evolutionary hierarchical dirichlet processes for multiple correlated time-varying corpora
Mining cluster evolution from multiple correlated time-varying text corpora is important in exploratory text analytics. In this paper, we propose an approach called evolutionary h...
Jianwen Zhang, Yangqiu Song, Changshui Zhang, Shix...
DATAMINE
2006
88views more  DATAMINE 2006»
15 years 1 months ago
Hyperclique pattern discovery
Existing algorithms for mining association patterns often rely on the support-based pruning strategy to prune a combinatorial search space. However, this strategy is not effective ...
Hui Xiong, Pang-Ning Tan, Vipin Kumar
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
16 years 2 months ago
Using retrieval measures to assess similarity in mining dynamic web clickstreams
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
Olfa Nasraoui, Cesar Cardona, Carlos Rojas
JCST
2008
119views more  JCST 2008»
15 years 1 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman