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 , Shanshan Yang , Wentao Zha , Li Deng , Jiangyi Huang , Xiaohui Su , 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.2000,"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.
期刊介绍:
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.