Sciweavers

165 search results - page 18 / 33
» Mining Compressed Frequent-Pattern Sets
Sort
View
IPPS
2008
IEEE
14 years 3 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
PAKDD
2010
ACM
152views Data Mining» more  PAKDD 2010»
14 years 1 months ago
Mining Association Rules in Long Sequences
Abstract. Discovering interesting patterns in long sequences, and finding confident association rules within them, is a popular area in data mining. Most existing methods define...
Boris Cule, Bart Goethals
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 2 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 9 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
WISE
2006
Springer
14 years 3 months ago
PrefixTreeESpan: A Pattern Growth Algorithm for Mining Embedded Subtrees
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called Pr...
Lei Zou, Yansheng Lu, Huaming Zhang, Rong Hu