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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
哈哈哈完成签到,获得积分10
1秒前
充电宝应助常乐采纳,获得10
1秒前
达拉崩吧发布了新的文献求助10
1秒前
平p应助舒心的墨镜采纳,获得10
2秒前
stargazor发布了新的文献求助10
2秒前
乎乎完成签到,获得积分10
3秒前
领导范儿应助vllvkk采纳,获得10
3秒前
Breeze完成签到,获得积分10
4秒前
逻辑猫应助Ace采纳,获得10
4秒前
renkemaomao完成签到,获得积分10
4秒前
初景发布了新的文献求助10
5秒前
饱满一刀完成签到,获得积分10
5秒前
科研小白发布了新的文献求助10
6秒前
无限亦寒完成签到 ,获得积分10
6秒前
传统的刺猬完成签到,获得积分10
6秒前
银色星辰完成签到,获得积分10
7秒前
阮大帅气发布了新的文献求助10
7秒前
7秒前
7秒前
1113完成签到,获得积分10
7秒前
明亮板栗完成签到,获得积分10
8秒前
8秒前
ff完成签到,获得积分10
8秒前
wjwless发布了新的文献求助10
9秒前
潇湘发布了新的文献求助10
9秒前
裤裤子完成签到 ,获得积分10
10秒前
10秒前
10秒前
栗子应助沉默小玉采纳,获得10
10秒前
Zoro发布了新的文献求助10
10秒前
11秒前
顽主发布了新的文献求助10
11秒前
常乐完成签到,获得积分10
12秒前
lcl完成签到,获得积分10
12秒前
胡师兄发布了新的文献求助10
13秒前
13秒前
充电宝应助direstyles采纳,获得10
13秒前
14秒前
14秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Rosenblum, Global Change Biology 800
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
CLSI VET01S-2024 Performance Standards for Antimicrobial Disk and Dilution Susceptibility Tests for Bacteria Isolated From Animals (7th Ed) 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7774344
求助须知:如何正确求助?哪些是违规求助? 9316423
关于积分的说明 20350619
捐赠科研通 7360347
什么是DOI,文献DOI怎么找? 3317523
关于科研通互助平台的介绍 2465912
邀请新用户注册赠送积分活动 2332734