频繁项集挖掘中交集计算的FPGA加速

Shaobo Shi, Yue Qi, Qin Wang
{"title":"频繁项集挖掘中交集计算的FPGA加速","authors":"Shaobo Shi, Yue Qi, Qin Wang","doi":"10.1109/CyberC.2013.95","DOIUrl":null,"url":null,"abstract":"Frequent item set mining is an important researching area in data mining and Eclat is a typical and high performance frequent item set mining algorithm. However, the large numbers of sorted-set intersection computation in the algorithm limit the performance of the algorithm seriously. FPGA is a low-power and high-performance computing platform that has been applied to accelerate parallel data mining successfully. To deal with the problem of the large number intersection computation in Eclat, this paper proposed a FPGA solution to accelerate the intersection computation. And a full comparator matrix structure is provided to perform the parallel intersection computation. The experiment results show that our solution can achieve a speedup of 26.7x on intersection computation comparing to the best software implementation existed, and the full comparator matrix have a better scalability, thus the entire running time of the Eclat algorithm can be decreased extremely.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"FPGA Acceleration for Intersection Computation in Frequent Itemset Mining\",\"authors\":\"Shaobo Shi, Yue Qi, Qin Wang\",\"doi\":\"10.1109/CyberC.2013.95\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Frequent item set mining is an important researching area in data mining and Eclat is a typical and high performance frequent item set mining algorithm. However, the large numbers of sorted-set intersection computation in the algorithm limit the performance of the algorithm seriously. FPGA is a low-power and high-performance computing platform that has been applied to accelerate parallel data mining successfully. To deal with the problem of the large number intersection computation in Eclat, this paper proposed a FPGA solution to accelerate the intersection computation. And a full comparator matrix structure is provided to perform the parallel intersection computation. The experiment results show that our solution can achieve a speedup of 26.7x on intersection computation comparing to the best software implementation existed, and the full comparator matrix have a better scalability, thus the entire running time of the Eclat algorithm can be decreased extremely.\",\"PeriodicalId\":133756,\"journal\":{\"name\":\"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CyberC.2013.95\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2013.95","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

频繁项集挖掘是数据挖掘中的一个重要研究领域,Eclat是一种典型的高性能频繁项集挖掘算法。然而,算法中大量的排序集交集计算严重限制了算法的性能。FPGA是一种低功耗、高性能的计算平台,已成功地应用于加速并行数据挖掘。针对Eclat中大量交集计算的问题,提出了一种FPGA加速交集计算的解决方案。并提供了一种完整的比较器矩阵结构来进行并行交叉计算。实验结果表明,与现有最好的软件实现相比,我们的方案可以实现26.7倍的交叉计算加速,并且全比较器矩阵具有更好的可扩展性,从而极大地降低了Eclat算法的整体运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FPGA Acceleration for Intersection Computation in Frequent Itemset Mining
Frequent item set mining is an important researching area in data mining and Eclat is a typical and high performance frequent item set mining algorithm. However, the large numbers of sorted-set intersection computation in the algorithm limit the performance of the algorithm seriously. FPGA is a low-power and high-performance computing platform that has been applied to accelerate parallel data mining successfully. To deal with the problem of the large number intersection computation in Eclat, this paper proposed a FPGA solution to accelerate the intersection computation. And a full comparator matrix structure is provided to perform the parallel intersection computation. The experiment results show that our solution can achieve a speedup of 26.7x on intersection computation comparing to the best software implementation existed, and the full comparator matrix have a better scalability, thus the entire running time of the Eclat algorithm can be decreased extremely.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信