A Parallel FP-Growth Algorithm Based on GPU

This paper proposes and implements a parallel scheme of FP-growth algorithm and implements this parallel algorithm (PFP-growth algorithm). Experimental results show that, compared with FP-growth algorithm, PFP-growth algorithm is more efficient, and the larger the data set is, the lower the support threshold is, the more remarkable the speedup is.

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

[2]  Edward Y. Chang,et al.  Pfp: parallel fp-growth for query recommendation , 2008, RecSys '08.

[3]  Fan Zhang,et al.  Accelerating frequent itemset mining on graphics processing units , 2013, The Journal of Supercomputing.

[4]  Yao Zhang,et al.  Parallel Computing Experiences with CUDA , 2008, IEEE Micro.

[5]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[6]  Fan Zhang,et al.  GPApriori: GPU-Accelerated Frequent Itemset Mining , 2011, 2011 IEEE International Conference on Cluster Computing.

[7]  Fei Wang,et al.  Parallel Frequent Pattern Mining without Candidate Generation on GPUs , 2014, 2014 IEEE International Conference on Data Mining Workshop.

[8]  Jiayi Zhou,et al.  Parallel frequent patterns mining algorithm on GPU , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[9]  Sheetal Rathi,et al.  Parallel Implementation of FP Growth Algorithm on XML Data Using Multiple GPU , 2015 .

[10]  John D. Owens,et al.  GPU Computing , 2008, Proceedings of the IEEE.