Abstract

The challenge of high-dimensional feature selection (FS) lies in the search technique, which needs to consider both minimizing the size of feature subset and maximizing the classification accuracy. Recently, multi-objective evolutionary algorithms (MOEAs) have shown excellent performance in solving FS tasks. However, most existing MOEAs struggle to effectively balance these two conflicting objectives when solving high-dimensional FS tasks. To cover this issue, in this paper, a decomposition-based multi-population evolutionary algorithm is proposed, called MPEA-FS. In the initialization stage, a multi-population generation strategy (MGS) based on feature weights (MGS) was adopted, with each population corresponding to a search subspace, which can improve the algorithm’s search ability. During the evolutionary stage, an external population is designed to integrate the excellent feature subsets of multiple populations to achieve knowledge sharing between them. In addition, to reduce the feature dimension, a feature reduction strategy (FRS) is proposed, which can remove unimportant features while maintaining classification accuracy. Extensive experiments are performed on 13 high-dimensional datasets, and the proposed algorithm is compared with 5 state-of-the-art FS methods proposed in the last 3 years on multiple metrics. The experimental results indicate that MPEA-FS can achieve higher classification accuracy on most datasets, and the number of selected features is also competitive.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call