{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T18:37:39Z","timestamp":1743273459528},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"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":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Association rule learning algorithms have been applied to microarray datasets to find association rules among genes. With the development of microarray technology, larger datasets have been generated recently that challenge the current association rule learning algorithms. Specifically, the large number of items per transaction significantly increases the running time and memory consumption of such tasks. In this paper, we propose the Scalable Association Rule Learning (SARL) heuristic that efficiently learns gene-disease association rules and gene\u2013gene association rules from large-scale microarray datasets. The rules are ranked based on their importance. Our experiments show the SARL algorithm outperforms the Apriori algorithm by one to three orders of magnitude.<\/jats:p>","DOI":"10.1186\/s40537-022-00577-4","type":"journal-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:04:02Z","timestamp":1648508642000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A scalable association rule learning and recommendation algorithm for large-scale microarray datasets"],"prefix":"10.1186","volume":"9","author":[{"given":"Haosong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phillip C.-Y.","family":"Sheu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"key":"577_CR1","unstructured":"Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proc. 20th int. conf. very large data bases, VLDB, Vol. 1215; 1994, p. 487\u201399."},{"issue":"2","key":"577_CR2","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"},{"key":"577_CR3","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7 A, Meyerhenke H, Safro I, Sanders P, Schulz C. Recent advances in graph partitioning. In: Algorithm engineering. Cham: Springer; 2016, p. 117\u201358.","DOI":"10.1007\/978-3-319-49487-6_4"},{"issue":"2","key":"577_CR4","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":"577_CR5","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":"577_CR6","doi-asserted-by":"crossref","unstructured":"McSherry F. Spectral partitioning of random graphs. In: Proceedings 42nd IEEE symposium on foundations of computer science. IEEE; 2001, p. 529\u201337.","DOI":"10.1109\/SFCS.2001.959929"},{"issue":"1","key":"577_CR7","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":"577_CR8","doi-asserted-by":"crossref","unstructured":"Sanders P, Schulz C. Engineering multilevel graph partitioning algorithms. In European symposium on algorithms. Berlin, Heidelberg: Springer; 2011, p. 469\u201380.","DOI":"10.1007\/978-3-642-23719-5_40"},{"key":"577_CR9","unstructured":"Walshal C. The graph partitioning archive; 2020. https:\/\/chriswalshaw.co.uk\/partition\/."},{"key":"577_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.procs.2015.03.177","volume":"47","author":"S Alagukumar","year":"2015","unstructured":"Alagukumar S, Lawrance R. A selective analysis of microarray data using association rule mining. Procedia Comput Sci. 2015;47:3\u201312.","journal-title":"Procedia Comput Sci"},{"key":"577_CR11","doi-asserted-by":"crossref","unstructured":"Cong, G., Tung, A. K., Xu, X., Pan, F., & Yang, J. (2004, June). Farmer: Finding interesting rule groups in microarray datasets. In\u00a0Proceedings of the 2004 ACM SIGMOD international conference on Management of data\u00a0(pp. 143\u2013154).","DOI":"10.1145\/1007568.1007587"},{"issue":"4","key":"577_CR12","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1016\/j.dss.2006.02.002","volume":"43","author":"Z Huang","year":"2007","unstructured":"Huang Z, Li J, Su H, Watts GS, Chen H. Large-scale regulatory network analysis from microarray data: modified Bayesian network learning and association rule mining. Decis Support Syst. 2007;43(4):1207\u201325.","journal-title":"Decis Support Syst"},{"key":"577_CR13","doi-asserted-by":"crossref","unstructured":"Dudoit S, Fridly J. Introduction to classification in microarray experiments. In: A practical approach to microarray data analysis. Boston: Springer; 2003, p. 132\u201349.","DOI":"10.1007\/0-306-47815-3_7"},{"key":"577_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, B. T., & Hwang, K. B. (2003). Bayesian network classifiers for gene expression analysis. In A practical approach to microarray data analysis (pp. 150\u2013165). Springer, Boston, MA.","DOI":"10.1007\/0-306-47815-3_8"},{"key":"577_CR15","doi-asserted-by":"crossref","unstructured":"Mukherjee S. Classifying microarray data using support vector machines. In: A practical approach to microarray data analysis. Boston: Springer; 2003, p. 166\u201385.","DOI":"10.1007\/0-306-47815-3_9"},{"key":"577_CR16","doi-asserted-by":"crossref","unstructured":"Li L, Weinberg CR. Gene selection and sample classification using a genetic algorithm and k-nearest neighbor method. In: A practical approach to microarray data analysis. Boston: Springer; 2003, p. 216\u201329.","DOI":"10.1007\/0-306-47815-3_12"},{"issue":"4","key":"577_CR17","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1038\/ng1032","volume":"32","author":"J Quackenbush","year":"2002","unstructured":"Quackenbush J. Microarray data normalization and transformation. Nat Genet. 2002;32(4):496\u2013501.","journal-title":"Nat Genet"},{"issue":"1","key":"577_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-020-00387-6","volume":"8","author":"H Li","year":"2021","unstructured":"Li H, Sheu PCY. A scalable association rule learning heuristic for large datasets. J Big Data. 2021;8(1):1\u201332.","journal-title":"J Big Data"},{"issue":"10","key":"577_CR19","doi-asserted-by":"publisher","first-page":"4712","DOI":"10.1016\/j.csda.2008.03.013","volume":"52","author":"PD McNicholas","year":"2008","unstructured":"McNicholas PD, Murphy TB, O\u2019Regan M. Standardising the lift of an association rule. Comput Stat Data Anal. 2008;52(10):4712\u201321.","journal-title":"Comput Stat Data Anal"},{"key":"577_CR20","doi-asserted-by":"publisher","unstructured":"Athar A, et al. ArrayExpress update\u2014from bulk to single-cell expression data. 2019. Nucleic Acids Res. https:\/\/doi.org\/10.1093\/nar\/gky964.PubmedID30357387.","DOI":"10.1093\/nar\/gky964.PubmedID30357387"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-022-00577-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-022-00577-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-022-00577-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:12:55Z","timestamp":1648509175000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-022-00577-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["577"],"URL":"https:\/\/doi.org\/10.1186\/s40537-022-00577-4","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"31 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","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":"35"}}