{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:11:45Z","timestamp":1772910705968,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,2,2]],"date-time":"2013-02-02T00:00:00Z","timestamp":1359763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11227-013-0887-x","type":"journal-article","created":{"date-parts":[[2013,2,1]],"date-time":"2013-02-01T15:38:35Z","timestamp":1359733115000},"page":"94-117","source":"Crossref","is-referenced-by-count":36,"title":["Accelerating frequent itemset mining on graphics processing units"],"prefix":"10.1007","volume":"66","author":[{"given":"Fan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason D.","family":"Bakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,2]]},"reference":[{"key":"887_CR1","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal R, Shafer JC (1996) Parallel mining of association rules. IEEE Trans Knowl Data Eng 8:962\u2013969","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"887_CR2","first-page":"487","volume-title":"Proc of 20th intl conf on VLDB","author":"R Agrawal","year":"1994","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proc of 20th intl conf on VLDB, pp 487\u2013499"},{"issue":"3","key":"887_CR3","first-page":"377","volume":"35","author":"E Ansari","year":"2008","unstructured":"Ansari E, Dastghaibifard G (2008) Distributed frequent itemset mining using trie data structure. Int J Comput Sci 35(3):377\u2013381","journal-title":"Int J Comput Sci"},{"key":"887_CR4","unstructured":"Aouad LM, Na L-k (2007) Distributed frequent itemsets mining in heterogeneous platforms. J Eng Comput Arch 1(2), ISSN: 1934\u20137197"},{"key":"887_CR5","unstructured":"Bart G (2004) Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data\/"},{"key":"887_CR6","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/1133905.1133913","volume-title":"Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, OSDM \u201905","author":"F Bodon","year":"2005","unstructured":"Bodon F (2005) A trie-based APRIORI implementation for mining frequent item sequences. In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, OSDM \u201905. ACM Press, New York, pp 56\u201365"},{"key":"887_CR7","first-page":"90","volume-title":"Proc 1st IEEE ICDM workshop on frequent item set mining implementations (FIMI 2003)","author":"C Borgelt","year":"2003","unstructured":"Borgelt C (2003) Efficient implementations of apriori and eclat. In: Proc 1st IEEE ICDM workshop on frequent item set mining implementations (FIMI 2003), pp 90\u201399"},{"key":"887_CR8","first-page":"395","volume-title":"15th conference on computational statistics","author":"C Borgelt","year":"2002","unstructured":"Borgelt C, Kruse R (2002) Induction of association rules: apriori implementation. In: 15th conference on computational statistics, pp 395\u2013400"},{"key":"887_CR9","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/ICDE.2001.914857","volume-title":"Proceedings 17th international conference on data engineering","author":"D Burdick","year":"2001","unstructured":"Burdick D, Calimlim M (2001) Mafia: a maximal frequent itemset algorithm for transactional databases. In: Proceedings 17th international conference on data engineering, pp 443\u2013452"},{"key":"887_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/ISPDC.2008.45","volume-title":"International symposium on parallel and distributed computing, 2008, ISPDC \u201908","author":"M Craus","year":"2008","unstructured":"Craus M (2008) A new parallel algorithm for the frequent itemset mining problem. In: International symposium on parallel and distributed computing, 2008, ISPDC \u201908, pp 165\u2013170"},{"key":"887_CR11","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/1565694.1565702","volume-title":"Proceedings of the fifth international workshop on data management on new hardware, DaMoN \u201909","author":"W Fang","year":"2009","unstructured":"Fang W, Lu M (2009) Frequent itemset mining on graphics processors. In: Proceedings of the fifth international workshop on data management on new hardware, DaMoN \u201909. ACM Press, New York, pp\u00a034\u201342"},{"key":"887_CR12","volume-title":"IEEE ICDM workshop on frequent itemset mining implementations (FIMI\u201903)","author":"A Fiat","year":"2003","unstructured":"Fiat A, Shporer S (2003) AIM: another itemset miner. In: IEEE ICDM workshop on frequent itemset mining implementations (FIMI\u201903)"},{"issue":"1","key":"887_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1007730.1007744","volume":"6","author":"B Goethals","year":"2004","unstructured":"Goethals B, Zaki MJ (2004) Advances in frequent itemset mining implementations: report on fimi\u201903. ACM SIGKDD Explor Newsl 6(1):109\u2013117","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"887_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J (2004) Mining frequent patterns without candidate generation: a Frequent-Pattern tree approach. Data Min Knowl Discov 8:53\u201387","journal-title":"Data Min Knowl Discov"},{"key":"887_CR15","volume-title":"Proc of the workshop on frequent itemset mining implementations","author":"WA Kosters","year":"2003","unstructured":"Kosters WA, Pijls W (2003) APRIORI, a depth first implementation. In: Proc of the workshop on frequent itemset mining implementations"},{"key":"887_CR16","first-page":"1275","volume-title":"VLDB \u201907","author":"L Liu","year":"2007","unstructured":"Liu L, Li E (2007) Optimization of frequent itemset mining on Multiple-Core processor. In: VLDB \u201907, pp 1275\u20131285"},{"key":"887_CR17","volume-title":"NVIDIA CUDA compute unified device architecture programming guide","author":"NVIDIA","year":"2011","unstructured":"NVIDIA (2011) NVIDIA CUDA compute unified device architecture programming guide. NVIDIA, Santa Clara"},{"key":"887_CR18","first-page":"43","volume-title":"Proc Supercomputing\u201996","author":"S Parthasarathy","year":"1996","unstructured":"Parthasarathy S, Zaki MJ (1996) Parallel data mining for association rules on shared-memory multiprocessors. In: Proc Supercomputing\u201996, pp 43\u201364"},{"key":"887_CR19","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-36175-8_47","volume-title":"Advances in knowledge discovery and data mining","author":"I Pramudiono","year":"2003","unstructured":"Pramudiono I, Kitsuregawa M (2003) Parallel FP-Growth on PC cluster. In: Advances in knowledge discovery and data mining. Lecture notes in computer science, vol 2637. Springer, Berlin\/Heidelberg, pp 467\u2013473"},{"key":"887_CR20","volume-title":"FIMI 03, frequent itemset mining implementations. Proceedings of the ICDM 2003 workshop on frequent itemset mining implementations","author":"O Salvatore","year":"2003","unstructured":"Salvatore O, Claudio L (2003) kdci: a multi-strategy algorithm for mining frequent sets. In: Goethals B, Zaki MJ (eds) FIMI 03, frequent itemset mining implementations. Proceedings of the ICDM 2003 workshop on frequent itemset mining implementations, 19 December 2003, Melbourne, Florida, USA, CEUR-WS.org, CEUR workshop proceedings, vol\u00a090"},{"key":"887_CR21","first-page":"233","volume-title":"Australian conference on artificial intelligence\u201903","author":"YG Sucahyo","year":"2003","unstructured":"Sucahyo YG, Gopalan RP (2003) Efficiently mining frequent patterns from dense datasets using a cluster of computers. In: Australian conference on artificial intelligence\u201903, pp 233\u2013244"},{"key":"887_CR22","first-page":"87","volume-title":"Fourth international conference on software engineering research, management and applications","author":"Y Ye","year":"2006","unstructured":"Ye Y, Chiang C (2006) A parallel apriori algorithm for frequent itemsets mining. In: Fourth international conference on software engineering research, management and applications, pp 87\u201394"},{"key":"887_CR23","first-page":"326","volume-title":"Proc SIGKDD","author":"MJ Zaki","year":"2003","unstructured":"Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In: Proc SIGKDD, pp 326\u2013335"},{"key":"887_CR24","first-page":"283","volume-title":"3rd intl conf on knowledge discovery and data mining","author":"MJ Zaki","year":"1997","unstructured":"Zaki MJ, Parthasarathyi S (1997) New algorithms for fast discovery of association rules. In: 3rd intl conf on knowledge discovery and data mining. AAAI Press, Menlo Park, pp 283\u2013286"},{"key":"887_CR25","first-page":"590","volume-title":"IEEE international conference on cluster computing","author":"F Zhang","year":"2012","unstructured":"Zhang F, Zhang Y, Bakos J (2012) Gpapriori: Gpu-accelerated frequent itemset mining. In: IEEE international conference on cluster computing, pp 590\u2013594"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-0887-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-013-0887-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-0887-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:24:09Z","timestamp":1559370249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-013-0887-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,2]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["887"],"URL":"https:\/\/doi.org\/10.1007\/s11227-013-0887-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,2]]}}}