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秒前
1秒前
1秒前
年糕的应助被jizhengxiong采纳,获得10
1秒前
2秒前
2秒前
2秒前
guan完成签到,获得积分10
3秒前
3秒前
3秒前
小二郎的应助被sin采纳,获得10
5秒前
5秒前
科研通AI6.4的应助被AI采纳,获得10
5秒前
老实花生发布了新的文献求助10
5秒前
锦锦不吃菜关注了科研通微信公众号
5秒前
dracovu完成签到,获得积分10
6秒前
preference关注了科研通微信公众号
7秒前
FashionBoy的应助被hhan采纳,获得10
7秒前
英俊的铭的应助被微笑小伙采纳,获得10
7秒前
7秒前
7秒前
7秒前
7秒前
7秒前
7秒前
实验室的应助被少年采纳,获得30
10秒前
xixi完成签到,获得积分10
10秒前
10秒前
禅花游鱼完成签到,获得积分10
10秒前
11秒前
11秒前
小万完成签到 ,获得积分10
12秒前
无骨鸡爪不长胖完成签到,获得积分10
12秒前
aaa的应助被金牌小魚仔采纳,获得200
12秒前
渡人舟的应助被畅chang采纳,获得10
14秒前
15秒前
852的应助被111采纳,获得10
15秒前
15秒前
16秒前
16秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 1000
Электротехническая система магнитожидкостной герметизации валов регулируемых электродвигателей 800
日本語と中国語及びチベット・ビルマ語の語源関連性に関する分析 800
Holistic Discourse Analysis, Second Edition by Robert E. Longacre 666
The Basics of Practical Optimization, Second Edition 600
Practical Nonconvex Nonsmooth Optimization 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 计算机科学 工程类 纳米技术 有机化学 物理 生物化学 化学工程 内科学 复合材料 催化作用 心理学 人工智能 细胞生物学 光电子学 无机化学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 7975640
求助须知:如何正确求助?哪些是违规求助? 9439757
关于积分的说明 21064487
捐赠科研通 7552060
什么是DOI,文献DOI怎么找? 3374329
关于科研通互助平台的介绍 2509061
邀请新用户注册赠送积分活动 2407381