3.8 Proceedings Paper

A Parallel FP-growth Algorithm Based on GPU

Publisher

IEEE
DOI: 10.1109/ICEBE.2017.24

Keywords

frequent itemset mining; FP-growth; GPU; parallel computing

Funding

  1. Collaborative Innovation Center of Wireless Communications Technology
  2. National Natural Science Foundation of China [61672152]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available