Cooperative Coevolutionary Probability-Based Binary Particle Swarm Optimization for High-Dimensional Feature Selection
Feature Selection (FS) on high-dimensional data is challenging for evolutionary computation-based FS algorithms. To address the vast decision space of high-dimensional FS problems, this paper proposes a Cooperative Coevolutionary Probability-based Binary Particle Swarm Optimization (CCPBPSO-FS) algorithm. The proposed algorithm divides the feature space into subspaces and employs multiple swarms in these subspaces to cooperatively solve the FS problem. A multi-swarm initialization strategy, considering feature ranking information, is proposed to initialize sparse particles. Additionally, a new probability-based solution updating mechanism with a mutation operator to enhance search performance is proposed. Experimental results on eight high-dimensional datasets demonstrate that CCPBPSO-FS achieves competitive classification performance while significantly reducing the number of selected features compared with benchmark FS algorithms.
Authors
- Xiaohong Lin (ORCID: https://orcid.org/0000-0003-2979-8119)
- Bing Xue (ORCID: https://orcid.org/0000-0002-4865-8026)
- An‐Da Li (ORCID: https://orcid.org/0000-0002-2111-8724)
- Mengjie Zhang (ORCID: https://orcid.org/0000-0003-4463-9538)
- Guodong Wang (ORCID: https://orcid.org/0000-0002-9407-4363)
Institutions
- Tianjin University of Commerce (CN)
- Zhengzhou University of Aeronautics (CN)
- Victoria University of Wellington (NZ)
Publication Details
- Published
- 2025-06-08
- DOI
- https://doi.org/10.1109/cec65147.2025.11043034
- Primary Topic
- Metaheuristic Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China