Feature library-assisted surrogate model for evolutionary wrapper-based feature selection and classification

特征选择 计算机科学 特征(语言学) 水准点(测量) 人工智能 分类器(UML) 进化计算 模式识别(心理学) 灵活性(工程) 进化算法 人口 数据挖掘 机器学习 数学 统计 地理 社会学 大地测量学 人口学 语言学 哲学
作者
Hainan Guo,Junnan Ma,Ruiqi Wang,Yu Zhou
出处
期刊:Applied Soft Computing [Elsevier BV]
卷期号:139: 110241-110241 被引量:5
标识
DOI:10.1016/j.asoc.2023.110241
摘要

In recent years, wrapper-based feature selection (FS) using evolutionary algorithms has been widely studied due to its ability to search for and evaluate subsets of features based on populations. However, these methods often suffer from a high computational cost and a long computation time, mainly due to the process of evaluating the feature subsets according to the classification performance. In order to tackle this problem, this paper presents a feature library-assisted surrogate model (FL-SM), which aims to reduce the computational cost but maintain a good prediction accuracy. Unlike the existing surrogate models used in FS, the proposed method focuses on the feature level instead of the sample level: an FL is built by collecting the scores of all the features during the evolutionary search. Specifically, each solution (subset candidate) is pre-evaluated based on the FL using only simple operations to decide whether or not it deserves to be evaluated by the classifier, improving the efficiency of the FS algorithm. Meanwhile, because not evaluating a certain number of solutions may lead to inaccurate solution selection during the evolutionary search, dynamic individual selection criteria are proposed. In addition, an adaptive FL update operator is proposed to handle the dynamics of the evolved population; it ensures the real-time validity of the FL. Furthermore, we incorporate the proposed FL-SM into some state-of-the-art single- and multi-objective evolutionary FS methods. The experimental results on benchmark datasets show that with good flexibility and extendibility, FL-SM can effectively reduce the computational cost of wrapper-based FS and still obtain high-quality feature subsets. Among the five algorithms tested, the average computation time reduction was 34.87%; at the same time, there was no significant difference in the classification accuracy for 80% of the tests, and our method even improved the classification accuracy for 6% of the tests.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
文静一手发布了新的文献求助10
1秒前
2秒前
2秒前
能干千凡发布了新的文献求助10
3秒前
江子川发布了新的文献求助20
3秒前
doudou发布了新的文献求助10
3秒前
conwells完成签到,获得积分10
4秒前
Owen应助南天煌采纳,获得10
4秒前
Vivian完成签到,获得积分20
6秒前
东方元语应助研友_RLN4OZ采纳,获得20
6秒前
不才完成签到,获得积分10
7秒前
10秒前
12秒前
14秒前
韩小青完成签到 ,获得积分10
14秒前
15秒前
15秒前
15秒前
Dean应助霍夫斯泰德采纳,获得50
15秒前
浮沉发布了新的文献求助10
16秒前
十一完成签到 ,获得积分10
17秒前
Ayuan完成签到,获得积分10
17秒前
ailemonmint完成签到 ,获得积分10
17秒前
17秒前
SciGPT应助甜甜圈采纳,获得10
18秒前
18秒前
星辰大海应助落花生采纳,获得10
18秒前
Orange应助文静一手采纳,获得10
19秒前
19秒前
20秒前
能干千凡完成签到,获得积分20
21秒前
22秒前
ddd应助美丽大板砖采纳,获得10
22秒前
zhao发布了新的文献求助10
22秒前
Ayuan发布了新的文献求助10
23秒前
23秒前
星辰大海应助舒适的如萱采纳,获得10
24秒前
江子川发布了新的文献求助20
24秒前
一路硕博发布了新的文献求助10
24秒前
24秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Römisch-Germanische Forschungen 1000
APA handbook of comparative psychology: Basic concepts, methods, neural substrate, and behavior 1000
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The fast track to determining transfer functions of linear circuits: The student guide 500
Electric machines: theory, operating applications, and controls 500
The Analytical and Numerical Solution of Electric and Magnetic Fields 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7604214
求助须知:如何正确求助?哪些是违规求助? 9180166
关于积分的说明 19660934
捐赠科研通 7179349
什么是DOI,文献DOI怎么找? 3269347
关于科研通互助平台的介绍 2433362
邀请新用户注册赠送积分活动 2263423