{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:34:36Z","timestamp":1772120076790,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T00:00:00Z","timestamp":1738886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T00:00:00Z","timestamp":1738886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s12293-025-00437-7","type":"journal-article","created":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T04:55:02Z","timestamp":1738904102000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A novel efficient bi-objective evolutionary algorithm for frequent and high utility itemsets mining"],"prefix":"10.1007","volume":"17","author":[{"given":"Li","family":"Ma","sequence":"first","affiliation":[]},{"given":"Chongyang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Heng-yang","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"issue":"2","key":"437_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. SIGMOD Rec. 22(2):207\u2013216. https:\/\/doi.org\/10.1145\/170036.170072","journal-title":"SIGMOD Rec."},{"key":"437_CR2","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ ( 2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 482\u2013 486 . SIAM","DOI":"10.1137\/1.9781611972740.51"},{"key":"437_CR3","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1016\/j.asoc.2017.09.033","volume":"62","author":"L Zhang","year":"2018","unstructured":"Zhang L, Fu G, Cheng F, Qiu J, Su Y (2018) A multi-objective evolutionary approach for mining frequent and high utility itemsets. Appl Soft Comput 62:974\u2013986. https:\/\/doi.org\/10.1016\/j.asoc.2017.09.033","journal-title":"Appl Soft Comput"},{"key":"437_CR4","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.ins.2015.12.036","volume":"339","author":"L Zhang","year":"2016","unstructured":"Zhang L, Luo P, Chen E, Wang M (2016) Revisiting bound estimation of pattern measures: a generic framework. Inf Sci 339:254\u2013273. https:\/\/doi.org\/10.1016\/j.ins.2015.12.036","journal-title":"Inf Sci"},{"key":"437_CR5","doi-asserted-by":"publisher","first-page":"110233","DOI":"10.1016\/j.asoc.2023.110233","volume":"140","author":"W Fang","year":"2023","unstructured":"Fang W, Li C, Zhang Q, Zhang X, Lin JC-W (2023) An efficient biobjective evolutionary algorithm for mining frequent and high utility itemsets. Appl Soft Comput 140:110233. https:\/\/doi.org\/10.1016\/j.asoc.2023.110233","journal-title":"Appl Soft Comput"},{"key":"437_CR6","unstructured":"Agrawal R, Srikant R ( 1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Data Bases. VLDB, pp. 487\u2013 499. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA"},{"issue":"2","key":"437_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/568271.223813","volume":"24","author":"JS Park","year":"1995","unstructured":"Park JS, Chen M-S, Yu PS (1995) An effective hash-based algorithm for mining association rules. SIGMOD Rec. 24(2):175\u2013186. https:\/\/doi.org\/10.1145\/568271.223813","journal-title":"SIGMOD Rec."},{"key":"437_CR8","unstructured":"Savasere A, Omiecinski ER, Navathe SB (1995) An efficient algorithm for mining association rules in large databases. Technical report, Georgia Institute of Technology"},{"key":"437_CR9","first-page":"134","volume":"96","author":"H Toivonen","year":"1996","unstructured":"Toivonen H et al (1996) Sampling large databases for association rules. VLDB 96:134\u2013145","journal-title":"VLDB"},{"issue":"2","key":"437_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/253262.253325","volume":"26","author":"S Brin","year":"1997","unstructured":"Brin S, Motwani R, Ullman JD, Tsur S (1997) Dynamic itemset counting and implication rules for market basket data. SIGMOD Rec. 26(2):255\u2013264. https:\/\/doi.org\/10.1145\/253262.253325","journal-title":"SIGMOD Rec."},{"issue":"2","key":"437_CR11","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. SIGMOD Rec. 29(2):1\u201312. https:\/\/doi.org\/10.1145\/335191.335372","journal-title":"SIGMOD Rec."},{"issue":"3","key":"437_CR12","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390. https:\/\/doi.org\/10.1109\/69.846291","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"437_CR13","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W-k, Choudhary A ( 2005) A fast high utility itemsets mining algorithm. In: Proceedings of the 1st International Workshop on Utility-based Data Mining, pp. 90\u2013 99","DOI":"10.1145\/1089827.1089839"},{"key":"437_CR14","unstructured":"Erwin A, Gopalan RP, Achuthan N ( 2007) A bottom-up projection based algorithm for mining high utility itemsets. In: Proceedings of the 2nd International Workshop on Integrating Artificial Intelligence and Data mining-Volume 84, pp. 3\u2013 11 . Citeseer"},{"key":"437_CR15","doi-asserted-by":"crossref","unstructured":"Vo B, Nguyen H, Le B ( 2009) Mining high utility itemsets from vertical distributed databases. In: 2009 IEEE-RIVF International Conference on Computing and Communication Technologies, pp. 1\u2013 4 . IEEE","DOI":"10.1109\/RIVF.2009.5174650"},{"issue":"1","key":"437_CR16","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"Y-C Li","year":"2008","unstructured":"Li Y-C, Yeh J-S, Chang C-C (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64(1):198\u2013217. https:\/\/doi.org\/10.1016\/j.datak.2007.06.009","journal-title":"Data Knowl Eng"},{"key":"437_CR17","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu C-W, Shie,B-E, Yu PS ( 2010) Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 253\u2013 262","DOI":"10.1145\/1835804.1835839"},{"key":"437_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","volume":"76","author":"H Ryang","year":"2015","unstructured":"Ryang H, Yun U (2015) Top-k high utility pattern mining with effective threshold raising strategies. Knowl-Based Syst 76:109\u2013126. https:\/\/doi.org\/10.1016\/j.knosys.2014.12.010","journal-title":"Knowl-Based Syst"},{"key":"437_CR19","doi-asserted-by":"publisher","unstructured":"Tseng VS, Wu C-W, Fournier-Viger P, Yu PS (2016) Efficient algorithms for mining top-k high utility itemsets. IEEE Trans Knowl Data Eng 28(1):54\u201367. https:\/\/doi.org\/10.1109\/tkde.2015.2458860","DOI":"10.1109\/tkde.2015.2458860"},{"issue":"4","key":"437_CR20","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1080\/08839514.2014.891839","volume":"28","author":"S Kannimuthu","year":"2014","unstructured":"Kannimuthu S, Premalatha K (2014) Discovery of high utility itemsets using genetic algorithm with ranked mutation. Appl Artif Intell 28(4):337\u2013359. https:\/\/doi.org\/10.1080\/08839514.2014.891839","journal-title":"Appl Artif Intell"},{"issue":"17","key":"437_CR21","doi-asserted-by":"publisher","first-page":"5103","DOI":"10.1007\/s00500-016-2106-1","volume":"21","author":"JC-W Lin","year":"2017","unstructured":"Lin JC-W, Yang L, Fournier-Viger P, Hong T-P, Voznak M (2017) A binary pso approach to mine high-utility itemsets. Soft Comput 21(17):5103\u20135121","journal-title":"Soft Comput"},{"key":"437_CR22","doi-asserted-by":"publisher","first-page":"176799","DOI":"10.1109\/ACCESS.2019.2958150","volume":"7","author":"Q Zhang","year":"2019","unstructured":"Zhang Q, Fang W, Sun J, Wang Q (2019) Improved genetic algorithm for high-utility itemset mining. IEEE Access 7:176799\u2013176813. https:\/\/doi.org\/10.1109\/ACCESS.2019.2958150","journal-title":"IEEE Access"},{"key":"437_CR23","doi-asserted-by":"publisher","unstructured":"Cao H, Yang S, Wang Q, Wang Q, Zhang L ( 2019) A closed itemset property based multi-objective evolutionary approach for mining frequent and high utility itemsets. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 3356\u2013 3363 . https:\/\/doi.org\/10.1109\/CEC.2019.8789985","DOI":"10.1109\/CEC.2019.8789985"},{"key":"437_CR24","unstructured":"Fang W, Zhang Q, Sun J, Wu X-J (2020) Mining high quality patterns using multi-objective evolutionary algorithm. IEEE Transactions on Knowledge and Data Engineering"},{"key":"437_CR25","unstructured":"Tian Y, Liu R, Zhang X, Ma H, Tan KC, Jin Y (2020) A multi-population evolutionary algorithm for solving large-scale multi-modal multi-objective optimization problems. IEEE Transactions on Evolutionary Computation, 10\u2013110920203044711"},{"issue":"2","key":"437_CR26","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":"437_CR27","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JC-W, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT ( 2016) The spmf open-source data mining library version 2. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 36\u2013 40 . Springer","DOI":"10.1007\/978-3-319-46131-1_8"},{"issue":"4","key":"437_CR28","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271. https:\/\/doi.org\/10.1109\/4235.797969","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"437_CR29","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"L While","year":"2006","unstructured":"While L, Hingston P, Barone L, Huband S (2006) A faster algorithm for calculating hypervolume. IEEE Trans Evol Comput 10(1):29\u201338. https:\/\/doi.org\/10.1109\/TEVC.2005.851275","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"437_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2021","unstructured":"Shang K, Ishibuchi H, He L, Pang LM (2021) A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans Evol Comput 25(1):1\u201320. https:\/\/doi.org\/10.1109\/TEVC.2020.3013290","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00437-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00437-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00437-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T01:29:45Z","timestamp":1742261385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00437-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,7]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["437"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00437-7","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4450561\/v1","asserted-by":"object"}]},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,7]]},"assertion":[{"value":"20 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This work does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in this work.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}],"article-number":"4"}}