{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:42:28Z","timestamp":1760708548428,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0844951"],"award-info":[{"award-number":["CNS-0844951"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Reconfigurable Technol. Syst."],"published-print":{"date-parts":[[2013,5]]},"abstract":"<jats:p>In this article we describe a Field Programmable Gate Array (FPGA)-based coprocessor architecture for Frequent Itemset Mining (FIM). FIM is a common data mining task used to find frequently occurring subsets amongst a database of sets. FIM is a nonnumerical, data intensive computation and is used in machine learning and computational biology. FIM is particularly expensive---in terms of execution time and memory---when performed on large and\/or sparse databases or when applied using a low appearance frequency threshold. Because of this, the development of increasingly efficient FIM algorithms and their mapping to parallel architectures is an active field. Previous attempts to accelerate FIM using FPGAs have relied on performance-limiting strategies such as iterative database loading and runtime logic unit reconfiguration. In this article, we present a novel architecture to implement Eclat, a well-known FIM algorithm. Unlike previous efforts, our technique does not impose limits on the maximum set size as a function of available FPGA logic resources and our design scales well to multiple FPGAs. In addition to a novel hardware design, we also present a corresponding compression scheme for intermediate results that are stored in on-chip memory. On a four-FPGA board, experimental results show up to 68X speedup compared to a highly optimized software implementation.<\/jats:p>","DOI":"10.1145\/2457443.2457445","type":"journal-article","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T20:51:42Z","timestamp":1367959902000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["An FPGA-Based Accelerator for Frequent Itemset Mining"],"prefix":"10.1145","volume":"6","author":[{"given":"Yan","family":"Zhang","sequence":"first","affiliation":[{"name":"University of South Carolina"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of South Carolina"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheming","family":"Jin","sequence":"additional","affiliation":[{"name":"University of South Carolina"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason D.","family":"Bakos","sequence":"additional","affiliation":[{"name":"University of South Carolina"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,5]]},"reference":[{"volume-title":"Proceedings of the 20th International Conference on Very Large Data Bases. 487--499","author":"Agrawal R.","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2011.13"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2005.31"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1170135.1170441"},{"volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations.","year":"2003","author":"Bodon F.","key":"e_1_2_1_6_1"},{"volume-title":"2006 A survey on frequent itemset mining. Tech. rep","author":"Bodon F.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(03)90058-6"},{"volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations.","year":"2003","author":"Borgelt C.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","unstructured":"FIMI Repository. 2003 Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data.  FIMI Repository. 2003 Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13672-6_15"},{"key":"e_1_2_1_12_1","unstructured":"Gidel Ltd. 2009. PROStarIII Data Book. Version 1.0.  Gidel Ltd. 2009. PROStarIII Data Book. Version 1.0."},{"volume-title":"Survey on frequent pattern mining. Tech. rep","author":"Goethals B.","key":"e_1_2_1_13_1"},{"volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations.","author":"Goethals B.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1131481.1131511"},{"key":"e_1_2_1_17_1","unstructured":"IBM. 2012. IBM synthetic data generator. http:\/\/sourceforge.net\/projects\/ibmquestdatagen\/.  IBM. 2012. IBM synthetic data generator. http:\/\/sourceforge.net\/projects\/ibmquestdatagen\/."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.634757"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.34"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ReConFig.2008.80"},{"volume-title":"Proceedings of the International Conference on Field Programmable Logic and Applications (FPL\u201909)","author":"Thoni D. W.","key":"e_1_2_1_21_1"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.39"},{"volume-title":"Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufman, 27.","year":"2005","author":"Witten I.","key":"e_1_2_1_23_1"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2011.69"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.84"}],"container-title":["ACM Transactions on Reconfigurable Technology and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457443.2457445","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2457443.2457445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:19:13Z","timestamp":1750234753000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457443.2457445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["10.1145\/2457443.2457445"],"URL":"https:\/\/doi.org\/10.1145\/2457443.2457445","relation":{},"ISSN":["1936-7406","1936-7414"],"issn-type":[{"type":"print","value":"1936-7406"},{"type":"electronic","value":"1936-7414"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"2012-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}