{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T10:23:48Z","timestamp":1785839028632,"version":"3.56.0"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1016\/j.future.2019.09.041","type":"journal-article","created":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T01:59:41Z","timestamp":1569376781000},"page":"111-122","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":27,"special_numbering":"C","title":["Map-optimize-reduce: CAN tree assisted FP-growth algorithm for clusters based FP mining on Hadoop"],"prefix":"10.1016","volume":"103","author":[{"given":"J.","family":"Ragaventhiran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.K.","family":"Kavithadevi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.future.2019.09.041_b1","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/s10489-018-1259-2","article-title":"A novel mapreduce algorithm for distributed mining of sequential patterns using co-occurrence information","volume":"49","author":"Saleti","year":"2019","journal-title":"Appl. Intell."},{"key":"10.1016\/j.future.2019.09.041_b2","article-title":"Mining on Big Data using Hadoop MapReduce model","volume":"263","author":"Salman","year":"2017","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"10.1016\/j.future.2019.09.041_b3","doi-asserted-by":"crossref","unstructured":"C.-S. Wang, S.-L. Lin, J.-Y. Chang, MapReduce-based frequent pattern mining framework with multiple item support, in: Asian Conference on Intelligent Information and Database Systems ACIIDS 2017: Intelligent Information and Database Systems, 2017, pp. 65\u201374.","DOI":"10.1007\/978-3-319-54430-4_7"},{"issue":"1","key":"10.1016\/j.future.2019.09.041_b4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.fcij.2017.04.003","article-title":"Interesting association rule mining with consistent and inconsistent rule detection from big sales data in distributed environment","volume":"2","author":"Prajapatia","year":"2017","journal-title":"Future Comput. Inform. J."},{"issue":"2","key":"10.1016\/j.future.2019.09.041_b5","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/s11390-017-1726-y","article-title":"Parallel incremental frequent itemset mining for large data","volume":"32","author":"Song","year":"2017","journal-title":"J. Comput. Sci. Tech."},{"issue":"1","key":"10.1016\/j.future.2019.09.041_b6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TPDS.2016.2560176","article-title":"FiDoop-DP: Data partitioning in frequent itemset mining on Hadoop clusters","volume":"28","author":"Xun","year":"2017","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"8","key":"10.1016\/j.future.2019.09.041_b7","doi-asserted-by":"crossref","first-page":"3652","DOI":"10.1007\/s11227-017-1963-4","article-title":"HFIM: a Spark-based hybrid frequent itemset mining algorithm for big data processing","volume":"73","author":"Kumar\u00a0Sethi","year":"2017","journal-title":"J. Supercomput."},{"issue":"1","key":"10.1016\/j.future.2019.09.041_b8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-016-0931-2","article-title":"A highly scalable parallel algorithm for maximally informative k-itemset mining","volume":"50","author":"Salah","year":"2017","journal-title":"Knowl. Inf. Syst."},{"issue":"6","key":"10.1016\/j.future.2019.09.041_b9","article-title":"Adaptive-Miner: an efficient distributed association rule mining algorithm on Spark","volume":"5","author":"Rathee","year":"2018","journal-title":"J. Big Data"},{"issue":"1","key":"10.1016\/j.future.2019.09.041_b10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s11280-018-0566-1","article-title":"Scalable and parallel sequential pattern mining using Spark","volume":"22","author":"Yu","year":"2019","journal-title":"World Wide Web"},{"issue":"25","key":"10.1016\/j.future.2019.09.041_b11","article-title":"Kavosh: an effective Map-Reduce-based association rule mining method","volume":"5","author":"Barkhordari","year":"2018","journal-title":"J. Big Data"},{"key":"10.1016\/j.future.2019.09.041_b12","first-page":"1","article-title":"Multi-level dataset decomposition for parallel frequent itemset mining on a cluster of personal computers","author":"Huang","year":"2018","journal-title":"Cluster Comput."},{"issue":"1","key":"10.1016\/j.future.2019.09.041_b13","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/s11227-018-2578-0","article-title":"Load balancing in join algorithms for skewed data in MapReduce systems","volume":"75","author":"Gavagsaz","year":"2019","journal-title":"J. Supercomput."},{"issue":"7","key":"10.1016\/j.future.2019.09.041_b14","doi-asserted-by":"crossref","first-page":"3415","DOI":"10.1007\/s11227-018-2391-9","article-title":"Load balancing in reducers for skewed data in MapReduce systems by using scalable simple random sampling","volume":"74","author":"Gavagsaz","year":"2018","journal-title":"J. Supercomput."},{"key":"10.1016\/j.future.2019.09.041_b15","series-title":"Evolutionary Intelligence","first-page":"1","article-title":"Application of improved time series Apriori algorithm by frequent itemsets in association rule data mining based on temporal constraint","author":"Wang","year":"2019"},{"issue":"9","key":"10.1016\/j.future.2019.09.041_b16","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1007\/s00500-015-1930-z","article-title":"A parallel algorithm for mining constrained frequent patterns using MapReduce","volume":"21","author":"Yan","year":"2017","journal-title":"Soft Comput."},{"key":"10.1016\/j.future.2019.09.041_b17","series-title":"Data Science Analytics and Applications","first-page":"8","article-title":"A frequent and rare itemset mining approach to transaction clustering","author":"Tummala","year":"2018"},{"issue":"2","key":"10.1016\/j.future.2019.09.041_b18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.fcij.2018.06.002","article-title":"Partition based clustering of large datasets using MapReduce framework: An analysis of recent themes and directions","volume":"3","author":"Sardar","year":"2018","journal-title":"Future Comput. Inform. J."},{"key":"10.1016\/j.future.2019.09.041_b19","doi-asserted-by":"crossref","first-page":"68013","DOI":"10.1109\/ACCESS.2018.2880275","article-title":"Frequent itemset mining in Big Data with effective single scan algorithms","volume":"6","author":"djenouri","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.future.2019.09.041_b20","first-page":"1","article-title":"BIGMiner: a fast and scalable distributed frequent pattern miner for Big Data","author":"Chon","year":"2018","journal-title":"Cluster Comput."},{"key":"10.1016\/j.future.2019.09.041_b21","first-page":"271","article-title":"RTSBL: Reduce task scheduling based on the load balancing and the data locality in Hadoop","author":"Midoun","year":"2018"},{"issue":"6","key":"10.1016\/j.future.2019.09.041_b22","doi-asserted-by":"crossref","first-page":"744","DOI":"10.26599\/TST.2018.9010115","article-title":"An improved algorithm for optimizing MapReduce based on locality and overlapping","volume":"23","author":"Li","year":"2018","journal-title":"Tsinghua Sci. Technol."},{"issue":"4","key":"10.1016\/j.future.2019.09.041_b23","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TEM.2017.2712606","article-title":"A new methodology for mining frequent itemsets on temporal data","volume":"64","author":"Ghorbani","year":"2017","journal-title":"IEEE Trans. Eng. Manage."},{"issue":"10","key":"10.1016\/j.future.2019.09.041_b24","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TCYB.2017.2750691","article-title":"NOSEP: Nonoverlapping sequence pattern mining with gap constraints","volume":"48","author":"Wu","year":"2018","journal-title":"IEEE Trans. Cybern."},{"issue":"10","key":"10.1016\/j.future.2019.09.041_b25","doi-asserted-by":"crossref","first-page":"2851","DOI":"10.1109\/TCYB.2017.2751081","article-title":"Apriori versions based on MapReduce for mining frequent patterns on Big Data","volume":"48","author":"Luna","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.future.2019.09.041_b26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.eswa.2019.05.013","article-title":"A MapReduce solution for incremental mining of sequential patterns from Big Data","volume":"133","author":"Sumalatha","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.future.2019.09.041_b27","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.future.2018.05.085","article-title":"Mining of productive periodic-frequent patterns for IoT data analytics","volume":"88","author":"Ismail","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.09.041_b28","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.ins.2017.11.064","article-title":"Mining maximal frequent patterns in transactional databases and dynamic data streams: A spark-based approach","volume":"432","author":"Karim","year":"2018","journal-title":"Inform. Sci."},{"key":"10.1016\/j.future.2019.09.041_b29","series-title":"Database and Expert Systems Applications","first-page":"478","article-title":"MapFIM: Memory aware parallelized frequent itemset mining in very large datasets","author":"Duong","year":"2017"},{"key":"10.1016\/j.future.2019.09.041_b30","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-981-10-7245-1_43","article-title":"A novel approach of frequent itemset mining using HDFS framework","author":"Kulkarni","year":"2018"},{"issue":"10","key":"10.1016\/j.future.2019.09.041_b31","doi-asserted-by":"crossref","DOI":"10.3390\/app9102075","article-title":"MISFP-Growth: Hadoop-based frequent pattern mining with multiple item support","volume":"9","author":"Wang","year":"2019","journal-title":"Appl. Sci."},{"key":"10.1016\/j.future.2019.09.041_b32","doi-asserted-by":"crossref","first-page":"79162","DOI":"10.1109\/ACCESS.2018.2884888","article-title":"An efficient parallel mining algorithm representative pattern set of large-scale itemsets in IoT","volume":"6","author":"tianrui","year":"2018","journal-title":"IEEE Access"},{"issue":"9","key":"10.1016\/j.future.2019.09.041_b33","doi-asserted-by":"crossref","first-page":"2656","DOI":"10.1109\/TCYB.2017.2748225","article-title":"A distributed fuzzy associative classifier for Big Data","volume":"48","author":"Segatori","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.future.2019.09.041_b34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2018\/2818251","article-title":"A MapReduce-based parallel frequent pattern growth algorithm for spatiotemporal association analysis of mobile trajectory Big Data","volume":"2018","author":"Xia","year":"2018","journal-title":"Complexity"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X19315729?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X19315729?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T04:07:59Z","timestamp":1759118879000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X19315729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":34,"alternative-id":["S0167739X19315729"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2019.09.041","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2020,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Map-optimize-reduce: CAN tree assisted FP-growth algorithm for clusters based FP mining on Hadoop","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2019.09.041","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}