Sciweavers

101 search results - page 3 / 21
» Efficiently Mining Frequent Patterns from Dense Datasets Usi...
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 5 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
ICDM
2006
IEEE
114views Data Mining» more  ICDM 2006»
13 years 11 months ago
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zha...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 5 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
13 years 10 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
ADMA
2008
Springer
147views Data Mining» more  ADMA 2008»
13 years 11 months ago
Mining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Ro...