Binary Particle Swarm Optimization with Manta Ray Foraging Learning Strategies for High-Dimensional Feature Selection.

High-dimensional feature selection is one of the key problems of big data analysis. The binary particle swarm optimization (BPSO) method, when used to achieve feature selection for high-dimensional data problems, can get stuck in local optima, leading to reduced search efficiency and inferior feature selection results. This paper proposes a novel BPSO method with manta ray foraging learning strategies (BPSO-MRFL) to address the challenges of high-dimensional feature selection tasks. The BPSO-MRFL algorithm draws inspiration from the manta ray foraging optimization (MRFO) algorithm and incorporates several distinctive search strategies to enhance its efficiency and effectiveness. These search strategies include chain learning, cyclone learning, and somersault learning. Chain learning allows particles to learn from each other and share information more effectively in order to improve the social learning ability of the population. Cyclone learning introduces a gradual increase over iterations, which helps the BPSO-MRFL algorithm to transition smoothly from exploratory searching to exploitative searching, and it creates a balance between exploration and exploitation. Somersault learning enables particles to adaptively search within a changing search range and allows the algorithm to fine-tune the selected features, which enhances the algorithm's local search ability and improves the quality of the selected subset. The proposed BPSO-MRFL algorithm was evaluated using 10 high-dimensional small-sample gene expression datasets. The results demonstrate that the proposed BPSO-MRFL algorithm achieves enhanced classification accuracy and feature reduction compared to traditional feature selection methods. Additionally, it exhibits competitive performance compared to other advanced feature selection methods. The BPSO-MRFL algorithm presents a promising approach to feature selection in high-dimensional data mining tasks.