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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Yang22完成签到,获得积分10
刚刚
郭泓嵩完成签到,获得积分0
1秒前
温暖囧完成签到 ,获得积分10
2秒前
ANDW完成签到 ,获得积分10
4秒前
哈哈完成签到,获得积分10
4秒前
Zhangjihui完成签到,获得积分10
5秒前
fcc完成签到 ,获得积分10
7秒前
王博涵完成签到 ,获得积分10
10秒前
aperio完成签到 ,获得积分10
13秒前
meimei完成签到 ,获得积分10
16秒前
达到毕业要求了吗完成签到 ,获得积分10
21秒前
西奥牧马完成签到 ,获得积分10
22秒前
成就绮琴完成签到 ,获得积分10
24秒前
唐刚应助科研通管家采纳,获得10
32秒前
科研通AI2S应助科研通管家采纳,获得10
32秒前
科目三应助科研通管家采纳,获得10
32秒前
彭于晏应助科研通管家采纳,获得10
32秒前
科研通AI2S应助科研通管家采纳,获得10
32秒前
清风徐来完成签到,获得积分10
34秒前
斯文败类应助兴奋以蓝采纳,获得10
37秒前
L盐完成签到,获得积分10
39秒前
此生不换完成签到,获得积分10
41秒前
xuhong完成签到 ,获得积分10
47秒前
朴实初夏完成签到 ,获得积分10
47秒前
Catherine_Song完成签到,获得积分10
47秒前
Wucaihong完成签到 ,获得积分10
48秒前
ddssa1988完成签到,获得积分10
48秒前
香蕉若南发布了新的文献求助20
53秒前
wlingke完成签到 ,获得积分10
55秒前
57秒前
dengdeng完成签到 ,获得积分10
57秒前
58秒前
肖之贤完成签到,获得积分10
1分钟前
个性青寒完成签到,获得积分10
1分钟前
韶可愁完成签到,获得积分10
1分钟前
1分钟前
mly完成签到 ,获得积分10
1分钟前
兴奋以蓝发布了新的文献求助10
1分钟前
1分钟前
An完成签到,获得积分10
1分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Applied Min-Max Approach to Missile Guidance and Control 5000
Metallurgy at high pressures and high temperatures 2000
Inorganic Chemistry Eighth Edition 1200
Anionic polymerization of acenaphthylene: identification of impurity species formed as by-products 1000
The Psychological Quest for Meaning 800
Signals, Systems, and Signal Processing 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6325937
求助须知:如何正确求助?哪些是违规求助? 8142015
关于积分的说明 17071730
捐赠科研通 5378411
什么是DOI,文献DOI怎么找? 2854190
邀请新用户注册赠送积分活动 1831847
关于科研通互助平台的介绍 1683076