{"title":"A constrained multi-objective evolutionary algorithm for multi-class instance selection","authors":"Qijun Wang, Yujie Ge, Lei Zhang, Fan Cheng","doi":"10.1016/j.swevo.2025.102120","DOIUrl":null,"url":null,"abstract":"<div><div>As a data processing technology, instance selection (IS) aims to select a small number of instances with the same (or even higher) classification capability. Due to its widely applications, many IS algorithms with promising performance have been suggested. Despite that, most of existing algorithms focus on designing new IS algorithms by using different optimizing techniques, and few of them consider the imbalance among different classes in multi-class IS. To address the problem, in this paper, a constrained optimization problem is firstly formulated for multi-class IS, where the “hard constraint” and the “soft constraint” are defined to model the multi-class IS problem more accurately. Then, to solve the constrained optimization problem, a multi-objective evolutionary algorithm termed as CMOEA-MIS is proposed, by which the instance subsets with high quality could be achieved. Specifically, in CMOEA-MIS, a constraint-based solution selection strategy is developed based on the dominance relationship that considers both constraint violation and the quality of solution, and is introduced to choose the individuals in the mating pool. In addition, a two-stage based mutation strategy is also suggested in CMOEA-MIS, by which the quality of the final obtained instance subsets is further improved. Experimental results on the multi-class datasets with different characteristics have demonstrated that CMOEA-MIS can obtain multi-class instance subsets with more than 50% reduction rate, and can ensure the accuracy of each class, and can be used to train the classifiers with comparable or better performance than the state-of-the-art IS algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102120"},"PeriodicalIF":8.5000,"publicationDate":"2025-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225002780","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
As a data processing technology, instance selection (IS) aims to select a small number of instances with the same (or even higher) classification capability. Due to its widely applications, many IS algorithms with promising performance have been suggested. Despite that, most of existing algorithms focus on designing new IS algorithms by using different optimizing techniques, and few of them consider the imbalance among different classes in multi-class IS. To address the problem, in this paper, a constrained optimization problem is firstly formulated for multi-class IS, where the “hard constraint” and the “soft constraint” are defined to model the multi-class IS problem more accurately. Then, to solve the constrained optimization problem, a multi-objective evolutionary algorithm termed as CMOEA-MIS is proposed, by which the instance subsets with high quality could be achieved. Specifically, in CMOEA-MIS, a constraint-based solution selection strategy is developed based on the dominance relationship that considers both constraint violation and the quality of solution, and is introduced to choose the individuals in the mating pool. In addition, a two-stage based mutation strategy is also suggested in CMOEA-MIS, by which the quality of the final obtained instance subsets is further improved. Experimental results on the multi-class datasets with different characteristics have demonstrated that CMOEA-MIS can obtain multi-class instance subsets with more than 50% reduction rate, and can ensure the accuracy of each class, and can be used to train the classifiers with comparable or better performance than the state-of-the-art IS algorithms.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.