A Joint-Encoding Evolutionary Algorithm for Multimodal Multiobjective Feature Selection in Classification

进化算法 特征选择 编码(内存) 进化计算 接头(建筑物) 计算机科学 人工智能 选择(遗传算法) 多目标优化 算法 模式识别(心理学) 特征(语言学) 遗传算法 统计分类 机器学习 工程类 哲学 语言学 建筑工程
作者
Jing Liang,Junting Yang,Caitong Yue,Ying Bi,Kunjie Yu,Boyang Qu,Yuyang Zhang,Mengmeng Li
出处
期刊:IEEE Transactions on Evolutionary Computation [Institute of Electrical and Electronics Engineers]
卷期号:29 (6): 2834-2848 被引量:5
标识
DOI:10.1109/tevc.2025.3529977
摘要

In multiobjective feature selection, different feature subsets with the same number of selected features can achieve identical classification accuracy, meaning that it is a multimodal optimization problem. To effectively search for multimodal feature subsets within the vast search spaces of high-dimensional datasets, it is crucial to adopt reasonable encoding and search methods. Generally, applying a uniform evolutionary operator based on a single encoding method across the entire feature space is inefficient and prone to falling into local optima. To address the above issues, this article proposes a multimodal multiobjective feature selection method based on a joint encoding mechanism that combines discrete encoding and continuous encoding. It provides new perspectives to solve the high-dimensional feature selection problem from encoding methods to search operators. First, the search space is divided into a discrete encoding region and a continuous encoding region based on the knee points of feature importance ranking curve. A tailored initialization strategy is used to obtain the initial population for joint encoding. Second, an adaptive niche strategy based on three priorities is proposed, which ensures the similarity of individuals within a niche and the difference between niches. In addition, different search operators are cooperated with the two encoding strategies, respectively, to achieve effective and efficient search. The experimental results on 24 datasets show that the proposed algorithm achieves a better-classification performance than the state-of-the-art feature selection methods.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
852完成签到,获得积分20
1秒前
瞌睡虫完成签到,获得积分10
1秒前
1秒前
SmileLin完成签到,获得积分10
2秒前
传奇3应助Hou采纳,获得10
2秒前
lanming发布了新的文献求助10
2秒前
iMi完成签到,获得积分10
3秒前
3秒前
傻傻的哈密瓜完成签到,获得积分0
3秒前
3秒前
清秀烤鸡完成签到,获得积分10
4秒前
maguodrgon发布了新的文献求助30
4秒前
2736242930发布了新的文献求助10
4秒前
4秒前
5秒前
6秒前
李依伊完成签到 ,获得积分10
6秒前
抱抱龙发布了新的文献求助10
6秒前
挤爆沙丁鱼完成签到,获得积分10
7秒前
缥缈冥发布了新的文献求助10
7秒前
猜猜发布了新的文献求助10
7秒前
高泽乐完成签到,获得积分10
7秒前
7秒前
fanlin完成签到,获得积分10
7秒前
8秒前
科目三应助忧伤的外绣采纳,获得30
8秒前
傻傻的板栗完成签到,获得积分10
8秒前
8秒前
SmileLin完成签到,获得积分10
9秒前
Akim应助拾三采纳,获得10
9秒前
hym完成签到,获得积分10
10秒前
10秒前
颖宝老公完成签到,获得积分0
10秒前
耍酷的梦桃完成签到,获得积分10
10秒前
lpp发布了新的文献求助10
11秒前
123发布了新的文献求助10
11秒前
svv完成签到,获得积分10
12秒前
DRM发布了新的文献求助10
13秒前
一一完成签到,获得积分10
13秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
政治传播过程中的外交与说服——以中苏友好协会为例的历史考察 566
Discerning Saints: Moralization of Intrinsic Motivation and Selective Prosociality at Work 500
Handbuch Trainingswissenschaft – Trainingslehre 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7580336
求助须知:如何正确求助?哪些是违规求助? 9159941
关于积分的说明 19596779
捐赠科研通 7163036
什么是DOI,文献DOI怎么找? 3265875
关于科研通互助平台的介绍 2430782
邀请新用户注册赠送积分活动 2256777