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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cooperative Coevolutionary Probability-Based Binary Particle Swarm Optimization for High-Dimensional Feature Selection

Xiaohong Lin, Bing Xue, An‐Da Li, Mengjie Zhang et al.
Metaheuristic Optimization Algorithms Research
article

Cooperative Coevolutionary Probability-Based Binary Particle Swarm Optimization for High-Dimensional Feature Selection

Xiaohong Lin, Bing Xue, An‐Da Li, Mengjie Zhang, Guodong Wang
article en

Abstract

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.

Tianjin University of Commerce (CN), Zhengzhou University of Aeronautics (CN), Victoria University of Wellington (NZ)
National Natural Science Foundation of China
Openalex Percentile: Top 93%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Cooperative Coevolutionary Probability-Based Binary Particle Swarm Optimization for High-Dimensional Feature Selection — Xiaohong Lin, Bing Xue, et al. · (2025) | TGRS Research Map | TGRS