Particle swarm optimization algorithm based on comprehensive scoring framework for high-dimensional feature selection

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Swarm and Evolutionary Computation Pub Date : 2025-03-23 DOI:10.1016/j.swevo.2025.101915
Bo Wei , Shanshan Yang , Wentao Zha , Li Deng , Jiangyi Huang , Xiaohui Su , Feng Wang
{"title":"Particle swarm optimization algorithm based on comprehensive scoring framework for high-dimensional feature selection","authors":"Bo Wei ,&nbsp;Shanshan Yang ,&nbsp;Wentao Zha ,&nbsp;Li Deng ,&nbsp;Jiangyi Huang ,&nbsp;Xiaohui Su ,&nbsp;Feng Wang","doi":"10.1016/j.swevo.2025.101915","DOIUrl":null,"url":null,"abstract":"<div><div>Feature selection (FS) plays an important role in data preprocessing. However, with the ever-increasing dimensionality of the dataset, most FS methods based on evolutionary computational (EC) face the challenge of “the dimensionality curse”. To address this challenge, we propose an new particle swarm optimization algorithm based on comprehensive scoring framework (PSO-CSM) for high-dimensional feature selection. First, a piecewise initialization strategy based on feature importance is used to initialize the population, which can help to obtain a diversity population and eliminate some redundant features. Then, a comprehensive scoring mechanism is proposed for screening important features. In this mechanism, a scaling adjustment factor is set to adjust the size of the feature space automatically. As the population continues to evolve, its feature space is further reduced so as to focus on the more promising area. Finally, a general comprehensive scoring framework (CSM) is designed to improve the performance of EC methods in FS task. The proposed PSO-CSM is compared with 10 representative FS algorithms on 18 datasets. The experimental results show that PSO-CSM is highly competitive in solving high-dimensional FS problems.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"95 ","pages":"Article 101915"},"PeriodicalIF":8.5000,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225000732","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Feature selection (FS) plays an important role in data preprocessing. However, with the ever-increasing dimensionality of the dataset, most FS methods based on evolutionary computational (EC) face the challenge of “the dimensionality curse”. To address this challenge, we propose an new particle swarm optimization algorithm based on comprehensive scoring framework (PSO-CSM) for high-dimensional feature selection. First, a piecewise initialization strategy based on feature importance is used to initialize the population, which can help to obtain a diversity population and eliminate some redundant features. Then, a comprehensive scoring mechanism is proposed for screening important features. In this mechanism, a scaling adjustment factor is set to adjust the size of the feature space automatically. As the population continues to evolve, its feature space is further reduced so as to focus on the more promising area. Finally, a general comprehensive scoring framework (CSM) is designed to improve the performance of EC methods in FS task. The proposed PSO-CSM is compared with 10 representative FS algorithms on 18 datasets. The experimental results show that PSO-CSM is highly competitive in solving high-dimensional FS problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于综合评分框架的粒子群优化高维特征选择算法
特征选择在数据预处理中起着重要的作用。然而,随着数据集维数的不断增加,大多数基于进化计算(EC)的FS方法都面临着“维数诅咒”的挑战。为了解决这一问题,我们提出了一种基于综合评分框架(PSO-CSM)的高维特征选择粒子群优化算法。首先,采用基于特征重要度的分段初始化策略对种群进行初始化,从而获得多样性种群,消除冗余特征;然后,提出了一种综合评分机制来筛选重要特征。在该机制中,通过设置比例调整因子来自动调整特征空间的大小。随着种群的不断演化,其特征空间进一步缩小,从而集中在更有前景的区域。最后,设计了一个通用的综合评分框架(CSM),以提高EC方法在FS任务中的性能。在18个数据集上与10种代表性的FS算法进行了比较。实验结果表明,PSO-CSM在求解高维FS问题方面具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
期刊最新文献
A hybrid evolutionary algorithm for 2D variable-sized bin packing with guillotine constraint in manufacturing Integrated scheduling of cargo vessels, research vessels, and marine experiments in multifunctional ports using Q-learning enhanced PSO A competition-driven two-phase evolutionary algorithm for constrained multi-objective optimization A comprehensive review on deep learning for multi-objective optimization An adaptive VNS-based evolutionary optimization for hybrid flowshop scheduling with consistent sublots
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1