Sciweavers

94 search results - page 13 / 19
» Efficient Frequent Itemsets Mining by Sampling
Sort
View
AAAI
2006
14 years 10 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...
FIMI
2004
172views Data Mining» more  FIMI 2004»
14 years 10 months ago
AIM2: Improved implementation of AIM
We present AIM2-F, an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the e...
Sagi Shporer
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
15 years 9 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
14 years 10 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 9 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