{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:58:42Z","timestamp":1778345922922,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:00:00Z","timestamp":1659484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:00:00Z","timestamp":1659484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10586-022-03673-5","type":"journal-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T16:03:09Z","timestamp":1659542589000},"page":"4463-4480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["PartEclat: an improved Eclat-based frequent itemset mining algorithm on spark clusters using partition technique"],"prefix":"10.1007","volume":"25","author":[{"given":"Shashi","family":"Raj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3338-6520","authenticated-orcid":false,"given":"Dharavath","family":"Ramesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,3]]},"reference":[{"key":"3673_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07821-2_2","volume-title":"Frequent pattern mining algorithms A survey","author":"CC Aggarwal","year":"2014","unstructured":"Aggarwal, C.C., Bhuiyan, M.A., Hasan, M.A.: Frequent pattern mining algorithms A survey. Frequent pattern mining Springer, Cham (2014)"},{"issue":"4","key":"3673_CR2","first-page":"83","volume":"5","author":"J Han","year":"2011","unstructured":"Han, J., Kamber, M., Pei, J.: Data mining concepts and techniques third edition. Morgan Kaufmann Series Data Manag Sys 5(4), 83\u2013124 (2011)","journal-title":"Morgan Kaufmann Series Data Manag Sys"},{"key":"3673_CR3","unstructured":"Zhao, Qiankun, and Sourav S. Bhowmick (2003) Association rule mining: A survey. Nanyang Technological University, Singapore 135"},{"key":"3673_CR4","first-page":"487","volume":"1215","author":"R Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: VLDB 1215, 487\u2013499 (1994)","journal-title":"VLDB"},{"issue":"2","key":"3673_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Rec. 29(2), 1\u201312 (2000)","journal-title":"ACM SIGMOD Rec."},{"issue":"3","key":"3673_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"3673_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2481244.2481246","volume":"14","author":"W Fan","year":"2013","unstructured":"Fan, W., Bifet, A.: Mining big data: current status, and forecast to the future. ACM SIGKDD Explorations Newsl 14(2), 1\u20135 (2013)","journal-title":"ACM SIGKDD Explorations Newsl"},{"issue":"1","key":"3673_CR8","first-page":"97","volume":"26","author":"X Wu","year":"2013","unstructured":"Wu, X., Zhu, X., Gong-Qing, Wu., Ding, W.: Data mining with big data. IEEE Trans. Knowl. Data Eng. 26(1), 97\u2013107 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"3673_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"MJ Zaki","year":"1999","unstructured":"Zaki, M.J.: Parallel and distributed association mining: A survey. IEEE Concurr. 7(4), 14\u201325 (1999)","journal-title":"IEEE Concurr."},{"issue":"1","key":"3673_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/1629175.1629198","volume":"53","author":"J Dean","year":"2010","unstructured":"Dean, J., Ghemawat, S.: MapReduce: a flexible data processing tool. Commun. ACM 53(1), 72\u201377 (2010)","journal-title":"Commun. ACM"},{"key":"3673_CR11","doi-asserted-by":"crossref","unstructured":"The Apache Software Foundation. \u201cApache Spark: Lightning-fast cluster computing\u201d, March 2021, http:\/\/spark.apache.org\/. Spark1.6.0","DOI":"10.1007\/978-1-4842-7383-8_1"},{"key":"3673_CR12","doi-asserted-by":"crossref","unstructured":"Li, Ning, Li Zeng, Qing He, and Zhongzhi Shi. Parallel implementation of apriori algorithm based on mapreduce. In\u00a02012 13th ACIS international conference on software engineering, artificial intelligence, networking and parallel\/distributed computing, pp. 236\u2013241. IEEE, 2012.","DOI":"10.1109\/SNPD.2012.31"},{"key":"3673_CR13","unstructured":"Singh, Sudhakar, Rakhi Garg, and P. K. Mishra (2017) Review of apriori based algorithms on mapreduce framework.\"\u00a0arXiv preprint arXiv:1702.06284"},{"issue":"10","key":"3673_CR14","doi-asserted-by":"publisher","first-page":"2851","DOI":"10.1109\/TCYB.2017.2751081","volume":"48","author":"JM Luna","year":"2017","unstructured":"Luna, J.M., Padillo, F., Pechenizkiy, M., Ventura, S.: Apriori versions based on mapreduce for mining frequent patterns on big data. IEEE Transact Cybern 48(10), 2851\u20132865 (2017)","journal-title":"IEEE Transact Cybern"},{"key":"3673_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11227-020-03253-7","volume":"77","author":"S Raj","year":"2021","unstructured":"Raj, S., Ramesh, D., Sethi, K.K.: A Spark-based Apriori algorithm with reduced shuffle overhead. J Supercomput 77, 133\u2013151 (2021)","journal-title":"J Supercomput"},{"key":"3673_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888918000127","author":"EPS Castro","year":"2018","unstructured":"Castro, E.P.S., Maia, T.D., Pereira, M.R., Esmin, A.A.A., Pereira, D.A.: Review and comparison of Apriori algorithm implementations on Hadoop-MapReduce and Spark. The Knowledge Engineering Review (2018). https:\/\/doi.org\/10.1017\/S0269888918000127","journal-title":"The Knowledge Engineering Review"},{"key":"3673_CR17","doi-asserted-by":"crossref","unstructured":"Li, Haoyuan, Yi Wang, Dong Zhang, Ming Zhang, and Edward Y. Chang (2008). Pfp: parallel fp-growth for query recommendation. In\u00a0Proceedings of the 2008 ACM conference on Recommender systems, pp. 107\u2013114","DOI":"10.1145\/1454008.1454027"},{"issue":"3","key":"3673_CR18","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"RC Agarwal","year":"2001","unstructured":"Agarwal, R.C., Aggarwal, C.C., Prasad, V.V.V.: A tree projection algorithm for generation of frequent item sets. J. Parallel Distributed Comput. 61(3), 350\u2013371 (2001)","journal-title":"J. Parallel Distributed Comput."},{"issue":"10","key":"3673_CR19","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using fp-trees. IEEE Trans. Knowl. Data Eng. 17(10), 1347\u20131362 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3673_CR20","doi-asserted-by":"crossref","unstructured":"Zhou, Le, Zhiyong Zhong, Jin Chang, Junjie Li, Joshua Zhexue Huang, and Shengzhong Feng (2010) Balanced parallel fp-growth with mapreduce. In\u00a02010 IEEE youth conference on information, computing and telecommunications, pp. 243\u2013246. IEEE","DOI":"10.1109\/YCICT.2010.5713090"},{"key":"3673_CR21","doi-asserted-by":"crossref","unstructured":"Deng, Lingling, and Yuansheng Lou (2015) Improvement and research of FP-growth algorithm based on distributed spark.\" In\u00a02015 International Conference on Cloud Computing and Big Data (CCBD), pp. 105\u2013108. IEEE","DOI":"10.1109\/CCBD.2015.15"},{"key":"3673_CR22","doi-asserted-by":"crossref","unstructured":"Zaki, Mohammed J., and Karam Gouda (2003) Fast vertical mining using diffsets.\" In\u00a0Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 326\u2013335","DOI":"10.1145\/956750.956788"},{"key":"3673_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22849-5_27","volume-title":"Parallel eclat for opportunistic mining of frequent itemsets","author":"J Liu","year":"2015","unstructured":"Liu, J., Yongsheng, Wu., Zhou, Q., Fung, B., Chen, F., Binxiao, Yu.: Parallel eclat for opportunistic mining of frequent itemsets. In Database and Expert Systems Applications, Springer, Cham (2015)"},{"key":"3673_CR24","first-page":"755","volume-title":"International Conference on Computer Networks and Inventive Communication Technologies","author":"P Singh","year":"2019","unstructured":"Singh, P., Sudhakar Singh, P.K., Mishra, and Rakhi Garg,: RDD-Eclat: approaches to parallelize Eclat algorithm on spark RDD framework. In: International Conference on Computer Networks and Inventive Communication Technologies, pp. 755\u2013768. Springer, Cham (2019)"},{"issue":"2","key":"3673_CR25","doi-asserted-by":"publisher","first-page":"3948","DOI":"10.1109\/JIOT.2018.2885851","volume":"6","author":"C Zhang","year":"2018","unstructured":"Zhang, C., Tian, P., Zhang, X., Jiang, Z.L., Yao, L., Wang, X.: Fast eclat algorithms based on minwise hashing for large scale transactions. IEEE Internet Things J. 6(2), 3948\u20133961 (2018)","journal-title":"IEEE Internet Things J."},{"key":"3673_CR26","doi-asserted-by":"crossref","unstructured":"Lin, Xueyan (2014) Mr-apriori Association rules algorithm based on mapreduce. In\u00a02014 IEEE 5th international conference on software engineering and service science, pp. 141\u2013144. IEEE","DOI":"10.1109\/ICSESS.2014.6933531"},{"key":"3673_CR27","doi-asserted-by":"crossref","unstructured":"Lin, Ming-Yen, Pei-Yu Lee, and Sue-Chen Hsueh (2012) Apriori-based frequent itemset mining algorithms on MapReduce. In Proceedings of the 6th international conference on ubiquitous information management and communication, pp. 1\u20138","DOI":"10.1145\/2184751.2184842"},{"issue":"3","key":"3673_CR28","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1007\/s10586-018-1812-0","volume":"21","author":"K-W Chon","year":"2018","unstructured":"Chon, K.-W., Kim, M.-S.: BIGMiner: a fast and scalable distributed frequent pattern miner for big data. Clust. Comput. 21(3), 1507\u20131520 (2018)","journal-title":"Clust. Comput."},{"key":"3673_CR29","doi-asserted-by":"crossref","unstructured":"Chen, Zhuang, Shibang Cai, Qiulin Song, and Chonglai Zhu (2011) An improved Apriori algorithm based on pruning optimization and transaction reduction. In\u00a02011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), pp. 1908\u20131911. IEEE,","DOI":"10.1109\/AIMSEC.2011.6010883"},{"issue":"3","key":"3673_CR30","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/TSMC.2015.2437327","volume":"46","author":"Y Xun","year":"2015","unstructured":"Xun, Y., Zhang, J., Qin, X.: Fidoop: Parallel mining of frequent itemsets using mapreduce. IEEE transac Sys, Man, and Cybernetics 46(3), 313\u2013325 (2015)","journal-title":"IEEE transac Sys, Man, and Cybernetics"},{"key":"3673_CR31","doi-asserted-by":"crossref","unstructured":"Moens, Sandy, Emin Aksehirli, and Bart Goethals (2013) Frequent itemset mining for big data. In\u00a02013 IEEE international conference on big data, 111\u2013118. IEEE","DOI":"10.1109\/BigData.2013.6691742"},{"issue":"4","key":"3673_CR32","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. 18(4), 1493\u20131501 (2015)","journal-title":"Clust. Comput."},{"key":"3673_CR33","doi-asserted-by":"crossref","unstructured":"Qiu, Hongjian, Rong Gu, Chunfeng Yuan, and Yihua Huang (2014) Yafim: a parallel frequent itemset mining algorithm with spark. In\u00a02014 IEEE International Parallel & Distributed Processing Symposium Workshops, pp. 1664\u20131671. IEEE","DOI":"10.1109\/IPDPSW.2014.185"},{"key":"3673_CR34","doi-asserted-by":"crossref","unstructured":"Rathee, Sanjay, Manohar Kaul, and Arti Kashyap (2015) R-Apriori: an efficient apriori based algorithm on spark. In Proceedings of the 8th workshop on Ph. D. Workshop in information and knowledge management, pp. 27\u201334","DOI":"10.1145\/2809890.2809893"},{"issue":"8","key":"3673_CR35","doi-asserted-by":"publisher","first-page":"3652","DOI":"10.1007\/s11227-017-1963-4","volume":"73","author":"KK Sethi","year":"2017","unstructured":"Sethi, K.K., Ramesh, D.: HFIM a Spark-based hybrid frequent itemset mining algorithm for big data processing. J. Supercomput. 73(8), 3652\u20133668 (2017)","journal-title":"J. Supercomput."},{"issue":"1","key":"3673_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-018-0112-0","volume":"5","author":"S Rathee","year":"2018","unstructured":"Rathee, S., Kashyap, A.: Adaptive-Miner: an efficient distributed association rule mining algorithm on Spark. J. Big Data 5(1), 1\u201317 (2018)","journal-title":"J. Big Data"},{"issue":"9","key":"3673_CR37","doi-asserted-by":"publisher","first-page":"3565","DOI":"10.1007\/s10115-020-01464-1","volume":"62","author":"S Raj","year":"2020","unstructured":"Raj, S., Dharavath Ramesh, M., Sreenu, and Krishan Kumar Sethi,: EAFIM Efficient apriori-based frequent itemset mining algorithm on Spark for big transactional data. Knowledge Informat Syst 62(9), 3565\u20133583 (2020)","journal-title":"Knowledge Informat Syst"},{"key":"3673_CR38","doi-asserted-by":"crossref","unstructured":"Shi, Xiujin, Shaozong Chen, and Hui Yang (2017) DFPS: Distributed FP-growth algorithm based on Spark.\" In\u00a02017 IEEE 2nd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), pp. 1725\u20131731. IEEE","DOI":"10.1109\/IAEAC.2017.8054308"},{"issue":"10","key":"3673_CR39","doi-asserted-by":"publisher","first-page":"7619","DOI":"10.1007\/s11227-020-03190-5","volume":"76","author":"W Xiao","year":"2020","unstructured":"Xiao, W., Juan, Hu.: SWEclat: a frequent itemset mining algorithm over streaming data using Spark Streaming. J. Supercomput. 76(10), 7619\u20137634 (2020)","journal-title":"J. Supercomput."},{"key":"3673_CR40","doi-asserted-by":"crossref","unstructured":"Yang, Shaosong, Guoyan Xu, Zhijian Wang, and Fachao Zhou (2015) The parallel improved Apriori algorithm research based on Spark In\u00a02015 Ninth International Conference on Frontier of Computer Science and Technology, pp. 354\u2013359. IEEE","DOI":"10.1109\/FCST.2015.28"},{"key":"3673_CR41","unstructured":"Frequent Itemset Mining Dataset repository. February, 2021, http:\/\/fimi.uantwerpen.be\/data\/"},{"key":"3673_CR42","unstructured":"SPMF: An Open-Source Data Mining Library, February, 2021. http:\/\/www.philippe-fournier-viger.com\/spmf\/index.php?link=datasets.php"},{"key":"3673_CR43","unstructured":"UCI Machine Learning Repository, February, 2021. https:\/\/archive.ics.uci.edu\/ml\/datasets.php"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03673-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-022-03673-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03673-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T14:38:23Z","timestamp":1666881503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-022-03673-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,3]]},"references-count":43,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["3673"],"URL":"https:\/\/doi.org\/10.1007\/s10586-022-03673-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,3]]},"assertion":[{"value":"12 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they do not have any commercial or associative interest representing a conflict of interest connected with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}