{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:59:16Z","timestamp":1764997156179,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,2,20]],"date-time":"2018-02-20T00:00:00Z","timestamp":1519084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s40537-018-0112-0","type":"journal-article","created":{"date-parts":[[2018,2,19]],"date-time":"2018-02-19T22:49:51Z","timestamp":1519080591000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["Adaptive-Miner: an efficient distributed association rule mining algorithm on Spark"],"prefix":"10.1186","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2853-0842","authenticated-orcid":false,"given":"Sanjay","family":"Rathee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arti","family":"Kashyap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,20]]},"reference":[{"key":"112_CR1","doi-asserted-by":"crossref","unstructured":"Wang T, Rudin C, Wagner D, Sevieri R. Learning to detect patterns of crime. In: European conference on machine learning and principles and practice of knowledge discovery in databases. 2013.","DOI":"10.1007\/978-3-642-40994-3_33"},{"key":"112_CR2","doi-asserted-by":"publisher","unstructured":"Buczak AL, Gifford CM. Fuzzy association rule mining for community crime pattern discovery. In: ACM SIGKDD workshop on intelligence and security informatics. ISI-KDD \u201910. New York: ACM; 2010. p. 2\u20131210. https:\/\/doi.org\/10.1145\/1938606.1938608 .","DOI":"10.1145\/1938606.1938608"},{"issue":"4","key":"112_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00778-006-0002-5","volume":"16","author":"L Khan","year":"2007","unstructured":"Khan L, Awad M, Thuraisingham B. A new intrusion detection system using support vector machines and hierarchical clustering. VLDB J. 2007;16(4):507\u201321. https:\/\/doi.org\/10.1007\/s00778-006-0002-5 .","journal-title":"VLDB J"},{"issue":"12","key":"112_CR4","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.14778\/2536274.2536288","volume":"6","author":"Y Amsterdamer","year":"2013","unstructured":"Amsterdamer Y, Grossman Y, Milo T, Senellart P. Crowdminer: mining association rules from the crowd. Proc VLDB Endow. 2013;6(12):1250\u20133. https:\/\/doi.org\/10.14778\/2536274.2536288 .","journal-title":"Proc VLDB Endow"},{"key":"112_CR5","doi-asserted-by":"publisher","unstructured":"Amsterdamer Y, Grossman Y, Milo T, Senellart P. Crowd mining. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data. SIGMOD \u201913. New York: ACM; 2013. p. 241\u201352. https:\/\/doi.org\/10.1145\/2463676.2465318 .","DOI":"10.1145\/2463676.2465318"},{"issue":"2","key":"112_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1093\/bib\/bbt074","volume":"16","author":"S Naulaerts","year":"2015","unstructured":"Naulaerts S, Meysman P, Bittremieux W, Vu TN, Vanden Berghe W, Goethals B, Laukens K. A primer to frequent itemset mining for bioinformatics. Brief Bioinform. 2015;16(2):216. https:\/\/doi.org\/10.1093\/bib\/bbt074 .","journal-title":"Brief Bioinform"},{"issue":"4","key":"112_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1009773317876","volume":"1","author":"MJ Zaki","year":"1997","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W. Parallel algorithms for discovery of association rules. Data Min Knowl Discov. 1997;1(4):343\u201373. https:\/\/doi.org\/10.1023\/A:1009773317876 .","journal-title":"Data Min Knowl Discov"},{"key":"112_CR8","doi-asserted-by":"publisher","unstructured":"Cheung DW, Xiao Y. In: Wu X, Kotagiri R, Korb KB, editors. Effect of data skewness in parallel mining of association rules. Berlin: Springer; 1998. p. 48\u201360. https:\/\/doi.org\/10.1007\/3-540-64383-4_5 .","DOI":"10.1007\/3-540-64383-4_5"},{"key":"112_CR9","doi-asserted-by":"publisher","unstructured":"Cheung DW, Han J, Ng VT, Fu AW, Fu Y. A fast distributed algorithm for mining association rules. In: Proceeding of fourth international conference on parallel and distributed information systems. 1996. p. 31\u201342. https:\/\/doi.org\/10.1109\/PDIS.1996.568665 .","DOI":"10.1109\/PDIS.1996.568665"},{"key":"112_CR10","doi-asserted-by":"publisher","unstructured":"Cheung DW, Hu K, Xia S. Asynchronous parallel algorithm for mining association rules on a shared-memory multi-processors. In: Proceedings of the tenth annual ACM symposium on parallel algorithms and architectures. SPAA \u201998. New York: ACM; 1998. p. 279\u201388. https:\/\/doi.org\/10.1145\/277651.277694 .","DOI":"10.1145\/277651.277694"},{"key":"112_CR11","doi-asserted-by":"publisher","unstructured":"Zaiane OR, El-Hajj M, Lu P. Fast parallel association rule mining without candidacy generation. In: Proceedings 2001 IEEE international conference on data mining. 2001. p. 665\u20138. https:\/\/doi.org\/10.1109\/ICDM.2001.989600 .","DOI":"10.1109\/ICDM.2001.989600"},{"key":"112_CR12","doi-asserted-by":"crossref","unstructured":"Pramudiono I, Kitsuregawa M. Parallel fp-growth on pc cluster. Adv Knowl Discov Data Min. 2003:570.","DOI":"10.1007\/3-540-36175-8_47"},{"key":"112_CR13","unstructured":"Li J, Roy P, Khan SU, Wang L, Bai Y. Data mining using clouds: an experimental implementation of Apriori over Mapreduce. In: 12th international conference on scalable computing and communications (ScalCom\u201913). 2012. p. 1\u20138."},{"key":"112_CR14","doi-asserted-by":"publisher","unstructured":"Lin M-Y, Lee P-Y, Hsueh S-C. Apriori-based frequent itemset mining algorithms on mapreduce. In: Proceedings of the 6th international conference on ubiquitous information management and communication. ICUIMC \u201912. New York: ACM; 2012. p. 76\u20131768. https:\/\/doi.org\/10.1145\/2184751.2184842 .","DOI":"10.1145\/2184751.2184842"},{"key":"112_CR15","doi-asserted-by":"publisher","unstructured":"Li N, Zeng L, He Q, Shi Z. Parallel implementation of apriori algorithm based on mapreduce. In: Proceedings of 13th ACIS international conference on software engineering, artificial intelligence, networking and parallel\/distributed computing. 2012. p. 236\u201341. https:\/\/doi.org\/10.1109\/SNPD.2012.31 .","DOI":"10.1109\/SNPD.2012.31"},{"key":"112_CR16","unstructured":"Yahya O, Hegazy O, Ezat E. An efficient implementation of A-Priori algorithm based on Hadoop-Mapreduce model. Int J Rev Comput. 2012;12."},{"key":"112_CR17","unstructured":"Apache Hadoop. Open-source software for reliable, scalable, distributed computing. Apache Hadoop. 2016. http:\/\/hadoop.apache.org\/docs\/r2.7.2\/ . Accessed 18 Mar 2016."},{"key":"112_CR18","unstructured":"Zaharia M, Chowdhury M, Franklin MJ, Shenker S, Stoica I. Spark: cluster computing with working sets. In: Proceedings of the 2Nd USENIX conference on hot topics in cloud computing. HotCloud\u201910. Berkeley: USENIX Association; 2010. p. 10. http:\/\/dl.acm.org\/citation.cfm?id=1863103.1863113"},{"key":"112_CR19","doi-asserted-by":"publisher","unstructured":"Qiu H, Gu R, Yuan C, Huang Y. Yafim: a parallel frequent itemset mining algorithm with spark. In: IEEE international parallel distributed processing symposium workshops. 2014. p. 1664\u201371. https:\/\/doi.org\/10.1109\/IPDPSW.2014.185 .","DOI":"10.1109\/IPDPSW.2014.185"},{"key":"112_CR20","doi-asserted-by":"publisher","unstructured":"Rathee S, Kaul M, Kashyap A. R-Apriori: an efficient apriori based algorithm on spark. In: Proceedings of the 8th workshop on Ph.D. workshop in information and knowledge management. PIKM 15. Melbourne: ACM; 2015. p. 27\u201334. https:\/\/doi.org\/10.1145\/2809890.2809893 .","DOI":"10.1145\/2809890.2809893"},{"key":"112_CR21","unstructured":"Dean J, Ghemawat S. Mapreduce: simplified data processing on large clusters. In: Proceedings of the 6th conference on symposium on opearting systems design & implementation, vol. 6. OSDI\u201904. Berkeley: USENIX Association; 2004. p. 10. http:\/\/dl.acm.org\/citation.cfm?id=1251254.1251264 ."},{"key":"112_CR22","doi-asserted-by":"publisher","unstructured":"Farzanyar Z, Cercone N. Efficient mining of frequent itemsets in social network data based on mapreduce framework. In: Proceedings of the 2013 IEEE\/ACM international conference on advances in social networks analysis and mining. ASONAM \u201913. New York: ACM; 2013. p. 1183\u20138. https:\/\/doi.org\/10.1145\/2492517.2500301 .","DOI":"10.1145\/2492517.2500301"},{"key":"112_CR23","doi-asserted-by":"publisher","unstructured":"Moens S, Aksehirli E, Goethals B. Frequent itemset mining for big data. In: Proceedings of IEEE international conference on big data. 2013. p. 111\u20138. https:\/\/doi.org\/10.1109\/BigData.2013.6691742 .","DOI":"10.1109\/BigData.2013.6691742"},{"key":"112_CR24","doi-asserted-by":"publisher","unstructured":"Li H, Wang Y, Zhang D, Zhang M, Chang EY. Pfp: parallel fp-growth for query recommendation. In: Proceedings of the 2008 ACM conference on recommender systems. RecSys \u201908. New York: ACM; 2008. p. 107\u201314. https:\/\/doi.org\/10.1145\/1454008.1454027 .","DOI":"10.1145\/1454008.1454027"},{"key":"112_CR25","doi-asserted-by":"publisher","unstructured":"Zhou L, Zhong Z, Chang J, Li J, Huang JZ, Feng S. Balanced parallel fp-growth with mapreduce. In: 2010 IEEE youth conference on information, computing and telecommunications. 2010. p. 243\u20136. https:\/\/doi.org\/10.1109\/YCICT.2010.5713090 .","DOI":"10.1109\/YCICT.2010.5713090"},{"key":"112_CR26","doi-asserted-by":"publisher","unstructured":"Yang XY, Liu Z, Fu Y. Mapreduce as a programming model for association rules algorithm on hadoop. In: Proceedings of the 3rd international conference on information sciences and interaction sciences. 2010. p. 99\u2013102. https:\/\/doi.org\/10.1109\/ICICIS.2010.5534718 .","DOI":"10.1109\/ICICIS.2010.5534718"},{"key":"112_CR27","doi-asserted-by":"publisher","unstructured":"Li L, Zhang M. The strategy of mining association rule based on cloud computing. In: Proceeding of international conference on business computing and global informatization. 2011. p. 475\u20138. https:\/\/doi.org\/10.1109\/BCGIn.2011.125 .","DOI":"10.1109\/BCGIn.2011.125"},{"key":"112_CR28","doi-asserted-by":"publisher","first-page":"1827","DOI":"10.1016\/j.proeng.2011.08.340","volume":"15","author":"H Yu","year":"2011","unstructured":"Yu H, Wen J, Wang H, Jun L. An improved apriori algorithm based on the boolean matrix and hadoop. Procedia Eng. 2011;15:1827\u201331.","journal-title":"Procedia Eng"},{"key":"112_CR29","doi-asserted-by":"publisher","unstructured":"Riondato M, DeBrabant JA, Fonseca R, Upfal E. Parma: a parallel randomized algorithm for approximate association rules mining in mapreduce. In: Proceedings of the 21st ACM international conference on information and knowledge management. CIKM \u201912. New York: ACM; 2012. p. 85\u201394. https:\/\/doi.org\/10.1145\/2396761.2396776 .","DOI":"10.1145\/2396761.2396776"},{"key":"112_CR30","doi-asserted-by":"publisher","unstructured":"Kov\u00e1cs F, Ill\u00e9s J. Frequent itemset mining on hadoop. In: 2013 IEEE 9th international conference on computational cybernetics (ICCC). 2013. p. 241\u20135. https:\/\/doi.org\/10.1109\/ICCCyb.2013.6617596 .","DOI":"10.1109\/ICCCyb.2013.6617596"},{"key":"112_CR31","unstructured":"Oruganti S, Ding Q, Tabrizi N. Exploring hadoop as a platform for distributed association rule mining. In: FUTURE COMPUTING 2013-the fifth international conference on future computational technologies and applications. 2013. p. 62\u20137."},{"key":"112_CR32","doi-asserted-by":"publisher","unstructured":"Yong W, Zhe Z, Fang W. A parallel algorithm of association rules based on cloud computing. In: Proceedings of 8th international conference on communications and networking in China (CHINACOM). 2013. p. 415\u20139. https:\/\/doi.org\/10.1109\/ChinaCom.2013.6694632 .","DOI":"10.1109\/ChinaCom.2013.6694632"},{"key":"112_CR33","doi-asserted-by":"publisher","unstructured":"Lin X. Mr-apriori: association rules algorithm based on mapreduce. In: Proceedings of IEEE 5th international conference on software engineering and service science. 2014. p. 141\u20134. https:\/\/doi.org\/10.1109\/ICSESS.2014.6933531 .","DOI":"10.1109\/ICSESS.2014.6933531"},{"key":"112_CR34","doi-asserted-by":"publisher","unstructured":"Barkhordari M, Niamanesh M. Scadibino: an effective mapreduce-based association rule mining method. In: Proceedings of the sixteenth international conference on electronic commerce. ICEC \u201914. New York: ACM; 2014. p. 1\u2013118. https:\/\/doi.org\/10.1145\/2617848.2617853 .","DOI":"10.1145\/2617848.2617853"},{"key":"112_CR35","doi-asserted-by":"crossref","unstructured":"Singh S, Garg R, Mishra P. Performance analysis of apriori algorithm with different data structures on hadoop cluster. 2015. arXiv preprint arXiv:1511.07017 .","DOI":"10.5120\/ijca2015906632"},{"issue":"4","key":"112_CR36","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1007\/s10586-015-0477-1","volume":"18","author":"F Zhang","year":"2015","unstructured":"Zhang F, Liu M, Gui F, Shen W, Shami A, Ma Y. A distributed frequent itemset mining algorithm using spark for big data analytics. Clust Comput. 2015;18(4):1493\u2013501.","journal-title":"Clust Comput"},{"key":"112_CR37","unstructured":"FIMI. FIMI datasets. FIMI. 2017. http:\/\/fimi.ua.ac.be\/data\/ . Accessed 2 Jan 2017."},{"key":"112_CR38","unstructured":"SPMF. SPMF: a java open-source data mining library. SPMF. 2017. http:\/\/www.philippe-fournier-viger.com\/spmf\/index.php?link=datasets.php . Accessed 2 Jan 2017."}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-018-0112-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-018-0112-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-018-0112-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T01:31:25Z","timestamp":1570757485000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-018-0112-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,20]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["112"],"URL":"https:\/\/doi.org\/10.1186\/s40537-018-0112-0","relation":{},"ISSN":["2196-1115"],"issn-type":[{"type":"electronic","value":"2196-1115"}],"subject":[],"published":{"date-parts":[[2018,2,20]]},"assertion":[{"value":"22 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"6"}}