Information gain-based multi-objective evolutionary algorithm for feature selection

信息增益 特征选择 计算机科学 进化算法 特征(语言学) 选择(遗传算法) 人工智能 算法 模式识别(心理学) 机器学习 数据挖掘 语言学 哲学
作者
Baohang Zhang,Ziqian Wang,Haotian Li,Zhenyu Lei,Jiujun Cheng,Shangce Gao
出处
期刊:Information Sciences [Elsevier BV]
卷期号:677: 120901-120901 被引量:1
标识
DOI:10.1016/j.ins.2024.120901
摘要

Feature selection (FS) has garnered significant attention because of its pivotal role in enhancing the efficiency and effectiveness of various machine learning and data mining algorithms. Concurrently, multiobjective feature selection (MOFS) algorithms strive to balance the complexity of multiple optimization objectives during the FS process. These include minimizing the number of selected features while maximizing classification performance. Nonetheless, managing the complexity of feature combinations presents a formidable challenge, particularly in high-dimensional datasets. Evolutionary algorithms (EAs) are increasingly adopted in MOFS owing to their exceptional global search capabilities and robustness. Despite their strengths, EAs face difficulties in navigating expansive solution spaces and achieving a balance between exploration and exploitation. To address these challenges, this study introduces a novel information gain-based EA for MOFS, designated as IGEA. This approach utilizes a clustering method for selecting a diverse parent population, thereby enhancing individual variability and maintaining a high-quality population. Considerably, IGEA employs information gain as a metric to evaluate the contribution of features to classification tasks. This metric informs crucial operations such as crossover and mutation. Moreover, the study extensively examines the actual solutions derived from IGEA, focusing on feature correlation and redundancy. This analysis illuminates IGEA's adept handling of these aspects to refine MOFS. Experimental results on 23 widely used classification datasets confirm IGEA's superiority over five other state-of-the-art algorithms, demonstrating its enhanced effectiveness and efficiency in complex MOFS scenarios.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
梓树完成签到,获得积分10
刚刚
123321发布了新的文献求助10
刚刚
1秒前
1秒前
沉沉叠叠发布了新的文献求助10
1秒前
Jasper应助感谢大哥的帮助采纳,获得10
2秒前
4秒前
ding应助苒苒采纳,获得10
4秒前
4秒前
Orange应助屈奕采纳,获得10
4秒前
5秒前
5秒前
ssu完成签到,获得积分10
6秒前
半山完成签到,获得积分10
6秒前
9tt完成签到,获得积分10
6秒前
风趣的欢发布了新的文献求助10
7秒前
7秒前
7秒前
活力的红牛完成签到 ,获得积分10
9秒前
打打应助幻闫昼采纳,获得10
9秒前
10秒前
小菜鸟发布了新的文献求助10
10秒前
11秒前
14秒前
2024完成签到,获得积分10
15秒前
Ssshumiao发布了新的文献求助10
16秒前
George完成签到,获得积分10
17秒前
科研通AI6.4应助My_magnum_opus采纳,获得10
18秒前
Owen应助晓飞采纳,获得10
18秒前
18秒前
11完成签到 ,获得积分10
21秒前
polofly完成签到,获得积分10
21秒前
佘颜均完成签到,获得积分10
22秒前
23秒前
彦嘉完成签到,获得积分20
23秒前
23秒前
23秒前
xx完成签到,获得积分10
26秒前
小伙子发布了新的文献求助10
27秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Pediatric Dermoscopy Trichoscopy & Onychoscopy 2030
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
Handbuch Trainingswissenschaft – Trainingslehre 500
Additive Manufacturing Design and Applications (ASM Handbook, Volume 24A) 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7577314
求助须知:如何正确求助?哪些是违规求助? 9156853
关于积分的说明 19589716
捐赠科研通 7160980
什么是DOI,文献DOI怎么找? 3265300
关于科研通互助平台的介绍 2430249
邀请新用户注册赠送积分活动 2255928