一种基于GPU的并行fp生长算法

2017 IEEE 14th International Conference on e-Business Engineering (ICEBE) Pub Date : 2017-11-01 DOI:10.1109/ICEBE.2017.24

Hao Jiang, He Meng

{"title":"一种基于GPU的并行fp生长算法","authors":"Hao Jiang, He Meng","doi":"10.1109/ICEBE.2017.24","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":347774,"journal":{"name":"2017 IEEE 14th International Conference on e-Business Engineering (ICEBE)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A Parallel FP-Growth Algorithm Based on GPU\",\"authors\":\"Hao Jiang, He Meng\",\"doi\":\"10.1109/ICEBE.2017.24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":347774,\"journal\":{\"name\":\"2017 IEEE 14th International Conference on e-Business Engineering (ICEBE)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 14th International Conference on e-Business Engineering (ICEBE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEBE.2017.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 14th International Conference on e-Business Engineering (ICEBE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEBE.2017.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

本文提出并实现了一种FP-growth算法的并行方案，并实现了该并行算法(PFP-growth algorithm)。实验结果表明，与FP-growth算法相比，PFP-growth算法效率更高，且数据集越大，支持阈值越低，加速效果越显著。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 IEEE 14th International Conference on e-Business Engineering (ICEBE)

自引率

0.00%

发文量