{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:13:46Z","timestamp":1768536826568,"version":"3.49.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T00:00:00Z","timestamp":1495843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Grenoble Alpes M\u00e9tropole through the Nano2017 Esprit project"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Reconfigurable Technol. Syst."],"published-print":{"date-parts":[[2017,9,30]]},"abstract":"<jats:p>\n            Stream processing has become extremely popular for analyzing huge volumes of data for a variety of applications, including IoT, social networks, retail, and software logs analysis. Streams of data are produced continuously and are mined to extract patterns characterizing the data. A class of data mining algorithm, called\n            <jats:italic>generate-and-test<\/jats:italic>\n            , produces a set of candidate patterns that are then evaluated over data. The main challenges of these algorithms are to achieve high throughput, low latency, and reduced power consumption. In this article, we present a novel power-efficient, fast, and versatile hardware architecture whose objective is to monitor a set of target patterns to maintain their frequency over a stream of data. This accelerator can be used to accelerate data-mining algorithms, including itemsets and sequences mining.\n          <\/jats:p>\n          <jats:p>\n            The massive fine-grain reconfiguration capability of field-programmable gate array (FPGA) technologies is ideal to implement the high number of pattern-detection units needed for these intensive data-mining applications. We have thus designed and implemented an IP that features high-density FPGA occupation and high working frequency. We provide detailed description of the IP internal micro-architecture and its actual implementation and optimization for the targeted FPGA resources. We validate our architecture by developing a co-designed implementation of the Apriori Frequent Itemset Mining (FIM) algorithm, and perform numerous experiments against existing hardware and software solutions. We demonstrate that FIM hardware acceleration is particularly efficient for large and low-density datasets (i.e.,\n            <jats:italic>long-tailed<\/jats:italic>\n            datasets). Our IP reaches a data throughput of 250 million items\/s and monitors up to 11.6k patterns simultaneously, on a prototyping board that overall consumes 24W in the worst case. Furthermore, our hardware accelerator remains generic and can be integrated to other\n            <jats:italic>generate and test<\/jats:italic>\n            algorithms.\n          <\/jats:p>","DOI":"10.1145\/3027485","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T19:32:40Z","timestamp":1496259160000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient and Versatile FPGA Acceleration of Support Counting for Stream Mining of Sequences and Frequent Itemsets"],"prefix":"10.1145","volume":"10","author":[{"given":"Adrien","family":"Prost-Boucle","sequence":"first","affiliation":[{"name":"TIMA Lab., CNRS\/Universit\u00e9 Grenoble-Alpes, Cedex, France"}]},{"given":"FR\u00e9d\u00e9ric","family":"P\u00e9trot","sequence":"additional","affiliation":[{"name":"TIMA Lab., CNRS\/Universit\u00e9 Grenoble-Alpes, Cedex, France"}]},{"given":"Vincent","family":"Leroy","sequence":"additional","affiliation":[{"name":"LIG Lab., CNRS\/Universit\u00e9 Grenoble-Alpes, Grenoble Cedex 9, France"}]},{"given":"Hande","family":"Alemdar","sequence":"additional","affiliation":[{"name":"LIG Lab., CNRS\/Universit\u00e9 Grenoble-Alpes, Grenoble Cedex 9, France"}]}],"member":"320","published-online":{"date-parts":[[2017,5,27]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB\u201994)","volume":"1215","author":"Agrawal Rakesh","year":"1994","unstructured":"Rakesh Agrawal , Ramakrishnan Srikant , 1994 . Fast algorithms for mining association rules . In Proceedings of the International Conference on Very Large Databases (VLDB\u201994) , Vol. 1215 . 487--499. Rakesh Agrawal, Ramakrishnan Srikant, et al. 1994. Fast algorithms for mining association rules. In Proceedings of the International Conference on Very Large Databases (VLDB\u201994), Vol. 1215. 487--499."},{"key":"e_1_2_1_2_1","unstructured":"Chris Anderson. 2006. The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion.   Chris Anderson. 2006. The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2005.31"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines. 67--75","author":"Baker Z. K.","unstructured":"Z. K. Baker and V. K. Prasanna . 2006. An architecture for efficient hardware data mining using reconfigurable computing systems . In Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines. 67--75 . Z. K. Baker and V. K. Prasanna. 2006. An architecture for efficient hardware data mining using reconfigurable computing systems. In Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines. 67--75."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations.","author":"Borgelt Christian","year":"2003","unstructured":"Christian Borgelt . 2003 . Efficient implementations of apriori and eclat . In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations. Christian Borgelt. 2003. Efficient implementations of apriori and eclat. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the New Frontiers in Mining Complex Patterns: 4th International Workshop (NFMCP\u201916)","author":"Bustio L\u00e1zaro","year":"2016","unstructured":"L\u00e1zaro Bustio , Ren\u00e9 Cumplido , Raudel Hern\u00e1ndez , Jos\u00e9 M. Bande , and Claudia Feregrino . 2016 . Proceedings of the New Frontiers in Mining Complex Patterns: 4th International Workshop (NFMCP\u201916) . Springer International Publishing, 32--45. L\u00e1zaro Bustio, Ren\u00e9 Cumplido, Raudel Hern\u00e1ndez, Jos\u00e9 M. Bande, and Claudia Feregrino. 2016. Proceedings of the New Frontiers in Mining Complex Patterns: 4th International Workshop (NFMCP\u201916). Springer International Publishing, 32--45."},{"key":"e_1_2_1_7_1","first-page":"51","article-title":"A hardware algorithm for the exact subsequence matching problem in DNA strings","volume":"12","author":"Cret Octavian","year":"2009","unstructured":"Octavian Cret , Zsolt Mathe , Paul Ciobanu , Sonia Marginean , and Adrian Darabant . 2009 . A hardware algorithm for the exact subsequence matching problem in DNA strings . Roman. J. Inform. Sci. Technol. 12 , 1 (2009), 51 -- 67 . Octavian Cret, Zsolt Mathe, Paul Ciobanu, Sonia Marginean, and Adrian Darabant. 2009. A hardware algorithm for the exact subsequence matching problem in DNA strings. Roman. J. Inform. Sci. Technol. 12, 1 (2009), 51--67.","journal-title":"Roman. J. Inform. Sci. Technol."},{"key":"e_1_2_1_8_1","unstructured":"FIMI Repository. 2003. Frequent Itemset Mining Dataset Repository. Retrieved from http:\/\/fimi.ua.ac.be\/data\/.  FIMI Repository. 2003. Frequent Itemset Mining Dataset Repository. Retrieved from http:\/\/fimi.ua.ac.be\/data\/."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2821508"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"e_1_2_1_11_1","unstructured":"IBM. 2012. IBM Quest Synthetic Data Generator. (2012). Retrieved from http:\/\/sourceforge.net\/projects\/ibmquestdatagen\/.  IBM. 2012. IBM Quest Synthetic Data Generator. (2012). Retrieved from http:\/\/sourceforge.net\/projects\/ibmquestdatagen\/."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815631"},{"key":"e_1_2_1_13_1","unstructured":"Micron Inc. 2016. Micron Automata Developer Portal - Hardware. (2016). Retrieved from http:\/\/www.micronautomata.com\/hardware.  Micron Inc. 2016. Micron Automata Developer Portal - Hardware. (2016). Retrieved from http:\/\/www.micronautomata.com\/hardware."},{"key":"e_1_2_1_14_1","unstructured":"Micron Technology Inc. 2013. Micron Automata Processor\u2014A Brief Introduction.  Micron Technology Inc. 2013. Micron Automata Processor\u2014A Brief Introduction."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5121\/ijdps.2014.5502"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CyberC.2013.95"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ReConFig.2008.80"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2015837.2015862"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2009.5272494"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations.","author":"Uno Takeaki","year":"2003","unstructured":"Takeaki Uno , Tatsuya Asai , Yuzo Uchida , and Hiroki Arimura . 2003 . LCM: An efficient algorithm for enumerating frequent closed item sets . In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations. Takeaki Uno, Tatsuya Asai, Yuzo Uchida, and Hiroki Arimura. 2003. LCM: An efficient algorithm for enumerating frequent closed item sets. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133905.1133916"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.101"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.39"},{"key":"e_1_2_1_25_1","volume-title":"Rich Data: Risks, Issues, Controversies 8 Hype. Keynote speech at the International Conference on Advanced Data Mining and Applications.","author":"Zaiane Osmar","year":"2014","unstructured":"Osmar Zaiane . 2014 . Rich Data: Risks, Issues, Controversies 8 Hype. Keynote speech at the International Conference on Advanced Data Mining and Applications. Osmar Zaiane. 2014. Rich Data: Risks, Issues, Controversies 8 Hype. Keynote speech at the International Conference on Advanced Data Mining and Applications."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining. 283--286","author":"Zaki Mohammed J.","year":"1997","unstructured":"Mohammed J. Zaki , Srinivasan Parthasarathy , Mitsunori Ogihara , and Wei Li . 1997 . New algorithms for fast discovery of association rules . In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining. 283--286 . Mohammed J. Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, and Wei Li. 1997. New algorithms for fast discovery of association rules. In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining. 283--286."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-013-0887-x"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2457443.2457445"}],"container-title":["ACM Transactions on Reconfigurable Technology and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3027485","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3027485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:00Z","timestamp":1750220640000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3027485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,27]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9,30]]}},"alternative-id":["10.1145\/3027485"],"URL":"https:\/\/doi.org\/10.1145\/3027485","relation":{},"ISSN":["1936-7406","1936-7414"],"issn-type":[{"value":"1936-7406","type":"print"},{"value":"1936-7414","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,27]]},"assertion":[{"value":"2016-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}