.png){kind=icon}
.png){kind=icon}
Return
Solving Multiobjective Feature Selection Problems in Classification via Problem Reformulation and Duplication Handling
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2022.3215745.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Reducing the number of selected features and improving the classification performance are two major objectives in feature selection, which can be viewed as a multiobjective optimization problem. Multiobjective feature selection in classification has its unique characteristics, such as it has a strong preference for the classification performance over the number of selected features. Besides, solution duplication often appears in both the search and the objective spaces, which degenerates the diversity and results in the premature convergence of the population. To deal with the above issues, in this article, during the evolutionary training process, a multiobjective feature selection problem is reformulated and solved as a constrained multiobjective optimization problem, which adds a constraint on the classification performance for each solution (e.g., feature subset) according to the distribution of nondominated solutions, with the aim of selecting promising feature subsets that contain more informative and strongly relevant features, which are beneficial to improve the classification performance. Furthermore, based on the distribution of feature subsets in the objective space and their similarity in the search space, a duplication analysis and handling method is proposed to enhance the diversity of the population. Experimental results demonstrate that the proposed method outperforms six state-of-the-art algorithms and is computationally efficient on 18 classification datasets.
Keywords:
Classification
constraint handling
duplication analysis
feature selection
multiobjective optimization
Classification
constraint handling
duplication analysis
feature selection
multiobjective optimization
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W