{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T18:05:04Z","timestamp":1775585104767,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/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":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many algorithms have proposed to solve the association rule learning problem. However, most of these algorithms suffer from the problem of scalability either because of tremendous time complexity or memory usage, especially when the dataset is large and the minimum support (<jats:italic>minsup<\/jats:italic>) is set to a lower number. This paper introduces a heuristic approach based on divide-and-conquer which may exponentially reduce both the time complexity and memory usage to obtain approximate results that are close to the accurate results. It is shown from comparative experiments that the proposed heuristic approach can achieve significant speedup over existing algorithms.<\/jats:p>","DOI":"10.1186\/s40537-021-00473-3","type":"journal-article","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T14:21:46Z","timestamp":1623248506000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A scalable association rule learning heuristic for large datasets"],"prefix":"10.1186","volume":"8","author":[{"given":"Haosong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2036-850X","authenticated-orcid":false,"given":"Phillip C.-Y.","family":"Sheu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"473_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.procs.2016.05.180","volume":"85","author":"M Kaur","year":"2016","unstructured":"Kaur M, Kang S. Market basket analysis: identify the changing trends of market data using association rule mining. Procedia computer science. 2016;85:78\u201385.","journal-title":"Procedia computer science"},{"issue":"2","key":"473_CR2","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\u201331.","journal-title":"Brief Bioinform"},{"key":"473_CR3","unstructured":"Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proceedings of 20th international conference very large data bases, vol. 1215, VLDB. 1994, pp. 487\u201399."},{"issue":"2","key":"473_CR4","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. 2000;29(2):1\u201312.","journal-title":"ACM SIGMOD Rec"},{"issue":"3","key":"473_CR5","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ. Scalable algorithms for association mining. IEEE Trans Knowl Data Eng. 2000;12(3):372\u201390.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"473_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A. Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on Management of data. 1993, pp. 207\u201316.","DOI":"10.1145\/170036.170072"},{"key":"473_CR7","doi-asserted-by":"crossref","unstructured":"Stone A, Shiffman S, Atienza A, Nebeling L. The science of real-time data capture: self-reports in health research. Oxford University Press; 2007.","DOI":"10.1093\/oso\/9780195178715.001.0001"},{"key":"473_CR8","doi-asserted-by":"crossref","unstructured":"Dubois E, Bl\u00e4ttler C, Camachon C, Hurter C. Eye movements data processing for ab initio military pilot training. In: International conference on intelligent decision technologies. Springer, Cham, 2017. pp. 125\u201335.","DOI":"10.1007\/978-3-319-19857-6_12"},{"key":"473_CR9","doi-asserted-by":"publisher","unstructured":"Shiau Y, Liang S. Real-time network virtual military simulation system. In: 2007 11th international conference information visualization (IV '07), Zurich. 2007, pp. 807\u201312. doi: https:\/\/doi.org\/10.1109\/IV.2007.93.","DOI":"10.1109\/IV.2007.93"},{"issue":"4","key":"473_CR10","doi-asserted-by":"publisher","first-page":"2603","DOI":"10.1007\/s10462-018-9629-z","volume":"52","author":"CH Chee","year":"2019","unstructured":"Chee CH, Jaafar J, Aziz IA, Hasan MH, Yeoh W. Algorithms for frequent itemset mining: a literature review. Artif Intell Rev. 2019;52(4):2603\u201321.","journal-title":"Artif Intell Rev"},{"issue":"2","key":"473_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/568271.223813","volume":"24","author":"JS Park","year":"1995","unstructured":"Park JS, Chen MS, Yu PS. An effective hash-based algorithm for mining association rules. ACM SIGMOD Rec. 1995;24(2):175\u201386.","journal-title":"ACM SIGMOD Rec"},{"key":"473_CR12","doi-asserted-by":"crossref","unstructured":"Lin X. Mr-apriori: Association rules algorithm based on mapreduce. In: 2014 IEEE 5th international conference on software engineering and service science. IEEE. 2014, pp. 141\u2013144.","DOI":"10.1109\/ICSESS.2014.6933531"},{"key":"473_CR13","doi-asserted-by":"crossref","unstructured":"Nadimi-Shahraki MH, Mansouri M. Hp-Apriori: Horizontal parallel-apriori algorithm for frequent itemset mining from big data. In: 2017 IEEE 2nd international conference on big data analysis (ICBDA). IEEE. 2017, pp. 286\u2013290.","DOI":"10.1109\/ICBDA.2017.8078825"},{"key":"473_CR14","unstructured":"Houtsma M, Swami A. Set-oriented mining for association rules. IBM Almaden research center. research report RJ 9567, San Jose. 1993."},{"issue":"3","key":"473_CR15","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"RC Agarwal","year":"2001","unstructured":"Agarwal RC, Aggarwal CC, Prasad VVV. A tree projection algorithm for generation of frequent item sets. J Parallel Distrib Comput. 2001;61(3):350\u201371.","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"473_CR16","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1109\/TKDE.2006.1599386","volume":"18","author":"M Song","year":"2006","unstructured":"Song M, Rajasekaran S. A transaction mapping algorithm for frequent itemsets mining. IEEE Trans Knowl Data Eng. 2006;18(4):472\u201381.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"473_CR17","doi-asserted-by":"crossref","unstructured":"Baralis E, Cerquitelli T, Chiusano S. Grand A. P-Mine: Parallel itemset mining on large datasets. In: 2013 IEEE 29th international conference on data engineering workshops (ICDEW). IEEE. 2013, pp. 266\u2013271.","DOI":"10.1109\/ICDEW.2013.6547461"},{"key":"473_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.knosys.2013.10.013","volume":"55","author":"G Pyun","year":"2014","unstructured":"Pyun G, Yun U, Ryu KH. Efficient frequent pattern mining based on linear prefix tree. Knowl-Based Syst. 2014;55:125\u201339.","journal-title":"Knowl-Based Syst"},{"key":"473_CR19","doi-asserted-by":"crossref","unstructured":"Hoseini MS, Shahraki MN, Neysiani BS. A new algorithm for mining frequent patterns in can tree. In: 2015 2nd international conference on knowledge-based engineering and innovation (KBEI). IEEE. 2015, pp. 843\u2013846.","DOI":"10.1109\/KBEI.2015.7436153"},{"key":"473_CR20","doi-asserted-by":"crossref","unstructured":"Feddaoui I, Felhi F, Akaichi J. EXTRACT: New extraction algorithm of association rules from frequent itemsets. In: 2016 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM). IEEE. 2016, pp. 752\u20136.","DOI":"10.1109\/ASONAM.2016.7752322"},{"issue":"1","key":"473_CR21","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1257\/jel.49.1.72","volume":"49","author":"D Croushore","year":"2011","unstructured":"Croushore D. Frontiers of real-time data analysis. J Econ Liter. 2011;49(1):72\u2013100.","journal-title":"J Econ Liter"},{"key":"473_CR22","doi-asserted-by":"publisher","unstructured":"Yang XY, Liu Z, Fu Y. MapReduce as a programming model for association rules algorithm on Hadoop. In: The 3rd international conference on information sciences and interaction sciences, Chengdu. 2010, pp. 99\u2013102. Doi: https:\/\/doi.org\/10.1109\/ICICIS.2010.5534718.","DOI":"10.1109\/ICICIS.2010.5534718"},{"key":"473_CR23","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7 A, Meyerhenke H, Safro I, Sanders P, Schulz C. Recent advances in graph partitioning. In: Algorithm engineering. Springer, Cham. 2016, pp. 117\u201358.","DOI":"10.1007\/978-3-319-49487-6_4"},{"issue":"2","key":"473_CR24","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S. An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J. 1970;49(2):291\u2013307.","journal-title":"Bell Syst Tech J"},{"issue":"1","key":"473_CR25","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V. Multilevelk-way partitioning scheme for irregular graphs. J Parallel Distrib Comput. 1998;48(1):96\u2013129.","journal-title":"J Parallel Distrib Comput"},{"key":"473_CR26","doi-asserted-by":"crossref","unstructured":"McSherry F. Spectral partitioning of random graphs. In: Proceedings 42nd IEEE symposium on foundations of computer science. IEEE. 2001, pp. 529\u2013537.","DOI":"10.1109\/SFCS.2001.959929"},{"issue":"1","key":"473_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-011-0983-3","volume":"191","author":"P Galinier","year":"2011","unstructured":"Galinier P, Boujbel Z, Fernandes MC. An efficient memetic algorithm for the graph partitioning problem. Ann Oper Res. 2011;191(1):1\u201322.","journal-title":"Ann Oper Res"},{"key":"473_CR28","doi-asserted-by":"crossref","unstructured":"Sanders P, Schulz C. Engineering multilevel graph partitioning algorithms. In: European symposium on algorithms. Springer, Berlin, Heidelberg. 2011, pp. 469\u2013480.","DOI":"10.1007\/978-3-642-23719-5_40"},{"key":"473_CR29","unstructured":"Walshal C. The graph partitioning archive. 2020. https:\/\/chriswalshaw.co.uk\/partition\/."},{"issue":"1","key":"473_CR30","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput. 1998;20(1):359\u201392.","journal-title":"SIAM J Sci Comput"},{"key":"473_CR31","doi-asserted-by":"publisher","unstructured":"Heaton J. Comparing dataset characteristics that favor the Apriori, Eclat or FP-Growth frequent itemset mining algorithms. SoutheastCon 2016, Norfolk, VA. 2016, pp. 1\u20137, doi: https:\/\/doi.org\/10.1109\/SECON.2016.7506659.","DOI":"10.1109\/SECON.2016.7506659"},{"key":"473_CR32","unstructured":"Goethals B. Frequent itemset mining dataset repository. 2020. http:\/\/fimi.uantwerpen.be\/data\/"},{"key":"473_CR33","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin CW, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT. The SPMF open-source data mining library version 2. In: Proceedings 19th European conference on principles of data mining and knowledge discovery (PKDD 2016) Part III, Springer LNCS 9853. 2016, pp. 36\u201340.","DOI":"10.1007\/978-3-319-46131-1_8"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-021-00473-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-021-00473-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-021-00473-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T13:46:16Z","timestamp":1725198376000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-021-00473-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["473"],"URL":"https:\/\/doi.org\/10.1186\/s40537-021-00473-3","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"27 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"86"}}