{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:49:12Z","timestamp":1760708952488},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T00:00:00Z","timestamp":1448064000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s11227-015-1566-x","type":"journal-article","created":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T08:22:23Z","timestamp":1448094143000},"page":"347-370","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A sparse memory allocation data structure for sequential and parallel association rule mining"],"prefix":"10.1007","volume":"72","author":[{"given":"\u00d6mer M.","family":"Soysal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eera","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harisha","family":"Donepudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,21]]},"reference":[{"key":"1566_CR1","unstructured":"Agrawal A, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB conference, Santiago, Chile, pp 487\u2013499"},{"issue":"6","key":"1566_CR2","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(6):962\u2013969","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1566_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.3233\/IDA-2010-0456","volume":"15","author":"A Appice","year":"2011","unstructured":"Appice A, Ceci M, Turi A, Malerba D (2011) A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets. Intell Data Anal 15:69\u201388","journal-title":"Intell Data Anal"},{"key":"1566_CR4","unstructured":"Bayardo R (2014) Frequent itemset mining dataset repository. http:\/\/www.cs.rpi.edu\/~zaki\/Workshops\/FIMI\/data\/ (also available at http:\/\/fimi.ua.ac.be\/data\/ )"},{"key":"1566_CR5","doi-asserted-by":"crossref","unstructured":"Buza K (2014) Feedback prediction for blogs. In: Data analysis, machine learning and knowledge discovery, pp 145\u2013152. https:\/\/archive.ics.uci.edu\/ml\/datasets\/BlogFeedback","DOI":"10.1007\/978-3-319-01595-8_16"},{"issue":"3","key":"1566_CR6","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/TKDE.2002.1000339","volume":"14","author":"DW Cheung","year":"2002","unstructured":"Cheung DW, Lee SD, Xiao Y (2002) Effect of data skewness and workload balance in parallel data mining. IEEE Trans Knowl Data Eng 14(3):498\u2013514","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1566_CR7","unstructured":"ConcurrentQueue (2015). https:\/\/msdn.microsoft.com\/en-us\/library\/dd287208"},{"key":"1566_CR8","first-page":"511","volume":"27","author":"SM Fakhrahmad","year":"2011","unstructured":"Fakhrahmad SM, Dastghaibyfard G (2011) An efficient frequent pattern mining method and its parallelization in transactional databases. J Inf Sci Eng 27:511\u2013525","journal-title":"J Inf Sci Eng"},{"key":"1566_CR9","doi-asserted-by":"crossref","unstructured":"Garg R, Mishra PK (2009) Some observations of sequential, parallel and distributed association rule mining algorithms. In: International Conference on Computer and Automation Engineering, pp 336\u2013342. doi: 10.1109\/ICCAE.2009.28","DOI":"10.1109\/ICCAE.2009.28"},{"key":"1566_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00778-006-0025-y","volume":"16","author":"A Ghoting","year":"2007","unstructured":"Ghoting A, Buehrer G, Parthasarathy S, Kim D, Nguyen A, Chen Y-K, Dubey P (2007) Cache-conscious frequent pattern mining on modern and emerging processors. VLDB J 16:77\u201396. doi: 10.1007\/s00778-006-0025-y","journal-title":"VLDB J"},{"issue":"9","key":"1566_CR11","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1002\/cpe.1379","volume":"21","author":"D Haglin","year":"2009","unstructured":"Haglin D, Mayes KR, Manning AM, Feo J, Gurd JR, Elliot M, Keane JA (2009) Factors affecting the performance of parallel mining of minimal unique itemsets on diverse architectures. Concurr Comput Pract Exp 21(9):1131\u20131158","journal-title":"Concurr Comput Pract Exp"},{"issue":"3","key":"1566_CR12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/69.846289","volume":"12","author":"E-H Han","year":"2000","unstructured":"Han E-H, Karypis G, Kumar V (2000) Scalable parallel data mining for association rules. IEEE Trans Knowl Data Eng 12(3):337\u2013352","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1566_CR13","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, Yin Y, Mao R (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":"1566_CR14","unstructured":"HSRG (2014) Highway Safety Research Group"},{"issue":"3","key":"1566_CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/B:DAPD.0000031634.19130.bd","volume":"16","author":"A Javed","year":"2004","unstructured":"Javed A, Khokhar A (2004) Frequent pattern mining on message passing multiprocessor systems. Distrib Parallel Databases 16(3):321\u2013334","journal-title":"Distrib Parallel Databases"},{"key":"1566_CR16","unstructured":"Kambadur P, Ghoting A, Gupta A, Lumsdaine A (2012) Extending task parallelism for frequent pattern mining. CoRR, abs\/1211.1658. arXiv:1211.1658v1 [cs.DC]"},{"key":"1566_CR17","doi-asserted-by":"crossref","unstructured":"Kambadur P, Gupta A, Ghoting A, Avron H, Lumsdaine A (2009) PFunc: modern task parallelism for modern high performance computing. Proc Conf High Perform Comput Netw Storage Anal. doi: 10.1145\/1654059.1654103","DOI":"10.1145\/1654059.1654103"},{"key":"1566_CR18","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.knosys.2013.04.004","volume":"49","author":"KW Lin","year":"2013","unstructured":"Lin KW, Lo Y-C (2013) Efficient algorithms for frequent pattern mining in many-task computing environments. Knowl Based Syst 49:10\u201321. doi: 10.1016\/j.knosys.2013.04.004","journal-title":"Knowl Based Syst"},{"key":"1566_CR19","unstructured":"Liu L, Li E, Zhang Y, Tang Z (2007) Optimization of frequent itemset mining on multiple-core processor. In: Proceedings of the 33rd international conference on very large data bases, pp 1275\u20131285"},{"key":"1566_CR20","doi-asserted-by":"crossref","unstructured":"Negrevergne B, Termier A, Mehaut J, Uno T (2010) Discovering closed frequent itemsets on multicore: parallelizing computations and optimizing memory accesses. In: IEEE international conference on high performance computing and simulation (HPCS), pp 521\u2013528","DOI":"10.1109\/HPCS.2010.5547082"},{"issue":"10","key":"1566_CR21","doi-asserted-by":"crossref","first-page":"4716","DOI":"10.1016\/j.eswa.2014.01.038","volume":"41","author":"D Nguyen","year":"2014","unstructured":"Nguyen D, Vo B, Le B (2014) Efficient strategies for parallel mining class association rules. Expert Syst Appl 41(10):4716\u20134729","journal-title":"Expert Syst Appl"},{"issue":"10","key":"1566_CR22","doi-asserted-by":"crossref","first-page":"1632","DOI":"10.1109\/TPDS.2011.32","volume":"22","author":"E Ozkural","year":"2011","unstructured":"Ozkural E, Ucar B, Aykanat C (2011) Parallel frequent item set mining with selective item replication. IEEE Trans Parallel Distrib Syst 22(10):1632\u20131640","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1566_CR23","unstructured":"Shanthi MM, Irudhayaraj AA (2009) Multithreading\u2014an efficient technique for enhancing application performance. Int J Recent Trends Eng 165\u2013167"},{"key":"1566_CR24","doi-asserted-by":"crossref","unstructured":"Shen Y, Fu Z, Zhang L, Wang J (2012) Parallel apriori algorithm based on the thread pool. IEEE Int Conf Computer Sci Serv Syst 2235\u20132238. doi: 10.1109\/CSSS.2012.555","DOI":"10.1109\/CSSS.2012.555"},{"key":"1566_CR25","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.knosys.2012.09.005","volume":"37","author":"MK Sohrabi","year":"2013","unstructured":"Sohrabi MK, Barforoush AA (2013) Parallel frequent itemset mining using systolic arrays. Knowl Based Syst 37:462\u2013471","journal-title":"Knowl Based Syst"},{"issue":"12","key":"1566_CR26","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1016\/j.jss.2006.03.016","volume":"79","author":"D Souliou","year":"2006","unstructured":"Souliou D, Pagourtzis A, Drosinos N, Tsanakas P (2006) Computing frequent itemsets in parallel using partial support trees. J Syst Softw 79(12):1735\u20131743","journal-title":"J Syst Softw"},{"issue":"5","key":"1566_CR27","doi-asserted-by":"crossref","first-page":"2582","DOI":"10.1016\/j.eswa.2014.10.049","volume":"42","author":"\u00d6M Soysal","year":"2015","unstructured":"Soysal \u00d6M (2015) Association rule mining with mostly associated sequential patterns. Expert Syst Appl 42(5):2582\u20132592","journal-title":"Expert Syst Appl"},{"key":"1566_CR28","doi-asserted-by":"crossref","unstructured":"Strack B, DeShazo JP, Gennings C, Olmo JL, Ventura S (2014) Impact of hba1c measurement on hospital readmission rates: analysis of 70,000 clinical database patient records. BioMed Res Int. doi: 10.1155\/2014\/781670","DOI":"10.1155\/2014\/781670"},{"issue":"10","key":"1566_CR29","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1016\/j.parco.2014.08.003","volume":"40","author":"L Vu","year":"2014","unstructured":"Vu L, Alaghband G (2014) Novel parallel method for association rule mining on multi-core shared memory systems. Parallel Comput 40(10):768\u2013785. doi: 10.1016\/j.parco.2014.08.003","journal-title":"Parallel Comput"},{"issue":"3","key":"1566_CR30","doi-asserted-by":"crossref","first-page":"2486","DOI":"10.1016\/j.eswa.2009.07.072","volume":"37","author":"KM Yu","year":"2010","unstructured":"Yu KM, Zhou J (2010) Parallel TID-based frequent pattern mining algorithm on a PC Cluster and grid computing system. Expert Syst Appl 37(3):2486\u20132494","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1566_CR31","doi-asserted-by":"crossref","first-page":"2459","DOI":"10.1016\/j.eswa.2009.07.074","volume":"37","author":"K-M Yu","year":"2010","unstructured":"Yu K-M, Zhou J, Hong T-P, Zhou J-L (2010) A load-balanced distributed parallel mining algorithm. Expert Syst Appl 37(3):2459\u20132464","journal-title":"Expert Syst Appl"},{"key":"1566_CR32","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1009773317876","volume":"1","author":"M Zaki","year":"1997","unstructured":"Zaki M, Parthasarathy S, Ogihara M (1997) Parallel algorithms for discovery of association rules. Data Min Knowl Discov 1:343\u2013373","journal-title":"Data Min Knowl Discov"},{"issue":"4","key":"1566_CR33","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"MJ Zaki","year":"1999","unstructured":"Zaki MJ (1999) Parallel and distributed association mining: a survey. IEEE Concurr 7(4):14\u201325","journal-title":"IEEE Concurr"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1566-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-015-1566-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-015-1566-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T19:33:31Z","timestamp":1567366411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-015-1566-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,21]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["1566"],"URL":"https:\/\/doi.org\/10.1007\/s11227-015-1566-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,21]]}}}