TY - JOUR
T1 - Feature Selection Based on a Large-Scale Many-Objective Evolutionary Algorithm
AU - Li, Yue
AU - Sun, Zhiheng
AU - Liu, Xin
AU - Chen, Wei Tung
AU - Horng, Der Juinn
AU - Lai, Kuei Kuei
N1 - Publisher Copyright:
© 2021 Yue Li et al.
PY - 2021
Y1 - 2021
N2 - The feature selection problem is a fundamental issue in many research fields. In this paper, the feature selection problem is regarded as an optimization problem and addressed by utilizing a large-scale many-objective evolutionary algorithm. Considering the number of selected features, accuracy, relevance, redundancy, interclass distance, and intraclass distance, a large-scale many-objective feature selection model is constructed. It is difficult to optimize the large-scale many-objective feature selection optimization problem by using the traditional evolutionary algorithms. Therefore, this paper proposes a modified vector angle-based large-scale many-objective evolutionary algorithm (MALSMEA). The proposed algorithm uses polynomial mutation based on variable grouping instead of naive polynomial mutation to improve the efficiency of solving large-scale problems. And a novel worst-case solution replacement strategy using shift-based density estimation is used to replace the poor solution of two individuals with similar search directions to enhance convergence. The experimental results show that MALSMEA is competitive and can effectively optimize the proposed model.
AB - The feature selection problem is a fundamental issue in many research fields. In this paper, the feature selection problem is regarded as an optimization problem and addressed by utilizing a large-scale many-objective evolutionary algorithm. Considering the number of selected features, accuracy, relevance, redundancy, interclass distance, and intraclass distance, a large-scale many-objective feature selection model is constructed. It is difficult to optimize the large-scale many-objective feature selection optimization problem by using the traditional evolutionary algorithms. Therefore, this paper proposes a modified vector angle-based large-scale many-objective evolutionary algorithm (MALSMEA). The proposed algorithm uses polynomial mutation based on variable grouping instead of naive polynomial mutation to improve the efficiency of solving large-scale problems. And a novel worst-case solution replacement strategy using shift-based density estimation is used to replace the poor solution of two individuals with similar search directions to enhance convergence. The experimental results show that MALSMEA is competitive and can effectively optimize the proposed model.
UR - http://www.scopus.com/inward/record.url?scp=85114607434&partnerID=8YFLogxK
U2 - 10.1155/2021/9961727
DO - 10.1155/2021/9961727
M3 - 期刊論文
C2 - 34484326
AN - SCOPUS:85114607434
SN - 1687-5265
VL - 2021
JO - Computational Intelligence and Neuroscience
JF - Computational Intelligence and Neuroscience
M1 - 9961727
ER -