Many-objective optimization of feature selection based on two-level particle cooperation
- Author: Yu Zhou, Junhao Kang, Hainan Guo
- Accepted: 1 May 2020
- Published in: Information Sciences ( INS )
- paper link
- code:https://github.com/EMRGSZU/papers-code/tree/main/MOEAD-COPSO
Abstract
Feature selection (FS) plays a crucial role in classification, which aims to remove redundant and irrelevant data features.unknown However, for high-dimensional FS problems, Pareto optimal solutions are usually sparse, signifying that most of the decision variables are zero. Solving such problems using most existing evolutionary algorithms is difficult. In this paper, we reformulate FS as a many-objective optimization problem comprising three objectives to be minimized. To solve this problem, we proposed a binary particle swarm optimization with a two-level particle cooperation strategy. In the first level, to maintain rapid convergence, randomly generated ordinary particles and strict particles filtered by ReliefF are combined as the initialized particles. In the second level, under the decomposition multiobjective optimization framework, cooperation between particles is conducted during the update process to search for Pareto solutions more efficiently. In addition, a many-objective reset operation is proposed to enable the algorithm to jump out of the local optimum. Experimental studies on 10 real-world benchmark data sets revealed that our proposed algorithm could effectively reduce the number of features and achieve a competitive classification accuracy compared with some state-of-the-art evolutionary FS methods and non-evolutionary approaches.