[1]AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large database[C] // Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. New York: ACM, 1993: 207-216.
[2]AGRAWAL R, SRIKANT R. Fast algorithms for mining association rules in large database [C]// Proceedings of the 20th International Conference on Very Large Data Bases. San Francisco: Morgan Kaufman,1994:478-499.
[3]HAN J, PEI J, YIN Y. Mining frequent patterns without candidate generation [C] // Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. New York: ACM, 2000:1-12.
[4]LIN D-I, KEDEM Z M. Pincer-search: A new algorithm for discovering the maximun frequent set[C]// Proceedings of the 6th International Conference on Extending Database Technology. Berlin: Springer-Verlag, 1998:105-119.
[5]BAYARDO R J. Efficiently mining long patterns from database[C]// Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data. New York: ACM, 1998: 85-93.
[6]AGGARWAL C, AGRAWAL R, PRASAD V V V. Depth first generation of long patterns[C]// Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2000:108-118.
[7]BURDICK D, CALIMLIM M, GEHRKE J. MAFIA: A maximal frequent itemset algorithm for transactional databases[C]// Proceedings of the 17th International Conference on Data Engineering. Washington, DC: IEEE Computer Society, 2001: 443-452.
[8]GRAHNE G, ZHU J F. High performance mining of maximal frequent itemsets[C]// Proceedings of the 6th SIAM International Workshop on High Performance Data Mining:Pervasive and Data Stream Mining. San Francisco, CA: [s.n.], 2003: 135-144.
[9]刘君强,孙晓莹,王勋,等. 挖掘最大频繁模式的新方法[J]. 计算机学报, 2004, 27(10): 1328-1333.
[10]GRAHNE G, ZHU J F. Fast algorithm for frequent itemset mining using FP-trees[J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(10): 1347-1362.
[11]颜跃进,李舟军,陈火旺. 基于FP-tree 有效挖掘最大频繁项集[J]. 软件学报,2005, 16(2): 215-221.
[12]任永功,张亮,付玉. 一种基于频繁模式树的最大频繁项目集挖掘算法[J]. 小型微型计算机系统,2010,31(2): 317-321. [13]凌绪雄,王社国,李洋,等. 无项头表的FP-Growth算法[J]. 计算机应用,2011, 31(5): 1391-1394.
[14]王丽珍, 周丽华, 陈红梅,等.数据仓库与数据挖掘原理及应用[M].北京: 科学出版社, 2005. |