[1]LI H,WANG Y,ZHANG D,et al.PFP:Parallel FP-Growth for query recommendation[C]//Proceedings of 2008 ACM Conference on Recom mended Systems.New York,USA:ACM Press,2008:125-137.
[2]LEE K H,LEE Y J,CHOI H,et al.Parallel data processing with MapReduce:A survey[J].ACM SIGMOD Record,2012,40(4):11-20.
[3]HAN J,PEI J,YIN Y.Mining frequent patterns without candidate generation[C]//Proceedings of 2000 ACM SIGMOD International Conference on Management of Date.New York,USA:ACM Press,2000:1-12.
(下转第40页)
(上接第35页)
[4]陈兴蜀,张帅,童浩,等.基于布尔矩阵和MapReduce的FP-Growth算法[J].华南理工大学学报 (自然科学版),2014(1):135-141.
[5]WEI F,XIANG L.Improved frequent pattern mining algorithm based on FP-tree[EB/OL].[2017-11-11].http://pos.sissa.it/cgi-bin/reader/conf.cgi?confid=264,id.37.2015.
[6]马月坤,刘鹏飞,张振友,等.改进的FP-Growth算法及其分布式并行实现[J].哈尔滨理工大学学报,2016,21(2):20-27.
[7]方向,张功萱.基于Spark的PFP-Growth并行算法优化实现[J].现代电子技术,2016,39(8):9-13.
[8]宁慧,王素红,崔立刚,等.基于改进的 FP-tree 最大频繁模式挖掘算法[J].应用科技,2016,43(2):37-43.
[9]程广,王晓峰.基于MapReduce的并行关联规则增量更新算法[J].计算机工程,2016,42(2):21-25.
[10]ZHOU L,ZHONG Z,CHANG J,et al.Balanced parallel FP-Growth with MapReduce[C]//Proceedings of Information Computing and Telecommunications.Washington D.C.,USA:IEEE Press,2011:243-246.
[11]YANG Q,DU F,ZHU X,et al.Improved balanced parallel FP-Growth with MapReduce[C]//Proceedings of 2016 Joint International Conference on Artificial Intelligence and Computer Engineering and International Conference on Network and Communication Security.Lancaster,USA:Destech Publications,2016:1-5.
[12]厍向阳,张玲.基于Hadoop的FP-Growth关联规则并行改进算法[J].计算机应用研究,2018,35(1):1-6.
[13]PRAMUDIONO I,KITSUREGAWA M.Parallel FP-Growth on PC cluster[C]//Proceedings of Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining.Berlin,Germany:Springer,2003:467-473.
[14]YAN X,ZHANG J,XUN Y,et al.A parallel algorithm for mining constrained frequent patterns using MapReduce[J].Soft Computing,2015,21(9):1-13.
[15]施亮,钱雪忠.基于Hadoop的并行FP-Growth算法的研究与实现[J].微电子学与计算机,2015,32(4):150-154.
[16]Frequent itemset ming dataset repository [EB/OL].[2017-11-11].http://fimi.ua.ac.be/data. |