A constrained multi-objective evolutionary algorithm for multi-class instance selection

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Qijun Wang, Yujie Ge, Lei Zhang, Fan Cheng
{"title":"A constrained multi-objective evolutionary algorithm for multi-class instance selection","authors":"Qijun Wang,&nbsp;Yujie Ge,&nbsp;Lei Zhang,&nbsp;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.
多类实例选择的约束多目标进化算法
实例选择(instance selection, IS)是一种数据处理技术,其目的是选择少量具有相同(甚至更高)分类能力的实例。由于其广泛的应用,人们提出了许多性能良好的IS算法。尽管如此,现有的算法大多侧重于利用不同的优化技术设计新的IS算法,很少考虑多类IS中不同类之间的不平衡。针对这一问题,本文首先建立了多类is的约束优化问题,定义了“硬约束”和“软约束”,以便更准确地建模多类is问题。然后,针对约束优化问题,提出了一种多目标进化算法CMOEA-MIS,通过该算法可以获得高质量的实例子集。具体而言,在CMOEA-MIS中,基于优势关系,考虑约束违反和解决方案质量,提出了一种基于约束的解决方案选择策略,并引入该策略对交配池中的个体进行选择。此外,在CMOEA-MIS中提出了一种基于两阶段的突变策略,该策略进一步提高了最终获得的实例子集的质量。在具有不同特征的多类数据集上的实验结果表明,CMOEA-MIS能够以50%以上的约简率获得多类实例子集,并能保证每一类的准确率,可用于训练与最先进的IS算法性能相当或更好的分类器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信