{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:39:33Z","timestamp":1784738373292,"version":"3.55.0"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T00:00:00Z","timestamp":1662163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T00:00:00Z","timestamp":1662163200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62062004"],"award-info":[{"award-number":["62062004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004772","name":"Natural Science Foundation of Ningxia","doi-asserted-by":"crossref","award":["2020AAC03216"],"award-info":[{"award-number":["2020AAC03216"]}],"id":[{"id":"10.13039\/501100004772","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10115-022-01741-1","type":"journal-article","created":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T07:02:27Z","timestamp":1662188547000},"page":"2945-2984","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["An overview of high utility itemsets mining methods based on intelligent optimization algorithms"],"prefix":"10.1007","volume":"64","author":[{"given":"Meng","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhihui","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shujuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongliang","family":"Mu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,3]]},"reference":[{"issue":"10","key":"1741_CR1","doi-asserted-by":"publisher","first-page":"6785","DOI":"10.1007\/s10489-021-02204-w","volume":"51","author":"M Nouioua","year":"2021","unstructured":"Nouioua M, Fournier-Viger P, Wu CW (2021) FHUQI-miner: fast high utility quantitative itemset mining. Appl Intell 51(10):6785\u20136809","journal-title":"Appl Intell"},{"issue":"4","key":"1741_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10922-021-09609-5","volume":"29","author":"U Ahmed","year":"2021","unstructured":"Ahmed U, Srivastava G, Lin JCW (2021) A federated learning approach to frequent itemset mining in cyber-physical systems. J Netw Syst Manage 29(4):1\u201317","journal-title":"J Netw Syst Manage"},{"key":"1741_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2021.101927","volume":"136","author":"A Hidouri","year":"2021","unstructured":"Hidouri A, Jabbour S, Raddaoui B (2021) Mining closed high utility itemsets based on propositional satisfiability. Data Knowl Eng 136:101927","journal-title":"Data Knowl Eng"},{"key":"1741_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-030-95408-6_2","volume-title":"International conference on advanced data mining and applications","author":"M Nouioua","year":"2022","unstructured":"Nouioua M, Fournier-Viger P, Gan W (2022) TKQ: top-K quantitative high utility itemset mining[C]. International conference on advanced data mining and applications. Springer, Cham, pp 16\u201328"},{"issue":"11","key":"1741_CR5","doi-asserted-by":"publisher","first-page":"4141","DOI":"10.1007\/s10115-020-01485-w","volume":"62","author":"MK Sohrabi","year":"2020","unstructured":"Sohrabi MK (2020) An efficient projection-based method for high utility itemset mining using a novel pruning approach on the utility matrix. Knowl Inf Syst 62(11):4141\u20134167","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"1741_CR6","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2017","unstructured":"Zida S, Fournier-Viger P, Lin JCW (2017) EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625","journal-title":"Knowl Inf Syst"},{"key":"1741_CR7","first-page":"83","volume-title":"International symposium on methodologies for intelligent systems","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Wu CW, Zida S (2014) FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning[C]. International symposium on methodologies for intelligent systems. Springer, Cham, pp 83\u201392"},{"key":"1741_CR8","doi-asserted-by":"crossref","unstructured":"Liu M., and Qu J. (2012) Mining high utility itemsets without candidate generation[C]. In: Proceedings of the 21st ACM international conference on Information and knowledge management. pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"issue":"5","key":"1741_CR9","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Syst Appl 42(5):2371\u20132381","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1741_CR10","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10489-017-0932-1","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar S, Goyal V, Bera D (2017) A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl Intell 47(3):809\u2013827","journal-title":"Appl Intell"},{"key":"1741_CR11","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Pacific-Asia conference on knowledge discovery and data mining","author":"Y Liu","year":"2005","unstructured":"Liu Y, Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets[C]. Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, Heidelberg, pp 689\u2013695"},{"issue":"1","key":"1741_CR12","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"VS Tseng","year":"2015","unstructured":"Tseng VS, Wu CW, Fournier-Viger P (2015) Efficient algorithms for mining top-k high utility itemsets. IEEE Trans Knowl Data Eng 28(1):54\u201367","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1741_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3462636","volume":"13","author":"MS Nawaz","year":"2021","unstructured":"Nawaz MS, Fournier-Viger P, Yun U (2021) Mining high utility itemsets with hill climbing and simulated annealing[J]. ACM Trans Manag Inf Syst 13(1):1\u201322","journal-title":"ACM Trans Manag Inf Syst"},{"key":"1741_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33858-3","volume-title":"Pattern mining with evolutionary algorithms","author":"S Ventura","year":"2016","unstructured":"Ventura S, Luna JM (2016) Pattern mining with evolutionary algorithms. Springer, Berlin"},{"issue":"11","key":"1741_CR15","doi-asserted-by":"publisher","first-page":"3030","DOI":"10.1109\/TCYB.2017.2750919","volume":"48","author":"JM Luna","year":"2017","unstructured":"Luna JM, Pechenizkiy M, Del Jesus MJ (2017) Mining context-aware association rules using grammar-based genetic programming[J]. IEEE Trans Cybern 48(11):3030\u20133044","journal-title":"IEEE Trans Cybern"},{"key":"1741_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84996-129-5","volume-title":"Introduction to evolutionary algorithms","author":"X Yu","year":"2010","unstructured":"Yu X, Gen M (2010) Introduction to evolutionary algorithms. Springer Science & Business Media, London"},{"issue":"4","key":"1741_CR17","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","journal-title":"Appl Artif Intell"},{"issue":"17","key":"1741_CR18","doi-asserted-by":"publisher","first-page":"5103","DOI":"10.1007\/s00500-016-2106-1","volume":"21","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Yang L, Fournier-Viger P (2017) A binary PSO approach to mine high-utility itemsets. Soft Comput 21(17):5103\u20135121","journal-title":"Soft Comput"},{"key":"1741_CR19","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-662-48319-0_48","volume-title":"International conference on multidisciplinary social networks research","author":"JCW Lin","year":"2015","unstructured":"Lin JCW, Yang L, Fournier-Viger P (2015) A swarm-based approach to mine high-utility itemsets. International conference on multidisciplinary social networks research. Springer, Berlin, Heidelberg, pp 572\u2013581"},{"key":"1741_CR20","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.engappai.2016.07.006","volume":"55","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Yang L, Fournier-Viger P (2016) Mining high-utility itemsets based on particle swarm optimization. Eng Appl Artif Intell 55:320\u2013330","journal-title":"Eng Appl Artif Intell"},{"key":"1741_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-93040-4_1","volume-title":"Pacific-Asia conference on knowledge discovery and data mining","author":"W Song","year":"2018","unstructured":"Song W, Huang C (2018) Discovering high utility itemsets based on the artificial bee colony algorithm. Pacific-Asia conference on knowledge discovery and data mining. Springer, Cham, pp 3\u201314"},{"key":"1741_CR22","first-page":"407","volume-title":"International conference on swarm intelligence","author":"W Song","year":"2021","unstructured":"Song W, Li J, Huang C (2021) Artificial Fish Swarm Algorithm for Mining High Utility Itemsets. International conference on swarm intelligence. Springer, Cham, pp 407\u2013419"},{"issue":"2","key":"1741_CR23","first-page":"19","volume":"4","author":"W Song","year":"2020","unstructured":"Song W, Huang C (2020) Mining high average -utility itemsets based on particle swarm optimization. Data Sci Pattern Recogn 4(2):19\u201332","journal-title":"Data Sci Pattern Recogn"},{"key":"1741_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107422","volume":"108","author":"JCW Lin","year":"2021","unstructured":"Lin JCW, Djenouri Y, Srivastava G (2021) A predictive GA-based model for closed high-utility itemset mining. Appl Soft Comput 108:107422","journal-title":"Appl Soft Comput"},{"key":"1741_CR25","doi-asserted-by":"crossref","unstructured":"Song W, Zheng C, and Huang C (2021) Heuristically mining the top-k high-utility itemsets with cross-entropy optimization. Appl Intell 1\u201316","DOI":"10.1007\/s10489-021-02576-z"},{"key":"1741_CR26","doi-asserted-by":"crossref","unstructured":"Logeswaran K, Andal RKS, and Ezhilmathi ST. 2021 A Survey on metaheuristic nature inspired computations used for mining of association rule frequent itemset and high utility itemset. In: IOP Conference Series Materials Science and Engineering. IOP Publishing, UK 1055 1 012103","DOI":"10.1088\/1757-899X\/1055\/1\/012103"},{"key":"1741_CR27","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-030-04921-8_10","volume-title":"High-Utility Pattern Mining","author":"Y Djenouri","year":"2019","unstructured":"Djenouri Y, Fournier-Viger P, Belhadi A (2019) Metaheuristics for frequent and high-utility itemset mining[M]. High-Utility Pattern Mining. Springer, Cham, pp 261\u2013278"},{"issue":"02","key":"1741_CR28","first-page":"330","volume":"38","author":"Z Chun-Yan","year":"2021","unstructured":"Chun-Yan Z, Meng H, Rui S (2021) Survey of key technologies for high utility patterns mining. Appl Res Comput 38(02):330\u2013340","journal-title":"Appl Res Comput"},{"issue":"3","key":"1741_CR29","first-page":"1","volume":"40","author":"Li Mu-Hang","year":"2022","unstructured":"Mu-Hang Li, Meng H, Zhi-Qiang C (2022) Survey of algorithms oriented to complex high utility pattern mining[J]. J Guangxi Normal Univ 40(3):1\u201319","journal-title":"J Guangxi Normal Univ"},{"key":"1741_CR30","doi-asserted-by":"crossref","unstructured":"Kennedy J, and Eberhart R 1995 Particle swarm optimization[C]. In: Proceedings of ICNN'95-international conference on neural networks. (IEEE), 4: 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1741_CR31","unstructured":"Eberhart R, and Kennedy J. 1995 A new optimizer using particle swarm theory[C]. In: MHS'95. Proceedings of the sixth international symposium on micro machine and human science. (IEEE), pp 39\u201343"},{"key":"1741_CR32","first-page":"327","volume-title":"Pacific-Asia conference on knowledge discovery and data mining","author":"R Pears","year":"2011","unstructured":"Pears R, Koh YS (2011) Weighted association rule mining using particle swarm optimization[C]. Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, Heidelberg, pp 327\u2013338"},{"key":"1741_CR33","doi-asserted-by":"crossref","unstructured":"Sivamathi C, Vijayarani S. 2017 Mining high utility itemsets using shuffled complex evolution of particle swarm optimization (SCE-PSO) optimization algorithm[C]. In: 2017 International Conference on Inventive Computing and Informatics (ICICI). IEEE, pp 640\u2013644","DOI":"10.1109\/ICICI.2017.8365213"},{"key":"1741_CR34","doi-asserted-by":"crossref","unstructured":"Kennedy J, and Eberhart RA (1997) Discrete binary version of particle swarm algorithm. In: Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics, pp. 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"1741_CR35","doi-asserted-by":"publisher","first-page":"105164","DOI":"10.1016\/j.knosys.2019.105164","volume":"190","author":"R Gunawan","year":"2020","unstructured":"Gunawan R, Winarko E, Pulungan R (2020) A BPSO-based method for high-utility itemset mining without minimum utility threshold. Knowl-Based Syst 190:105164","journal-title":"Knowl-Based Syst"},{"issue":"12","key":"1741_CR36","first-page":"202","volume":"44","author":"J Xiao-Le","year":"2018","unstructured":"Xiao-Le J, Xia-Bi L, Xiao M (2018) High-utility itemsets mining algorithm based on double binary particle swarm optimization. Comput Eng 44(12):202\u2013207","journal-title":"Comput Eng"},{"key":"1741_CR37","doi-asserted-by":"publisher","first-page":"19568","DOI":"10.1109\/ACCESS.2018.2819162","volume":"6","author":"W Song","year":"2018","unstructured":"Song W, Huang C (2018) Mining high utility itemsets using bio-inspired algorithms: a diverse optimal value framework. IEEE Access 6:19568\u201319582","journal-title":"IEEE Access"},{"key":"1741_CR38","doi-asserted-by":"crossref","unstructured":"Tseng V. S., Wu. C. W., and Shie B. E 2010 UP-Growth: an efficient algorithm for high utility itemset mining[C]. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"issue":"05","key":"1741_CR39","first-page":"1084","volume":"41","author":"W ChangWu","year":"2020","unstructured":"ChangWu W, Song-lin Y, Wen-Yuan L (2020) High utility itemset mining algorithm based on improved particle swarm optimization. J Chin Comput Syst 41(05):1084\u20131090","journal-title":"J Chin Comput Syst"},{"issue":"2","key":"1741_CR40","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/TEVC.2009.2030331","volume":"14","author":"WN Chen","year":"2009","unstructured":"Chen WN, Zhang J, Chung HSH (2009) A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans Evol Comput 14(2):278\u2013300","journal-title":"IEEE Trans Evol Comput"},{"key":"1741_CR41","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-030-65390-3_4","volume-title":"International conference on advanced data mining and applications","author":"W Song","year":"2020","unstructured":"Song W, Li J (2020) Discovering high utility itemsets using set-based particle swarm optimization. International conference on advanced data mining and applications. Springer, Cham, pp 38\u201353"},{"issue":"4","key":"1741_CR42","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"1741_CR43","doi-asserted-by":"crossref","unstructured":"Wu JMT, Zhan J, and Lin JCW 2016 Mining of high-utility itemsets by ACO algorithm[C].In: Proceedings of the 3rd Multidisciplinary International Social Networks Conference on Social Informatics 2016, Data Science 2016: 1\u20137","DOI":"10.1145\/2955129.2955179"},{"key":"1741_CR44","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.knosys.2016.10.027","volume":"116","author":"JMT Wu","year":"2017","unstructured":"Wu JMT, Zhan J, Lin JCW (2017) An ACO-based approach to mine high-utility itemsets. Knowl-Based Syst 116:102\u2013113","journal-title":"Knowl-Based Syst"},{"issue":"5","key":"1741_CR45","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1080\/0965254X.2018.1430058","volume":"27","author":"R Seidlova","year":"2019","unstructured":"Seidlova R, Po\u017eivil J, Seidl J (2019) Marketing and business intelligence with help of ant colony algorithm. J Strateg Mark 27(5):451\u2013463","journal-title":"J Strateg Mark"},{"issue":"5","key":"1741_CR46","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s10766-018-0621-7","volume":"48","author":"MS Arunkumar","year":"2018","unstructured":"Arunkumar MS, Suresh P, Gunavathi C (2018) High utility infrequent itemset mining using a customized ant colony algorithm. Int J Parallel Program 48(5):833\u2013849","journal-title":"Int J Parallel Program"},{"issue":"8","key":"1741_CR47","doi-asserted-by":"publisher","first-page":"8839","DOI":"10.1007\/s10489-021-02922-1","volume":"52","author":"S Pramanik","year":"2021","unstructured":"Pramanik S, Goswami A (2021) Discovery of closed high utility itemsets using a fast nature-inspired ant colony algorithm. Appl Intell 52(8):8839\u20138855","journal-title":"Appl Intell"},{"issue":"3","key":"1741_CR48","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39(3):459\u2013471","journal-title":"J Global Optim"},{"key":"1741_CR49","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.neucom.2015.06.083","volume":"172","author":"E Emary","year":"2016","unstructured":"Emary E, Zawbaa HM, Hassanien AE (2016) Binary grey wolf optimization approaches for feature selection. Neurocomputing 172:371\u2013381","journal-title":"Neurocomputing"},{"issue":"21","key":"1741_CR50","doi-asserted-by":"publisher","first-page":"16691","DOI":"10.1007\/s00500-020-05123-z","volume":"24","author":"N Pazhaniraja","year":"2020","unstructured":"Pazhaniraja N, Sountharrajan S, Kumar BS (2020) High utility itemset mining: a Boolean operators-based modified grey wolf optimization algorithm. Soft Comput 24(21):16691\u201316704","journal-title":"Soft Comput"},{"key":"1741_CR51","doi-asserted-by":"crossref","unstructured":"Ghosh S, Biswas S, and Sarkar D 2010 Mining frequent itemsets using genetic algorithm. arXiv preprint arXiv:1011.0328, 2010.","DOI":"10.5121\/ijaia.2010.1411"},{"key":"1741_CR52","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.pisc.2015.11.013","volume":"7","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Gan W, Fournier-Viger P (2016) High utility-itemset mining and privacy-preserving utility mining. Perspect Sci 7:74\u201380","journal-title":"Perspect Sci"},{"key":"1741_CR53","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 (2019) Improved genetic algorithm for high-utility itemset mining. IEEE Access 7:176799\u2013176813","journal-title":"IEEE Access"},{"issue":"2","key":"1741_CR54","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/TCSS.2020.2964197","volume":"7","author":"M Seifikar","year":"2020","unstructured":"Seifikar M, Farzi S, Barati M (2020) C-blondel: an efficient louvain-based dynamic community detection algorithm. IEEE Trans Comput Social Syst 7(2):308\u2013313","journal-title":"IEEE Trans Comput Social Syst"},{"issue":"8","key":"1741_CR55","doi-asserted-by":"publisher","first-page":"8413","DOI":"10.1007\/s12652-020-02571-1","volume":"12","author":"N Pazhaniraja","year":"2021","unstructured":"Pazhaniraja N, Sountharrajan S (2021) High utility itemset mining using dolphin echolocation optimization. J Ambient Intell Humaniz Comput 12(8):8413\u20138426","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"1741_CR56","doi-asserted-by":"publisher","first-page":"103935","DOI":"10.1016\/j.engappai.2020.103935","volume":"96","author":"GJ Krishna","year":"2020","unstructured":"Krishna GJ, Ravi V (2020) Mining top high utility association rules using binary differential evolution. Eng Appl Artif Intell 96:103935","journal-title":"Eng Appl Artif Intell"},{"key":"1741_CR57","doi-asserted-by":"publisher","first-page":"115122","DOI":"10.1016\/j.eswa.2021.115122","volume":"181","author":"GJ Krishna","year":"2021","unstructured":"Krishna GJ, Ravi V (2021) High utility itemset mining using binary differential evolution: an application to customer segmentation. Expert Syst Appl 181:115122","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1741_CR58","first-page":"508","volume":"19","author":"X Cai","year":"2014","unstructured":"Cai X, Li Y, Fan Z (2014) An external archive guided multiobjective evolutionary algorithm based on decomposition for combinatorial optimization. IEEE Trans Evol Comput 19(4):508\u2013523","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"1741_CR59","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1741_CR60","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 (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":"1741_CR61","unstructured":"Zitzler E, Laumanns M, and Thiele L 2001 SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report, 103"},{"key":"1741_CR62","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 (2018) A multi-objective evolutionary approach for mining frequent and high utility itemsets. Appl Soft Comput 62:974\u2013986","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1741_CR63","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TETCI.2020.3000224","volume":"5","author":"U Ahmed","year":"2020","unstructured":"Ahmed U, Lin JCW, Srivastava G (2020) An evolutionary model to mine high expected utility patterns from uncertain databases[J]. IEEE Trans Emerg Topics Comput Intell 5(1):19\u201328","journal-title":"IEEE Trans Emerg Topics Comput Intell"},{"key":"1741_CR64","unstructured":"Fang W, Zhang Q, Sun J, et al. 2020 Mining high quality patterns using multi-objective evolutionary algorithm. IEEE Trans Knowl Data Eng"},{"key":"1741_CR65","doi-asserted-by":"crossref","unstructured":"Cao H, Yang S, and Wang Q 2019 A closed itemset property based multi-objective evolutionary approach for mining frequent and high utility itemsets[C]. In: 2019 IEEE congress on evolutionary computation (CEC). IEEE, pp 3356\u20133363","DOI":"10.1109\/CEC.2019.8789985"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01741-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01741-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01741-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T05:04:30Z","timestamp":1727931870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01741-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,3]]},"references-count":65,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1741"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01741-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,3]]},"assertion":[{"value":"18 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2022","order":4,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}