Multiple Reference Points-Based Decomposition for Multiobjective Feature Selection in Classification: Static and Dynamic Mechanisms

被引:91
作者
Nguyen, Bach Hoai [1 ]
Xue, Bing [1 ]
Andreae, Peter [1 ]
Ishibuchi, Hisao [2 ]
Zhang, Mengjie [1 ]
机构
[1] Victoria Univ Wellington, Sch Engn & Comp Sci, Wellington 6140, New Zealand
[2] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Shenzhen, Peoples R China
关键词
Feature extraction; Heuristic algorithms; Optimization; Task analysis; Approximation algorithms; Sociology; Statistics; Classification; feature selection; multiobjective evolutionary algorithm based on decomposition (MOEA; D); multiobjective optimization; partially conflicting; DIFFERENTIAL EVOLUTION; GENETIC ALGORITHM; OPTIMIZATION; MOEA/D; PERFORMANCE;
D O I
10.1109/TEVC.2019.2913831
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature selection is an important task in machine learning that has two main objectives: 1) reducing dimensionality and 2) improving learning performance. Feature selection can be considered a multiobjective problem. However, it has its problematic characteristics, such as a highly discontinuous Pareto front, imbalance preferences, and partially conflicting objectives. These characteristics are not easy for existing evolutionary multiobjective optimization (EMO) algorithms. We propose a new decomposition approach with two mechanisms (static and dynamic) based on multiple reference points under the multiobjective evolutionary algorithm based on decomposition (MOEA/D) framework to address the above-mentioned difficulties of feature selection. The static mechanism alleviates the dependence of the decomposition on the Pareto front shape and the effect of the discontinuity. The dynamic one is able to detect regions in which the objectives are mostly conflicting, and allocates more computational resources to the detected regions. In comparison with other EMO algorithms on 12 different classification datasets, the proposed decomposition approach finds more diverse feature subsets with better performance in terms of hypervolume and inverted generational distance. The dynamic mechanism successfully identifies conflicting regions and further improves the approximation quality for the Pareto fronts.
引用
收藏
页码:170 / 184
页数:15
相关论文
共 44 条
[1]  
[Anonymous], NONLINEAR MULTIOBJEC, DOI DOI 10.1186/1472-6807-14-3.OLITIAN)93:2020-02-28
[2]  
[Anonymous], evolutionary algorithm, EUROGEN 2001, Evol. Methods Des. Optim. Control
[3]  
[Anonymous], 2006, TUTORIAL OPTIMIZERS
[4]  
Auger A, 2009, FOGA'09: PROCEEDINGS OF THE 10TH ACM SIGRVO CONFERENCE ON FOUNDATIONS OF GENETIC ALGORITHMS, P87
[5]   Feature Selection to Improve Generalization of Genetic Programming for High-Dimensional Symbolic Regression [J].
Chen, Qi ;
Zhang, Mengjie ;
Xue, Bing .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (05) :792-806
[6]   A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :773-791
[7]   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
[8]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[9]   Challenges of Big Data analysis [J].
Fan, Jianqing ;
Han, Fang ;
Liu, Han .
NATIONAL SCIENCE REVIEW, 2014, 1 (02) :293-314
[10]   Towards Understanding the Cost of Adaptation in Decomposition-Based Optimization Algorithms [J].
Giagkiozis, Ioannis ;
Purshouse, Robin C. ;
Fleming, Peter J. .
2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, :615-620