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

International journal of neural systems Pub Date : 2024-03-01 Epub Date: 2024-02-09 DOI:10.1142/S012906572450014X
Chenyi Zhang, Yu Xue, Ferrante Neri, Xu Cai, Adam Slowik
{"title":"Multi-Objective Self-Adaptive Particle Swarm Optimization for Large-Scale Feature Selection in Classification.","authors":"Chenyi Zhang, Yu Xue, Ferrante Neri, Xu Cai, Adam Slowik","doi":"10.1142/S012906572450014X","DOIUrl":null,"url":null,"abstract":"<p><p>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, <i>AI Mag.</i> <b>17</b> (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, <i>J. Struct. Eng. ASCE</i> <b>123</b> (1997) 880-888; M. Aldwaik and H. Adeli, Advances in optimization of highrise building structures, <i>Struct. Multidiscip. Optim.</i> <b>50</b> (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, <i>Integr. Comput. Aided Eng.</i> <b>30</b> (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.</p>","PeriodicalId":94052,"journal":{"name":"International journal of neural systems","volume":" ","pages":"2450014"},"PeriodicalIF":0.0000,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of neural systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S012906572450014X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/2/9 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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.

分类中大规模特征选择的多目标自适应粒子群优化技术
特征选择(FS)在提高学习算法性能方面的作用已得到公认,尤其是在高维数据集方面。近来,FS 被视为一个多目标优化问题,从而导致了各种多目标进化算法(MOEAs)的应用。然而,随着数据集维度的增加,求解空间也呈指数级扩大。同时,由于大量不相关的冗余特征,广阔的搜索空间往往会产生无数局部最优解 [H. Adeli 和 H. S. Park]。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].因此,现有的 MOEAs 在局部最优停滞问题上举步维艰,尤其是在大规模多目标 FS 问题(LSMOFSPs)中。不同的 LSMOFSP 通常具有独特的特征,然而现有的 MOEA 大多依赖于单一的候选解生成策略(CSGS),这对于多样化的 LSMOFSP 可能效率较低 [H. S. Park and H. Adelel]。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].此外,为指定的 LSMOFSP 选择合适的 MOEA 并确定其相应的参数值非常耗时。为了应对这些挑战,我们提出了一种多目标自适应粒子群优化(MOSaPSO)算法,并结合快速非支配排序法。MOSaPSO 采用自适应机制和五种改进的高效 CSGS 来生成新的解决方案。实验在十个数据集上进行,结果表明 MOSaPSO 能有效减少特征数量,同时降低分类错误率。此外,在训练集和测试集上,MOSaPSO 的性能都优于同类产品,而且随着维度的增加,其优势也越来越明显。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信