{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T01:57:01Z","timestamp":1769997421299,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"vor","delay-in-days":12,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"National Student Training Program for Innovation and Entrepreneurship of China","award":["202410069094"],"award-info":[{"award-number":["202410069094"]}]},{"name":"National Student Training Program for Innovation and Entrepreneurship of China","award":["202410069188"],"award-info":[{"award-number":["202410069188"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s44443-025-00257-2","type":"journal-article","created":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:33:27Z","timestamp":1760366007000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A variable-length multi-objective harmony search algorithm for numerical association rule mining"],"prefix":"10.1007","volume":"37","author":[{"given":"Zhixia","family":"Gu","sequence":"first","affiliation":[]},{"given":"Wen","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Jingyu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Guoxia","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yueyue","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zihan","family":"Kou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,13]]},"reference":[{"key":"257_CR1","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ins.2020.12.055","volume":"554","author":"EV Altay","year":"2021","unstructured":"Altay EV, Alatas B (2021) Differential evolution and sine cosine algorithm based novel hybrid multi-objective approaches for numerical association rule mining. Inf Sci 554:198\u2013221","journal-title":"Inf Sci"},{"key":"257_CR2","doi-asserted-by":"crossref","unstructured":"AL-Gburi AFJ, Nazri MZA, Yaakub MRB, Alyasseri ZAA (2024) Multi-objective unsupervised feature selection and cluster based on symbiotic organism search. Algorithms 17(8):355","DOI":"10.3390\/a17080355"},{"key":"257_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"issue":"03","key":"257_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1142\/S0219649204000869","volume":"3","author":"K-I Ahn","year":"2004","unstructured":"Ahn K-I, Kim J-Y (2004) Efficient mining of frequent itemsets and a measure of interest for association rule mining. J Inf Knowl Manag 3(03):245\u2013257","journal-title":"J Inf Knowl Manag"},{"issue":"8","key":"257_CR5","first-page":"3983","volume":"15","author":"S Attuluri","year":"2023","unstructured":"Attuluri S, Ramesh M (2023) Multi-objective discrete harmony search algorithm for privacy preservation in cloud data centers. Int J Inf Technol 15(8):3983\u20133997","journal-title":"Int J Inf Technol"},{"key":"257_CR6","doi-asserted-by":"crossref","unstructured":"Berzal F, Blanco I, S\u00e1nchez D, Vila M-A (2001) A new framework to assess association rules. In: Advances in Intelligent Data Analysis: 4th International Conference, IDA 2001 Cascais, Portugal, September 13\u201315, 2001 Proceedings 4, pp 95\u2013104. Springer","DOI":"10.1007\/3-540-44816-0_10"},{"issue":"03","key":"257_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S0218194017500127","volume":"27","author":"U Can","year":"2017","unstructured":"Can U, Alatas B (2017) Automatic mining of quantitative association rules with gravitational search algorithm. Int J Software Eng Knowl Eng 27(03):343\u2013372","journal-title":"Int J Software Eng Knowl Eng"},{"key":"257_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s11047-019-09735-9","volume":"20","author":"J Cheng","year":"2021","unstructured":"Cheng J, Chen J, Guo Y-N, Cheng S, Yang L, Zhang P (2021) Adaptive ccr-elm with variable-length brain storm optimization algorithm for class-imbalance learning. Nat Comput 20:11\u201322","journal-title":"Nat Comput"},{"issue":"8","key":"257_CR9","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.3390\/electronics11081171","volume":"11","author":"Y Cui","year":"2022","unstructured":"Cui Y, Dong W, Hu D, Liu H (2022) The application of improved harmony search algorithm to multi-uav task assignment. Electronics 11(8):1171","journal-title":"Electronics"},{"key":"257_CR10","first-page":"255","volume":"17","author":"J Derrac","year":"2015","unstructured":"Derrac J, Garcia S, Sanchez L, Herrera F (2015) Keel data-mining software tool: Data set repository, integration of algorithms and experimental analysis framework. J Mult Valued Logic Soft Comput 17:255\u2013287","journal-title":"J Mult Valued Logic Soft Comput"},{"issue":"2","key":"257_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"257_CR12","doi-asserted-by":"publisher","first-page":"2722","DOI":"10.7717\/peerj-cs.2722","volume":"11","author":"MA El-Shorbagy","year":"2025","unstructured":"El-Shorbagy MA, Bouaouda A, Abualigah L, Hashim FA (2025) Atom search optimization: a comprehensive review of its variants, applications, and future directions. PeerJ Comput Sci 11:2722","journal-title":"PeerJ Comput Sci"},{"key":"257_CR13","doi-asserted-by":"crossref","unstructured":"Fister I, Iglesias A, Galvez A, Del\u00a0Ser J, Osaba E, Fister I (2018) Differential evolution for association rule mining using categorical and numerical attributes. In: Intelligent Data Engineering and Automated Learning\u2013IDEAL 2018: 19th International Conference, Madrid, Spain, November 21\u201323, 2018, Proceedings, Part I 19, pp 79\u201388. Springer","DOI":"10.1007\/978-3-030-03493-1_9"},{"issue":"3","key":"257_CR14","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1132960.1132963","volume":"38","author":"L Geng","year":"2006","unstructured":"Geng L, Hamilton HJ (2006) Interestingness measures for data mining: A survey. ACM Comput Surv (CSUR) 38(3):9","journal-title":"ACM Comput Surv (CSUR)"},{"key":"257_CR15","doi-asserted-by":"crossref","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. simulation 76(2):60\u201368","DOI":"10.1177\/003754970107600201"},{"issue":"6","key":"257_CR16","doi-asserted-by":"publisher","first-page":"4081","DOI":"10.1007\/s00500-019-04175-0","volume":"24","author":"Y-F Huang","year":"2020","unstructured":"Huang Y-F, Chen S-H (2020) Solving multi-objective optimization problems using self-adaptive harmony search algorithms. Soft Comput 24(6):4081\u20134107","journal-title":"Soft Comput"},{"key":"257_CR17","doi-asserted-by":"crossref","unstructured":"Hu Q, Hu S, Liu M (2025) A multi-objective nutcracker optimization algorithm based on cubic chaotic map for numerical association rule mining. Appl Sci (2076-3417) 15(3)","DOI":"10.3390\/app15031611"},{"issue":"4","key":"257_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1504\/IJBIC.2018.092797","volume":"11","author":"KE Heraguemi","year":"2018","unstructured":"Heraguemi KE, Kamel N, Drias H (2018) Multi-objective bat algorithm for mining numerical association rules. Intern J Bio-Insp Comput 11(4):239\u2013248","journal-title":"Intern J Bio-Insp Comput"},{"issue":"2","key":"257_CR19","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 Rec 29(2):1\u201312","journal-title":"ACM SIGMOD Rec"},{"key":"257_CR20","doi-asserted-by":"publisher","first-page":"3559","DOI":"10.1007\/s00521-017-3278-z","volume":"31","author":"R-J Kuo","year":"2019","unstructured":"Kuo R-J, Gosumolo M, Zulvia FE (2019) Multi-objective particle swarm optimization algorithm using adaptive archive grid for numerical association rule mining. Neural Comput Appl 31:3559\u20133572","journal-title":"Neural Comput Appl"},{"issue":"1","key":"257_CR21","first-page":"20240373","volume":"34","author":"TJ Khraibet","year":"2025","unstructured":"Khraibet TJ, Kalaf BA, Mansoor W (2025) A new metaheuristic algorithm for solving multi-objective single-machine scheduling problems. J Intell Syst 34(1):20240373","journal-title":"J Intell Syst"},{"key":"257_CR22","doi-asserted-by":"publisher","first-page":"112306","DOI":"10.1016\/j.engstruct.2021.112306","volume":"240","author":"M Khodzhaiev","year":"2021","unstructured":"Khodzhaiev M, Reuter U (2021) Structural optimization of transmission towers using a novel genetic algorithm approach with a variable length genome. Eng Struct 240:112306","journal-title":"Eng Struct"},{"key":"257_CR23","doi-asserted-by":"publisher","first-page":"4239","DOI":"10.1109\/ACCESS.2023.3348408","volume":"12","author":"U Mlakar","year":"2023","unstructured":"Mlakar U, Fister I (2023) Variable-length differential evolution for numerical and discrete association rule mining. IEEE access 12:4239\u20134254","journal-title":"IEEE access"},{"key":"257_CR24","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen K (1999) Nonlinear Multiobjective Optimization, vol 12. Springer, Boston"},{"issue":"1","key":"257_CR25","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TEVC.2013.2285016","volume":"18","author":"D Martin","year":"2013","unstructured":"Martin D, Rosete A, Alcal\u00e1-Fdez J, Herrera F (2013) A new multiobjective evolutionary algorithm for mining a reduced set of interesting positive and negative quantitative association rules. IEEE Trans Evol Comput 18(1):54\u201369","journal-title":"IEEE Trans Evol Comput"},{"key":"257_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2013.09.009","volume":"258","author":"D Mart\u00edn","year":"2014","unstructured":"Mart\u00edn D, Rosete A, Alcal\u00e1-Fdez J, Herrera F (2014) Qar-cip-nsga-ii: A new multi-objective evolutionary algorithm to mine quantitative association rules. Inf Sci 258:1\u201328","journal-title":"Inf Sci"},{"issue":"6","key":"257_CR27","first-page":"4319","volume":"32","author":"U Mlakar","year":"2017","unstructured":"Mlakar U, Zorman M, Fister I Jr, Fister I (2017) Modified binary cuckoo search for association rule mining. J Intell Fuzzy Syst 32(6):4319\u20134330","journal-title":"J Intell Fuzzy Syst"},{"key":"257_CR28","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1109\/ACCESS.2020.3047936","volume":"9","author":"M Premkumar","year":"2020","unstructured":"Premkumar M, Jangir P, Sowmya R, Alhelou HH, Heidari AA, Chen H (2020) Mosma: Multi-objective slime mould algorithm based on elitist non-dominated sorting. IEEE Access 9:3229\u20133248","journal-title":"IEEE Access"},{"issue":"1","key":"257_CR29","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.eswa.2010.06.060","volume":"38","author":"HR Qodmanan","year":"2011","unstructured":"Qodmanan HR, Nasiri M, Minaei-Bidgoli B (2011) Multi objective association rule mining with genetic algorithm without specifying minimum support and minimum confidence. Expert Syst Appl 38(1):288\u2013298","journal-title":"Expert Syst Appl"},{"issue":"9","key":"257_CR30","doi-asserted-by":"publisher","first-page":"6879","DOI":"10.1007\/s00500-023-09558-y","volume":"28","author":"B Rokh","year":"2024","unstructured":"Rokh B, Mirvaziri H, Olyaee M (2024) A new evolutionary optimization based on multi-objective firefly algorithm for mining numerical association rules. Soft Comput 28(9):6879\u20136892","journal-title":"Soft Comput"},{"issue":"14","key":"257_CR31","doi-asserted-by":"publisher","first-page":"9427","DOI":"10.1007\/s00500-021-05799-x","volume":"25","author":"A Sadeghi Hesar","year":"2021","unstructured":"Sadeghi Hesar A, Kamel SR, Houshmand M (2021) A quantum multi-objective optimization algorithm based on harmony search method. Soft Comput 25(14):9427\u20139439","journal-title":"Soft Comput"},{"key":"257_CR32","doi-asserted-by":"crossref","unstructured":"Segarra-Mart\u00edn C, Mart\u00ednez-Ballesteros M, Troncoso A, Mart\u00ednez-\u00c1lvarez F (2022) A novel approach to discover numerical association based on the coronavirus optimization algorithm. In: Proceedings of the 37th ACM\/SIGAPP Symposium on Applied Computing, pp 1148\u20131151","DOI":"10.1145\/3477314.3507343"},{"issue":"8","key":"257_CR33","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1016\/j.engappai.2013.06.003","volume":"26","author":"K Sarath","year":"2013","unstructured":"Sarath K, Ravi V (2013) Association rule mining using binary particle swarm optimization. Eng Appl Artif Intell 26(8):1832\u20131840","journal-title":"Eng Appl Artif Intell"},{"key":"257_CR34","doi-asserted-by":"crossref","unstructured":"Tan P-N, Kumar V, Srivastava J (2002) Selecting the right interestingness measure for association patterns. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 32\u201341","DOI":"10.1145\/775047.775053"},{"issue":"3","key":"257_CR35","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/TEVC.2018.2869405","volume":"23","author":"B Tran","year":"2018","unstructured":"Tran B, Xue B, Zhang M (2018) Variable-length particle swarm optimization for feature selection on high-dimensional classification. IEEE Trans Evol Comput 23(3):473\u2013487","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"257_CR36","doi-asserted-by":"publisher","first-page":"3449","DOI":"10.1007\/s12652-019-01540-7","volume":"11","author":"E Varol Altay","year":"2020","unstructured":"Varol Altay E, Alatas B (2020) Performance analysis of multi-objective artificial intelligence optimization algorithms in numerical association rule mining. J Ambient Intell Humaniz Comput 11(8):3449\u20133469","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"257_CR37","doi-asserted-by":"crossref","unstructured":"Wilcoxon F (1992) Individual comparisons by ranking methods. In: Breakthroughs in Statistics: Methodology and Distribution, pp 196\u2013202. Springer, New York, NY","DOI":"10.1007\/978-1-4612-4380-9_16"},{"issue":"1","key":"257_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/IJDWM.308817","volume":"18","author":"Z Ye","year":"2022","unstructured":"Ye Z, Cai W, Wang M, Zhang A, Zhou W, Deng N, Wei Z, Zhu D (2022) Association rule mining based on hybrid whale optimization algorithm. Int J Data Warehous Min (IJDWM) 18(1):1\u201322","journal-title":"Int J Data Warehous Min (IJDWM)"},{"issue":"8","key":"257_CR39","doi-asserted-by":"publisher","first-page":"6125","DOI":"10.1007\/s00521-022-07985-w","volume":"35","author":"S Yacoubi","year":"2023","unstructured":"Yacoubi S, Manita G, Amdouni H, Mirjalili S, Korbaa O (2023) A modified multi-objective slime mould algorithm with orthogonal learning for numerical association rules mining. Neural Comput Appl 35(8):6125\u20136151","journal-title":"Neural Comput Appl"},{"key":"257_CR40","doi-asserted-by":"crossref","unstructured":"Yacoubi S, Manita G, Chhabra A, Korbaa O (2024) A metaheuristic perspective on extracting numeric association rules:\u00a0current works, applications, and recommendations. Arch Comput Methods Eng 31(7):4087\u20134128","DOI":"10.1007\/s11831-024-10109-3"},{"issue":"5","key":"257_CR41","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1007\/s12083-018-0698-1","volume":"12","author":"D Yan","year":"2019","unstructured":"Yan D, Zhao X, Lin R, Bai D (2019) Ppqar: parallel pso for quantitative association rule mining. Peer-to-Peer Network Appl 12(5):1433\u20131444","journal-title":"Peer-to-Peer Network Appl"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00257-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00257-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00257-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T15:40:37Z","timestamp":1761752437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00257-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":41,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["257"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00257-2","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10]]},"assertion":[{"value":"4 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"248"}}