{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:25:00Z","timestamp":1759134300445,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2015,11,17]],"date-time":"2015-11-17T00:00:00Z","timestamp":1447718400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,11,17]],"date-time":"2015-11-17T00:00:00Z","timestamp":1447718400000},"content-version":"vor","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":["61272263"],"award-info":[{"award-number":["61272263"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0845257(CAREER)"],"award-info":[{"award-number":["CCF-0845257(CAREER)"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s00500-015-1930-z","type":"journal-article","created":{"date-parts":[[2015,11,17]],"date-time":"2015-11-17T08:21:43Z","timestamp":1447748503000},"page":"2237-2249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A parallel algorithm for mining constrained frequent patterns using MapReduce"],"prefix":"10.1007","volume":"21","author":[{"given":"Xiaowu","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jifu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaling","family":"Xun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,17]]},"reference":[{"issue":"2","key":"1930_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Record 22(2):207\u2013216","journal-title":"ACM SIGMOD Record"},{"key":"1930_CR2","doi-asserted-by":"crossref","unstructured":"Chen CC, Tseng CY, Chen MS (2013) Highly scalable sequential pattern mining based on mapreduce model on the cloud. In: 2013 IEEE international congress on big data (BigData Congress), pp 310\u2013317","DOI":"10.1109\/BigData.Congress.2013.48"},{"issue":"6","key":"1930_CR3","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/69.553155","volume":"8","author":"MS Chen","year":"1996","unstructured":"Chen MS, Han J, Yu PS (1996) Data mining: an overview from a database perspective. IEEE Trans Knowl Data Eng 8(6):866\u2013883","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1930_CR4","doi-asserted-by":"crossref","unstructured":"Chen K, Zhang L, Li S, Ke W (2011) Research on association rules parallel algorithm based on fp-growth. In: Information computing and applications, pp 249\u2013256","DOI":"10.1007\/978-3-642-27452-7_33"},{"issue":"1","key":"1930_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"1930_CR6","doi-asserted-by":"crossref","unstructured":"Gao Y, Zhu S (2010) Improvement and realization of association rules mining algorithm based on FP-tree. In: 2010 2nd International conference on information science and engineering (ICISE), pp 1264\u20131266","DOI":"10.1109\/ICISE.2010.5691893"},{"issue":"2","key":"1930_CR7","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 (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Record 29(2):1\u201312","journal-title":"ACM SIGMOD Record"},{"issue":"1","key":"1930_CR8","doi-asserted-by":"publisher","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 Mining Knowl Discov 8(1):53\u201387","journal-title":"Data Mining Knowl Discov"},{"key":"1930_CR9","unstructured":"Han J, Kamber M (2006) Data mining. Concepts and techniques. Southeast Asia Edition"},{"key":"1930_CR10","doi-asserted-by":"crossref","unstructured":"Hong S, Huaxuan Z, Shiping C, Chunyan H (2013) The study of improved FP-growth algorithm in MapReduce. In: 1st International workshop on cloud computing and information security","DOI":"10.2991\/ccis-13.2013.58"},{"key":"1930_CR11","doi-asserted-by":"crossref","unstructured":"Hui-ling P, Yun-xing S (2012) A new FP-tree-based algorithm MMFI for mining the maximal frequent itemsets. In: 2012 IEEE international conference on computer science and automation engineering (CSAE), vol 2, pp 61\u201365","DOI":"10.1109\/CSAE.2012.6272728"},{"key":"1930_CR12","unstructured":"Islam ABMR, Chung TS (2011) An improved frequent pattern tree based association rule mining technique. In: 2011 International conference on information science and applications (ICISA), pp 1\u20138"},{"issue":"3","key":"1930_CR13","doi-asserted-by":"publisher","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":"1930_CR14","unstructured":"Lam C (2010) Hadoop in action. Manning Publications Co"},{"key":"1930_CR15","doi-asserted-by":"crossref","unstructured":"Liu Y, Jiang X, Chen H, Ma J, Zhang X (2009) Mapreduce-based pattern finding algorithm applied in motif detection for prescription compatibility network. In: Advanced parallel processing technologies, pp 341\u2013355","DOI":"10.1007\/978-3-642-03644-6_27"},{"key":"1930_CR16","doi-asserted-by":"crossref","unstructured":"Li H, Wang Y, Zhang D, Zhang, M, Chang EY (2008) Pfp: parallel fp-growth for query recommendation. In: Proceedings of the 2008 ACM conference on recommender systems, pp 107\u2013114","DOI":"10.1145\/1454008.1454027"},{"key":"1930_CR17","doi-asserted-by":"crossref","unstructured":"Rong Z, Xia D, Zhang Z (2013) Complex statistical analysis of big data: implementation and application of apriori and FP-growth algorithm based on MapReduce. In: 2013 4th IEEE international conference on software engineering and service science (ICSESS), pp 968\u2013972","DOI":"10.1109\/ICSESS.2013.6615467"},{"issue":"4","key":"1930_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.4018\/ijghpc.2013100106","volume":"5","author":"K Seki","year":"2013","unstructured":"Seki K, Jinno R, Uehara K (2013) Parallel distributed trajectory pattern mining using hierarchical grid with MapReduce. Int J Grid High Perform Comput 5(4):79\u201396","journal-title":"Int J Grid High Perform Comput"},{"key":"1930_CR19","doi-asserted-by":"crossref","unstructured":"Tu F, He B (2011) A parallel algorithm for mining association rules based on FP-tree. In: Advances in computer science, environment, ecoinformatics, and education, pp 399\u2013403","DOI":"10.1007\/978-3-642-23339-5_73"},{"key":"1930_CR20","unstructured":"Wang HJ, Hu CA (2010) Mining maximal patterns based on improved FP-tree and array technique. In: 2010 Third international symposium on intelligent information technology and security informatics (IITSI), pp 567\u2013571"},{"key":"1930_CR21","unstructured":"White T (2012) Hadoop: the definitive guide. O\u2019Reilly Media, Inc"},{"key":"1930_CR22","doi-asserted-by":"crossref","unstructured":"Yang XY, Liu Z, Fu Y (2010) MapReduce as a programming model for association rules algorithm on Hadoop. In: 2010 3rd International conference on information sciences and interaction sciences (ICIS), pp 99\u2013102","DOI":"10.1109\/ICICIS.2010.5534718"},{"key":"1930_CR23","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.knosys.2012.12.013","volume":"41","author":"J Zhang","year":"2013","unstructured":"Zhang J, Zhao X, Zhang S, Yin S, Qin X (2013) Interrelation analysis of celestial spectra data using constrained frequent pattern trees. Knowl Based Syst 41:77\u201388","journal-title":"Knowl Based Syst"},{"key":"1930_CR24","doi-asserted-by":"crossref","unstructured":"Zhou J, Yu KM (2008) Tidset-based parallel FP-tree algorithm for the frequent pattern mining problem on PC clusters. In: Advances in grid and pervasive computing, pp 18\u201328","DOI":"10.1007\/978-3-540-68083-3_5"},{"key":"1930_CR25","doi-asserted-by":"crossref","unstructured":"Zhou L, Zhong Z, Chang J, Li J, Huang JZ, Feng S (2010) Balanced parallel fp-growth with mapreduce. In: 2010 IEEE youth conference on information computing and telecommunications (YC-ICT), pp 243\u2013246","DOI":"10.1109\/YCICT.2010.5713090"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1930-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1930-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1930-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1930-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T15:11:54Z","timestamp":1589641914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1930-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,17]]},"references-count":25,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1930"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1930-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2015,11,17]]},"assertion":[{"value":"17 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interests regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}