Multi-Objective Self-Adaptive Particle Swarm Optimization for Large-Scale Feature Selection in Classification

粒子群优化 维数之咒 选择(遗传算法) 特征选择 计算机科学 结构 特征(语言学) 局部最优 人工智能 进化算法 数学优化 算法 数学 程序设计语言 语言学 哲学
作者
Chenyi Zhang,Xue Yang,Ferrante Neri,Chengdong Xu,Adam Słowik
出处
期刊:International Journal of Neural Systems [World Scientific]
卷期号:34 (03)
标识
DOI:10.1142/s012906572450014x
摘要

Feature selection (FS) is recognized for its role in enhancing the performance of learning algorithms, especially for high-dimensional datasets. In recent times, FS has been framed as a multi-objective optimization problem, leading to the application of various multi-objective evolutionary algorithms (MOEAs) to address it. However, the solution space expands exponentially with the dataset's dimensionality. Simultaneously, the extensive search space often results in numerous local optimal solutions due to a large proportion of unrelated and redundant features [H. Adeli and H. S. Park, Fully automated design of super-high-rise building structures by a hybrid ai model on a massively parallel machine, AI Mag. 17 (1996) 87-93]. Consequently, existing MOEAs struggle with local optima stagnation, particularly in large-scale multi-objective FS problems (LSMOFSPs). Different LSMOFSPs generally exhibit unique characteristics, yet most existing MOEAs rely on a single candidate solution generation strategy (CSGS), which may be less efficient for diverse LSMOFSPs [H. S. Park and H. Adeli, Distributed neural dynamics algorithms for optimization of large steel structures, J. Struct. Eng. ASCE 123 (1997) 880-888; M. Aldwaik and H. Adeli, Advances in optimization of highrise building structures, Struct. Multidiscip. Optim. 50 (2014) 899-919; E. G. González, J. R. Villar, Q. Tan, J. Sedano and C. Chira, An efficient multi-robot path planning solution using a* and coevolutionary algorithms, Integr. Comput. Aided Eng. 30 (2022) 41-52]. Moreover, selecting an appropriate MOEA and determining its corresponding parameter values for a specified LSMOFSP is time-consuming. To address these challenges, a multi-objective self-adaptive particle swarm optimization (MOSaPSO) algorithm is proposed, combined with a rapid nondominated sorting approach. MOSaPSO employs a self-adaptive mechanism, along with five modified efficient CSGSs, to generate new solutions. Experiments were conducted on ten datasets, and the results demonstrate that the number of features is effectively reduced by MOSaPSO while lowering the classification error rate. Furthermore, superior performance is observed in comparison to its counterparts on both the training and test sets, with advantages becoming increasingly evident as the dimensionality increases.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
lv发布了新的文献求助10
1秒前
绿大暗发布了新的文献求助10
2秒前
4秒前
5秒前
孤独君浩完成签到 ,获得积分20
5秒前
5秒前
cyndi发布了新的文献求助10
6秒前
我就是KKKK发布了新的文献求助10
7秒前
lmy发布了新的文献求助10
8秒前
krish完成签到,获得积分10
10秒前
李爱国应助MFiWanting采纳,获得10
13秒前
16秒前
jungle完成签到 ,获得积分10
17秒前
18秒前
ppppc发布了新的文献求助10
23秒前
24秒前
28秒前
28秒前
29秒前
30秒前
脑洞疼应助狗屁大侠采纳,获得10
31秒前
zho发布了新的文献求助10
33秒前
ChandlerZB完成签到,获得积分10
34秒前
青日发布了新的文献求助10
34秒前
huxiao发布了新的文献求助10
35秒前
勤恳诗筠完成签到 ,获得积分10
36秒前
yaoping应助段红丝采纳,获得10
37秒前
ppppc完成签到,获得积分20
42秒前
搜集达人应助huxiao采纳,获得10
42秒前
43秒前
shuxue完成签到,获得积分10
43秒前
诸坤完成签到,获得积分10
44秒前
bkagyin应助Noir采纳,获得10
44秒前
46秒前
雨寒发布了新的文献求助50
46秒前
47秒前
一点完成签到 ,获得积分10
48秒前
Chen发布了新的文献求助10
51秒前
52秒前
高分求助中
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
A Chronicle of Small Beer: The Memoirs of Nan Green 1000
From Rural China to the Ivy League: Reminiscences of Transformations in Modern Chinese History 900
Eric Dunning and the Sociology of Sport 850
QMS18Ed2 | process management. 2nd ed 800
Operative Techniques in Pediatric Orthopaedic Surgery 510
The Making of Détente: Eastern Europe and Western Europe in the Cold War, 1965-75 500
热门求助领域 (近24小时)
化学 医学 材料科学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 物理化学 催化作用 免疫学 细胞生物学 电极
热门帖子
关注 科研通微信公众号,转发送积分 2915190
求助须知:如何正确求助?哪些是违规求助? 2553333
关于积分的说明 6908441
捐赠科研通 2215092
什么是DOI,文献DOI怎么找? 1177567
版权声明 588353
科研通“疑难数据库(出版商)”最低求助积分说明 576443