3.8 Proceedings Paper

A Parallel FP-growth Algorithm Based on GPU

出版社

IEEE
DOI: 10.1109/ICEBE.2017.24

关键词

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

资金

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

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据