An adaptive initialization and multitasking based evolutionary algorithm for bi-objective feature selection in classification

被引:0
作者
Xu, Hang [1 ]
Xue, Bing [2 ,3 ]
Zhang, Mengjie [2 ,3 ]
机构
[1] Putian Univ, Sch Mech Elect & Informat Engn, Putian 351100, Peoples R China
[2] Victoria Univ Wellington, Ctr Data Sci & Artificial Intelligence, Wellington 6140, New Zealand
[3] Victoria Univ Wellington, Sch Engn & Comp Sci, Wellington 6140, New Zealand
基金
中国国家自然科学基金;
关键词
Adaptive initialization; Evolutionary feature selection; Multi-objective optimization; Multitask framework; PARTICLE SWARM OPTIMIZATION; SEARCH;
D O I
10.1007/s40747-025-01941-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary algorithms have become a widely-used approach for solving multi-objective optimization problems over the last decades, while feature selection in classification is also a discrete bi-objective optimization problem that aims at simultaneously minimizing the classification error and the number of selected features. However, traditional multi-objective evolutionary algorithms often encounter drawbacks when the total number of features grows to a large-scale level. Thus, in this paper, an adaptive initialization and multitasking based evolutionary algorithm, termed AIMEA, is proposed to tackle bi-objective feature selection in classification, especially for large-scale datasets. More specifically, an adaptive initialization mechanism based on a set of task-related subpopulations is set up to provide a promising start for evolution, while a dynamic multitask framework is also built up with a flexible multitask merging mechanism and an effective hybrid reproduction mechanism. In the experiments, 7 existing algorithms are used to compare with the proposed AIMEA on 20 classification datasets. The Wilcoxon's Test and the Friedman's Test are also adopted for more comprehensive analyses on the experiment results. As a result, the proposed AIMEA shows significantly better performances on most datasets in terms of 3 widely-used performance indicators, along with generally less computational time and better solution distributions.
引用
收藏
页数:25
相关论文
共 71 条
[1]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[2]   Investigation on particle swarm optimisation for feature selection on high-dimensional data: local search and selection bias [J].
Binh Tran ;
Xue, Bing ;
Zhang, Mengjie ;
Su Nguyen .
CONNECTION SCIENCE, 2016, 28 (03) :270-294
[3]   Evolutionary Multitasking for Feature Selection in High-Dimensional Classification via Particle Swarm Optimization [J].
Chen, Ke ;
Xue, Bing ;
Zhang, Mengjie ;
Zhou, Fengyu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2022, 26 (03) :446-460
[4]   An Evolutionary Multitasking-Based Feature Selection Method for High-Dimensional Classification [J].
Chen, Ke ;
Xue, Bing ;
Zhang, Mengjie ;
Zhou, Fengyu .
IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (07) :7172-7186
[5]   A Variable Granularity Search-Based Multiobjective Feature Selection Algorithm for High-Dimensional Data Classification [J].
Cheng, Fan ;
Cui, Junjie ;
Wang, Qijun ;
Zhang, Lei .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2023, 27 (02) :266-280
[6]   Enhanced SparseEA for large-scale multi-objective feature selection problems [J].
Chu, Shu-Chuan ;
Zhuang, Zhongjie ;
Pan, Jeng-Shyang ;
Mohamed, Ali Wagdy ;
Hu, Chia-Cheng .
COMPLEX & INTELLIGENT SYSTEMS, 2024, 10 (01) :485-507
[7]  
Coello Coello CA., 2007, EVOLUTIONARY ALGORIT, DOI DOI 10.1007/978-0-387-36797-2
[8]  
Dash M., 1997, Intelligent Data Analysis, V1
[9]   Evolutionary computation for feature selection in classification problems [J].
de la Iglesia, Beatriz .
WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY, 2013, 3 (06) :381-407
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197