论文信息 - Mining frequent itemsets with partial enumeration

Mining frequent itemsets with partial enumeration

In this paper, we present an algorithm of mining frequent itemsets using partial enumeration and the FP-growth function with reduced depth of recursion. The experimental results show that our algorithm outperforms the original FP-growth algorithm without partial enumeration for the databases with high density.

Peiyi Tang | Markus P. Turkia

[1] Gösta Grahne,et al. Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.

[2] Li Ning,et al. Domain and data partitioning for parallel mining of frequent closed itemsets , 2005, ACM-SE 43.

[3] Ada Wai-Chee Fu,et al. Mining frequent itemsets without support threshold: with and without item constraints , 2004, IEEE Transactions on Knowledge and Data Engineering.

[4] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[5] Peiyi Tang,et al. Parallelizing Frequent Itemset Mining with FP-Trees , 2006, Computers and Their Applications.

[6] Bart Goethals,et al. FIMI '03, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA , 2003, FIMI.