A Parallel FP-Growth Algorithm Based on GPU

Hao Jiang, He Meng
{"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}
引用次数: 10

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.
一种基于GPU的并行fp生长算法
本文提出并实现了一种FP-growth算法的并行方案,并实现了该并行算法(PFP-growth algorithm)。实验结果表明,与FP-growth算法相比,PFP-growth算法效率更高,且数据集越大,支持阈值越低,加速效果越显著。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信