{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T13:09:22Z","timestamp":1781615362337,"version":"3.54.5"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,10,28]],"date-time":"2015-10-28T00:00:00Z","timestamp":1445990400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61173015"],"award-info":[{"award-number":["61173015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10586-015-0477-1","type":"journal-article","created":{"date-parts":[[2015,10,28]],"date-time":"2015-10-28T02:36:05Z","timestamp":1445999765000},"page":"1493-1501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":68,"title":["A distributed frequent itemset mining algorithm using Spark for Big Data analytics"],"prefix":"10.1007","volume":"18","author":[{"given":"Feng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Gui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiming","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdallah","family":"Shami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunlong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,10,28]]},"reference":[{"key":"477_CR1","first-page":"1","volume":"18","author":"R Sandhu","year":"2014","unstructured":"Sandhu, R., Sood, S.K.: Scheduling of big data applications on distributed cloud based on QoS parameters. Clust. Comput. 18, 1\u201312 (2014). doi: 10.1007\/s10586-014-0416-6","journal-title":"Clust. Comput."},{"issue":"1","key":"477_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10586-014-0405-9","volume":"18","author":"L Han","year":"2015","unstructured":"Han, L., Ong, H.Y.: Parallel data intensive applications using MapReduce: a data mining case study in biomedical sciences. Clust. Comput. 18(1), 403\u2013418 (2015). doi: 10.1007\/s10586-014-0405-9","journal-title":"Clust. Comput."},{"key":"477_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10586-013-0307-2","volume":"18","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Li, F., Fan, J.: Mining association rules in big data with NGEP. Clust. Comput. 18, 1\u20139 (2015). doi: 10.1007\/s10586-014-0419-3","journal-title":"Clust. Comput."},{"key":"477_CR4","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, vol. 1215, pp. 487\u2013499 (1994)"},{"issue":"6","key":"477_CR5","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal, R., Shafer, J.C.: Parallel mining of association rules. IEEE Trans. Knowl. Data Eng. 8(6), 962\u2013969 (1996). doi: 10.1109\/69.553164","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"477_CR6","doi-asserted-by":"crossref","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). doi: 10.1109\/TKDE.2005.166","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"477_CR7","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1007\/s13042-013-0172-6","volume":"5","author":"MH Mohamed","year":"2014","unstructured":"Mohamed, M.H., Darwieesh, M.M.: Efficient mining frequent itemsets algorithms. Int. J. Mach. Learn. Cybern. 5(6), 823\u2013833 (2014). doi: 10.1007\/s13042-013-0172-6","journal-title":"Int. J. Mach. Learn. Cybern."},{"issue":"2","key":"477_CR8","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10115-012-0514-9","volume":"33","author":"SG Totad","year":"2012","unstructured":"Totad, S.G., Geeta, R.B., Reddy, P.P.: Batch incremental processing for FP-tree construction using FP-Growth algorithm. Knowl. Inf. Syst. 33(2), 475\u2013490 (2012). doi: 10.1007\/s10115-012-0514-9","journal-title":"Knowl. Inf. Syst."},{"key":"477_CR9","doi-asserted-by":"crossref","unstructured":"Zhen-yu, L., Wei-xiang, X., Xumin, L.: Efficiently using matrix in mining maximum frequent itemset. In: WKDD\u201910. Third International Conference on Knowledge Discovery and Data Mining, 2010, pp. 50\u201354. IEEE (2010)","DOI":"10.1109\/WKDD.2010.27"},{"key":"477_CR10","unstructured":"Ye, Y., Chiang, C. C.: A parallel apriori algorithm for frequent itemsets mining. In: Fourth International Conference on, Software Engineering Research, Management and Applications, 2006, pp. 87\u201394. IEEE (2006)"},{"issue":"3","key":"477_CR11","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.jpdc.2012.11.001","volume":"73","author":"S Upadhyaya","year":"2013","unstructured":"Upadhyaya, S.: Parallel approaches to machine learning\u2014a comprehensive survey. J. Parallel Distrib. Comput. 73(3), 284\u2013292 (2013). doi: 10.1016\/j.jpdc.2012.11.001","journal-title":"J. Parallel Distrib. Comput."},{"key":"477_CR12","doi-asserted-by":"crossref","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, ACM 76 (2012). doi: 10.1145\/2184751.2184842","DOI":"10.1145\/2184751.2184842"},{"key":"477_CR13","doi-asserted-by":"crossref","unstructured":"Moens, S., Aksehirli, E., Goethals, B.: Frequent itemset mining for big data. In: IEEE International Conference on Big Data, pp. 111\u2013118, IEEE (2013)","DOI":"10.1109\/BigData.2013.6691742"},{"key":"477_CR14","volume-title":"Parallel Programming with MPI","author":"PS Pacheco","year":"1997","unstructured":"Pacheco, P.S.: Parallel Programming with MPI. Morgan Kaufmann Publishers Inc, San Francisco (1997)"},{"issue":"4","key":"477_CR15","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1007\/s10586-014-0361-4","volume":"17","author":"S Li","year":"2014","unstructured":"Li, S., Hoefler, T., Hu, C., et al.: Improved MPI collectives for MPI processes in shared address spaces. Clust. Comput. 17(4), 1139\u20131155 (2014). doi: 10.1007\/s10586-014-0361-4","journal-title":"Clust. Comput."},{"key":"477_CR16","doi-asserted-by":"crossref","unstructured":"Otey, M.E., Wang, C., Parthasarathy, S., et al.: Mining frequent itemsets in distributed and dynamic databases. In: Third IEEE International Conference on Data Mining, ICDM 2003, pp. 617\u2013620. IEEE (2003)","DOI":"10.1109\/ICDM.2003.1250991"},{"key":"477_CR17","unstructured":"Kaosar, M.G., Xu, Z., Yi, X.: Distributed Association rule mining with minimum communication overhead. In: Proceedings of the Eighth Australasian Data Mining Conference, vol. 101, pp. 17\u201323. Australian Computer Society Inc (2009)"},{"issue":"1","key":"477_CR18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008). doi: 10.1145\/1327452.1327492","journal-title":"Commun. ACM"},{"key":"477_CR19","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., et al.: Spark: cluster computing with working sets. In: Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing, pp. 10\u201310 (2010)"},{"issue":"1","key":"477_CR20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10586-014-0400-1","volume":"18","author":"H Jiang","year":"2015","unstructured":"Jiang, H., Chen, Y., Qiao, Z., et al.: Scaling up MapReduce-based big data processing on Multi-GPU systems. Clust. Comput. 18(1), 369\u2013383 (2015). doi: 10.1007\/s10586-014-0400-1","journal-title":"Clust. Comput."},{"key":"477_CR21","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume":"1910","author":"A Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. Lect. Notes Comput. Sci. 1910, 13\u201323 (2000)","journal-title":"Lect. Notes Comput. Sci."},{"key":"477_CR22","doi-asserted-by":"crossref","unstructured":"Pramudiono, I., Kitsuregawa, M.: Parallel FP-growth on PC cluster. In: Advances in Knowledge Discovery and Data Mining, pp. 467\u2013473. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36175-8_47"},{"key":"477_CR23","doi-asserted-by":"crossref","unstructured":"Gu, H., Hang, H., Lv, Q., et al.: Fusing text and frienships for location inference in online social networks. In: 2012 IEEE\/WIC\/ACM International Conferences on Web Intelligence and Intelligent Agent Technology (WI-IAT), vol. 1, pp. 158\u2013165. IEEE (2012)","DOI":"10.1109\/WI-IAT.2012.243"},{"key":"477_CR24","doi-asserted-by":"crossref","unstructured":"Gu, H., Xie, X., Lv, Q., et al.: Etree: effective and efficient event modeling for real-time online social media networks. In: 2011 IEEE\/WIC\/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT), vol. 1, pp. 300\u2013307. IEEE (2011)","DOI":"10.1109\/WI-IAT.2011.126"},{"issue":"11","key":"477_CR25","first-page":"1753","volume":"9","author":"S Priyadarsini","year":"2014","unstructured":"Priyadarsini, S., Viswanathan, R.: Web usage mining for better understanding of user pattern to improve productivity of E-business. Int. J. Appl. Eng. Res. 9(11), 1753\u20131763 (2014)","journal-title":"Int. J. Appl. Eng. Res."},{"issue":"7","key":"477_CR26","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1109\/TPDS.2007.70789","volume":"19","author":"A Boukerche","year":"2008","unstructured":"Boukerche, A., Samarah, S.: A novel algorithm for mining association rules in wireless ad hoc sensor networks. IEEE Trans. Parallel Distrib. Syst. 19(7), 865\u2013877 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"477_CR27","first-page":"676","volume":"9","author":"L Zhou","year":"2014","unstructured":"Zhou, L., Wang, X.: Research of the FP-growth algorithm based on cloud environments. J. Softw. 9(3), 676\u2013683 (2014). doi: 10.4304\/jsw.9.3.676-683","journal-title":"J. Softw."},{"key":"477_CR28","doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., et al.: Pfp: parallel fp-growth for query recommendation. In: Proceedings of the 2008 ACM Conference on Recommender Systems, ACM 107\u2013114 (2008). doi: 10.1145\/1454008.1454027","DOI":"10.1145\/1454008.1454027"},{"key":"477_CR29","doi-asserted-by":"crossref","unstructured":"Yu, K.M., Zhou, J., Hsiao, W.C.: Load balancing approach parallel algorithm for frequent pattern mining. In: Parallel Computing Technologies, pp. 623\u2013631. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-73940-1_63"},{"key":"477_CR30","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, vol. 4(2), pp. 21\u201330 (2000)"},{"key":"477_CR31","doi-asserted-by":"crossref","unstructured":"Chen, M., Gao, X., Li, H.: An efficient parallel FP-Growth algorithm. In: CyberC\u201909. International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2009, pp. 283\u2013286. IEEE (2009)","DOI":"10.1109\/CYBERC.2009.5342148"},{"key":"477_CR32","doi-asserted-by":"crossref","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, ACM 1183\u20131188 (2013). doi: 10.1145\/2492517.2500301","DOI":"10.1145\/2492517.2500301"},{"key":"477_CR33","doi-asserted-by":"crossref","unstructured":"Fumarola, F., Malerba, D.: A parallel algorithm for approximate frequent itemset mining using MapReduce. In: 2014 International Conference on High Performance Computing & Simulation (HPCS), pp. 335\u2013342. IEEE (2014)","DOI":"10.1109\/HPCSim.2014.6903705"},{"key":"477_CR34","doi-asserted-by":"crossref","unstructured":"Moens, S., Aksehirli, E., Goethals, B.: Frequent itemset mining for big data. In: 2013 IEEE International Conference on Big Data, pp. 111\u2013118. IEEE (2013)","DOI":"10.1109\/BigData.2013.6691742"},{"issue":"3","key":"477_CR35","doi-asserted-by":"crossref","first-page":"2459","DOI":"10.1016\/j.eswa.2009.07.074","volume":"37","author":"K Yu","year":"2010","unstructured":"Yu, K., Zhou, J., Zhou, J., et al.: A load-balanced distributed parallel mining algorithm. Expert Syst. Appl. 37(3), 2459\u20132464 (2010). doi: 10.1016\/j.eswa.2009.07.074","journal-title":"Expert Syst. Appl."},{"issue":"10","key":"477_CR36","doi-asserted-by":"crossref","first-page":"1632","DOI":"10.1109\/TPDS.2011.32","volume":"23","author":"E Ozkural","year":"2011","unstructured":"Ozkural, E., Ucar, B., Aykanat, C.: Parallel frequent item set mining with selective item replication. IEEE Trans. Parallel Distrib. Syst. 23(10), 1632\u20131640 (2011). doi: 10.1109\/TPDS.2011.32","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"477_CR37","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10115-009-0205-3","volume":"23","author":"LM Aouad","year":"2010","unstructured":"Aouad, L.M., Le-Khac, N.A., Kechadi, T.M.: Performance study of distributed Apriori-like frequent itemsets mining. Knowl. Inf. Syst. 23(1), 55\u201372 (2010). doi: 10.1007\/s10115-009-0205-3","journal-title":"Knowl. Inf. Syst."},{"key":"477_CR38","unstructured":"Chen, Z., Cai, S., Song, Q., et al.: An improved Apriori algorithm based on pruning optimization and transaction reduction. In: 2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), pp. 908\u20131911. IEEE (2011)"},{"key":"477_CR39","unstructured":"Zaharia, M., Chowdhury, M., Das, T., et al.: Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In: Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation, USENIX Association 2-2 (2012)"},{"issue":"4","key":"477_CR40","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"TH Haveliwala","year":"2003","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank: a context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng. 15(4), 784\u2013796 (2003). doi: 10.1109\/TKDE.2003.1208999","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"477_CR41","doi-asserted-by":"crossref","unstructured":"Xin, R.S., Rosen, J., Zaharia, M., et al.: Shark: SQL and rich analytics at scale. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, ACM 13\u201324 (2013). doi: 10.1145\/2463676.2465288","DOI":"10.1145\/2463676.2465288"},{"key":"477_CR42","doi-asserted-by":"crossref","unstructured":"Goethals, B., Zaki, M.J.: FIMI\u201903: Workshop on frequent itemset mining implementations. In: Third IEEE International Conference on Data Mining Workshop on Frequent Itemset Mining Implementations, pp.1\u201313. IEEE (2003)","DOI":"10.1145\/1007730.1007744"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-015-0477-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-015-0477-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-015-0477-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T21:42:48Z","timestamp":1567287768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-015-0477-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,28]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["477"],"URL":"https:\/\/doi.org\/10.1007\/s10586-015-0477-1","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,28]]}}}