A Multiform Many-Objective Evolutionary Algorithm for Multilabel Feature Selection in Classification

Multilabel classification (MLC) deals with instances associated with multiple labels simultaneously and often includes high dimensional data with noisy, irrelevant, and redundant features. Feature selection for MLC is crucial for achieving successful classification performance. However, no unified metric exists for evaluating learning performance in MLC tasks. Instead, multiple metrics exist, each assessing a different aspect of the classification process, and these metrics are often inconsistent with one another. Consequently, multilabel feature selection (MLFS) becomes a many-objective optimization problem (MaOP) when optimizing three or more classification metrics and the number of selected features simultaneously. Evolutionary computation (EC) techniques have shown great promise in addressing many-objective tasks due to their ability to effectively explore large and complex search spaces. EC techniques can handle multiple objectives concurrently, making them well-suited for the challenges posed by MLFS. Despite this potential, research on EC-based MLFS methods remains limited, with few studies treating it as an MaOP. To address this gap, this article proposes a new many-objective evolutionary algorithm within a multiform framework. The proposed algorithm leverages distinct subpopulations to address specific MLFS tasks, incorporates a strategy to exchange information between MLFS tasks, employs a local density-based selection mechanism to maintain diverse high-quality solutions, and uses an adaptive parameter scheme inspired by stochastic gradient descent to guide the search toward new regions in the objective space. Experimental results demonstrate the superiority of the proposed algorithm across a diverse range of high-dimensional datasets, outperforming both recently introduced many-objective and conventional MLFS algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Evolutionary Computation
Published
2024-12-27
DOI
https://doi.org/10.1109/tevc.2024.3523469
Citations
1
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.33
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Multiform Many-Objective Evolutionary Algorithm for Multilabel Feature Selection in Classification

Emrah Hançer, Bing Xue, Mengjie Zhang
1 citations
IEEE Transactions on Evolutionary Computation
Advanced Algorithms and Applications
0.33
article

A Multiform Many-Objective Evolutionary Algorithm for Multilabel Feature Selection in Classification

Emrah Hançer, Bing Xue, Mengjie Zhang
article en
1 citations

Abstract

Multilabel classification (MLC) deals with instances associated with multiple labels simultaneously and often includes high dimensional data with noisy, irrelevant, and redundant features. Feature selection for MLC is crucial for achieving successful classification performance. However, no unified metric exists for evaluating learning performance in MLC tasks. Instead, multiple metrics exist, each assessing a different aspect of the classification process, and these metrics are often inconsistent with one another. Consequently, multilabel feature selection (MLFS) becomes a many-objective optimization problem (MaOP) when optimizing three or more classification metrics and the number of selected features simultaneously. Evolutionary computation (EC) techniques have shown great promise in addressing many-objective tasks due to their ability to effectively explore large and complex search spaces. EC techniques can handle multiple objectives concurrently, making them well-suited for the challenges posed by MLFS. Despite this potential, research on EC-based MLFS methods remains limited, with few studies treating it as an MaOP. To address this gap, this article proposes a new many-objective evolutionary algorithm within a multiform framework. The proposed algorithm leverages distinct subpopulations to address specific MLFS tasks, incorporates a strategy to exchange information between MLFS tasks, employs a local density-based selection mechanism to maintain diverse high-quality solutions, and uses an adaptive parameter scheme inspired by stochastic gradient descent to guide the search toward new regions in the objective space. Experimental results demonstrate the superiority of the proposed algorithm across a diverse range of high-dimensional datasets, outperforming both recently introduced many-objective and conventional MLFS algorithms.

IEEE Transactions on Evolutionary ComputationVol. 29(6)
Victoria University of Wellington (NZ)
Openalex Percentile: Top 38%
Advanced Algorithms and Applications
0.33
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.