An Evolutionary Multitasking-Based Feature Selection Method for High-Dimensional Classification

被引:168
作者
Chen, Ke [1 ]
Xue, Bing [2 ]
Zhang, Mengjie [2 ]
Zhou, Fengyu [1 ]
机构
[1] Shandong Univ, Sch Control Sci & Engn, Jinan 250061, Peoples R China
[2] Victoria Univ Wellington, Sch Engn & Comp Sci, Wellington 6140, New Zealand
基金
中国国家自然科学基金;
关键词
Task analysis; Multitasking; Optimization; Search problems; Statistics; Sociology; Knowledge transfer; Evolutionary multitasking; feature selection (FS); high-dimensional classification; particle swarm optimization (PSO); PARTICLE SWARM OPTIMIZATION; ALGORITHM; SEARCH;
D O I
10.1109/TCYB.2020.3042243
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Feature selection (FS) is an important data preprocessing technique in data mining and machine learning, which aims to select a small subset of information features to increase the performance and reduce the dimensionality. Particle swarm optimization (PSO) has been successfully applied to FS due to being efficient and easy to implement. However, most of the existing PSO-based FS methods face the problems of trapping into local optima and computationally expensive high-dimensional data. Multifactorial optimization (MFO), as an effective evolutionary multitasking paradigm, has been widely used for solving complex problems through implicit knowledge transfer between related tasks. Inspired by MFO, this study proposes a novel PSO-based FS method to solve high-dimensional classification via information sharing between two related tasks generated from a dataset. To be specific, two related tasks about the target concept are established by evaluating the importance of features. A new crossover operator, called assortative mating, is applied to share information between these two related tasks. In addition, two mechanisms, which are variable-range strategy and subset updating mechanism, are also developed to reduce the search space and maintain the diversity of the population, respectively. The results show that the proposed FS method can achieve higher classification accuracy with a smaller feature subset in a reasonable time than the state-of-the-art FS methods on the examined high-dimensional classification problems.
引用
收藏
页码:7172 / 7186
页数:15
相关论文
共 50 条
[1]  
[Anonymous], 2007, ADV NEURAL INFORM PR
[2]   An approach to feature selection for keystroke dynamics systems based on PSO and feature weighting [J].
Azevedo, Gabriel L. F. B. G. ;
Cavalcanti, George D. C. ;
Carvalho Filho, E. C. B. .
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, :3577-3584
[3]   Multifactorial Evolutionary Algorithm With Online Transfer Parameter Estimation: MFEA-II [J].
Bali, Kavitesh Kumar ;
Ong, Yew Soon ;
Gupta, Abhishek ;
Tan, Puay Siew .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (01) :69-83
[4]   A Hamming distance based binary particle swarm optimization (HDBPSO) algorithm for high dimensional feature selection, classification and validation [J].
Banka, Haider ;
Dara, Suresh .
PATTERN RECOGNITION LETTERS, 2015, 52 :94-100
[5]   Adaptive Multi-Subswarm Optimisation for Feature Selection on High-Dimensional Classification [J].
Binh Tran ;
Xue, Bing ;
Zhang, Mengjie .
PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, :481-489
[6]  
Tran B, 2016, IEEE C EVOL COMPUTAT, P3801, DOI 10.1109/CEC.2016.7744271
[7]   A Feature Selection and Classification Algorithm Based on Randomized Extraction of Model Populations [J].
Brankovic, Aida ;
Falsone, Alessandro ;
Prandini, Maria ;
Piroddi, Luigi .
IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (04) :1151-1162
[8]  
Chen K., 2020, IEEE C EVOL COMPUTAT, P1, DOI DOI 10.1109/cec48606.2020.9185533
[9]   Hybrid particle swarm optimization with spiral-shaped mechanism for feature selection [J].
Chen, Ke ;
Zhou, Feng-Yu ;
Yuan, Xian-Feng .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 128 :140-156
[10]   Particle Swarm Optimization for Feature Selection with Adaptive Mechanism and New Updating Strategy [J].
Chen, Ke ;
Zhou, Fengyu ;
Xue, Bine .
AI 2018: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, 11320 :419-431