MMFI: An Effective Algorithm for Mining Maximal Frequent Itemsets
暂无分享,去创建一个
[1] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[2] Johannes Gehrke,et al. MAFIA: a maximal frequent itemset algorithm , 2005, IEEE Transactions on Knowledge and Data Engineering.
[3] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[4] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[5] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[6] Gösta Grahne,et al. Fast algorithms for frequent itemset mining using FP-trees , 2005, IEEE Transactions on Knowledge and Data Engineering.
[7] Mohammed J. Zaki,et al. Efficiently mining maximal frequent itemsets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[8] G. Grahne,et al. High Performance Mining of Maximal Frequent Itemsets Gösta , 2003 .