A Multi-Task Decomposition-Based Evolutionary Algorithm for Tackling High-Dimensional Bi-Objective Feature Selection

Hang Xu (), Chaohui Huang, Jianbing Lin, Min Lin, Huahui Zhang and Rongbin Xu
Additional contact information
Hang Xu: School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China
Chaohui Huang: School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China
Jianbing Lin: School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China
Min Lin: School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China
Huahui Zhang: New Engineering Industry College, Putian University, Putian 351100, China
Rongbin Xu: School of Mechanical, Electrical & Information Engineering, Putian University, Putian 351100, China

Mathematics, 2024, vol. 12, issue 8, 1-23

Abstract: Evolutionary algorithms have been widely applied for solving multi-objective optimization problems, while the feature selection in classification can also be treated as a discrete bi-objective optimization problem if attempting to minimize both the classification error and the ratio of selected features. However, traditional multi-objective evolutionary algorithms (MOEAs) may have drawbacks for tackling large-scale feature selection, due to the curse of dimensionality in the decision space. Therefore, in this paper, we concentrated on designing an multi-task decomposition-based evolutionary algorithm (abbreviated as MTDEA), especially for handling high-dimensional bi-objective feature selection in classification. To be more specific, multiple subpopulations related to different evolutionary tasks are separately initialized and then adaptively merged into a single integrated population during the evolution. Moreover, the ideal points for these multi-task subpopulations are dynamically adjusted every generation, in order to achieve different search preferences and evolutionary directions. In the experiments, the proposed MTDEA was compared with seven state-of-the-art MOEAs on 20 high-dimensional classification datasets in terms of three performance indicators, along with using comprehensive Wilcoxon and Friedman tests. It was found that the MTDEA performed the best on most datasets, with a significantly better search ability and promising efficiency.

Keywords: bi-objective feature selection; evolutionary algorithm; high-dimensional classification data; multi-task decomposition (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/8/1178/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/8/1178/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:8:p:1178-:d:1375635

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().