A Joint-Encoding Evolutionary Algorithm for Multimodal Multiobjective Feature Selection in Classification

In multiobjective feature selection, different feature subsets with the same number of selected features can achieve identical classification accuracy, meaning that it is a multimodal optimization problem. To effectively search for multimodal feature subsets within the vast search spaces of high-dimensional datasets, it is crucial to adopt reasonable encoding and search methods. Generally, applying a uniform evolutionary operator based on a single encoding method across the entire feature space is inefficient and prone to falling into local optima. To address the above issues, this article proposes a multimodal multiobjective feature selection method based on a joint encoding mechanism that combines discrete encoding and continuous encoding. It provides new perspectives to solve the high-dimensional feature selection problem from encoding methods to search operators. First, the search space is divided into a discrete encoding region and a continuous encoding region based on the knee points of feature importance ranking curve. A tailored initialization strategy is used to obtain the initial population for joint encoding. Second, an adaptive niche strategy based on three priorities is proposed, which ensures the similarity of individuals within a niche and the difference between niches. In addition, different search operators are cooperated with the two encoding strategies, respectively, to achieve effective and efficient search. The experimental results on 24 datasets show that the proposed algorithm achieves a better-classification performance than the state-of-the-art feature selection methods.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Evolutionary Computation
Published
2025-01-16
DOI
https://doi.org/10.1109/tevc.2025.3529977
Citations
4
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
9.92

Funders

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

A Joint-Encoding Evolutionary Algorithm for Multimodal Multiobjective Feature Selection in Classification

Boyang Qu, Kunjie Yu, Caitong Yue, Ying Bi et al.
4 citations
IEEE Transactions on Evolutionary Computation
Metaheuristic Optimization Algorithms Research
9.92
article

A Joint-Encoding Evolutionary Algorithm for Multimodal Multiobjective Feature Selection in Classification

Boyang Qu, Kunjie Yu, Caitong Yue, Ying Bi, Mengmeng Li, Yuyang Zhang, Jing Liang, Junting Yang
article en
4 citations

Abstract

In multiobjective feature selection, different feature subsets with the same number of selected features can achieve identical classification accuracy, meaning that it is a multimodal optimization problem. To effectively search for multimodal feature subsets within the vast search spaces of high-dimensional datasets, it is crucial to adopt reasonable encoding and search methods. Generally, applying a uniform evolutionary operator based on a single encoding method across the entire feature space is inefficient and prone to falling into local optima. To address the above issues, this article proposes a multimodal multiobjective feature selection method based on a joint encoding mechanism that combines discrete encoding and continuous encoding. It provides new perspectives to solve the high-dimensional feature selection problem from encoding methods to search operators. First, the search space is divided into a discrete encoding region and a continuous encoding region based on the knee points of feature importance ranking curve. A tailored initialization strategy is used to obtain the initial population for joint encoding. Second, an adaptive niche strategy based on three priorities is proposed, which ensures the similarity of individuals within a niche and the difference between niches. In addition, different search operators are cooperated with the two encoding strategies, respectively, to achieve effective and efficient search. The experimental results on 24 datasets show that the proposed algorithm achieves a better-classification performance than the state-of-the-art feature selection methods.

IEEE Transactions on Evolutionary ComputationVol. 29(6)
Zhongyuan University of Technology (CN), Zhengzhou University (CN), Henan Institute of Technology (CN)
National Natural Science Foundation of China, China Postdoctoral Science Foundation
Openalex Percentile: Top 3%
Metaheuristic Optimization Algorithms Research
9.92
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.