Differential Evolution-Based Feature Selection: A Niching-Based Multiobjective Approach

被引:60
作者
Wang, Peng [1 ]
Xue, Bing [1 ]
Liang, Jing [2 ]
Zhang, Mengjie [1 ]
机构
[1] Victoria Univ Wellington, Evolutionary Computat Res Grp, Wellington 6140, New Zealand
[2] Zhengzhou Univ, Sch Elect Engn, Zhengzhou 450001, Peoples R China
基金
中国国家自然科学基金;
关键词
Feature extraction; Classification algorithms; Task analysis; Statistics; Sociology; Error analysis; Optimization; Classification; differential evolution (DE); evolutionary multiobjective optimization (EMO); feature selection; GENETIC ALGORITHM; OPTIMIZATION; RELEVANCE;
D O I
10.1109/TEVC.2022.3168052
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection is to reduce both the dimensionality of data and the classification error rate (i.e., increase the classification accuracy) of a learning algorithm. The two objectives are often conflicting, thus a multiobjective feature selection method can obtain a set of nondominated feature subsets. Each solution in the set has a different size and a corresponding classification error rate. However, most existing feature selection algorithms have ignored that, for a given size, there can be different feature subsets with very similar or the same accuracy. This article introduces a niching-based multiobjective feature selection method that simultaneously minimizes the number of selected features and the classification error rate. The proposed method conceives to identify: 1) a set of feature subsets with good convergence and distribution and 2) multiple feature subsets choosing the same number of features with almost the same lowest classification error rate. The contributions of this article are threefold. First, a niching and global interaction mutation operator is proposed that can produce promising feature subsets. Second, a newly developed environmental selection mechanism allows equal informative feature subsets to be stored by relaxing the Pareto-dominance relationship. Finally, the proposed subset repairing mechanism can generate better feature subsets and further remove the redundant features. The proposed method is compared against seven multiobjective feature selection algorithms on 19 datasets, including both binary and multiclass classification tasks. The results show that the proposed method can evolve a rich and diverse set of nondominated solutions for different feature selection tasks, and their availability helps in understanding the relationships between features.
引用
收藏
页码:296 / 310
页数:15
相关论文
共 61 条
[1]   LEARNING BOOLEAN CONCEPTS IN THE PRESENCE OF MANY IRRELEVANT FEATURES [J].
ALMUALLIM, H ;
DIETTERICH, TG .
ARTIFICIAL INTELLIGENCE, 1994, 69 (1-2) :279-305
[2]  
Bidgoli AA, 2019, IEEE C EVOL COMPUTAT, P1588, DOI [10.1109/cec.2019.8790287, 10.1109/CEC.2019.8790287]
[3]  
Cawley GC, 2007, Advances in Neural Information Processing Systems, P209
[4]   A Steering-Matrix-Based Multiobjective Evolutionary Algorithm for High-Dimensional Feature Selection [J].
Cheng, Fan ;
Chu, Feixiang ;
Xu, Yi ;
Zhang, Lei .
IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (09) :9695-9708
[5]  
De Jong K. A., 1975, THESIS U MICHIGAN AN
[6]   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
[7]   Omni-optimizer: A generic evolutionary algorithm for single and multi-objective optimization [J].
Deb, Kalyanmoy ;
Tiwari, Santosh .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 185 (03) :1062-1087
[8]  
Dua D., 2017, UCI MACHINE LEARNING
[9]   Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances [J].
Feng, Xin ;
Wang, Shaofei ;
Liu, Quewang ;
Li, Han ;
Liu, Jiamei ;
Xu, Cheng ;
Yang, Weifeng ;
Shu, Yayun ;
Zheng, Weiwei ;
Yu, Bingxin ;
Qi, Mingran ;
Zhou, Wenyang ;
Zhou, Fengfeng .
JOVE-JOURNAL OF VISUALIZED EXPERIMENTS, 2018, (140)
[10]   Research on collaborative negotiation for e-commerce. [J].
Feng, YQ ;
Lei, Y ;
Li, Y ;
Cao, RZ .
2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, :2085-2088