Two-Stage Decomposition Method Based on Cooperation Coevolution for Feature Selection on High-Dimensional Classification

5Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Feature selection is an important task in data mining and machine learning to reduce the dimensionality of data and improve the performance. However, feature selection is still a challenge task especially for the large-scale problems with small sample size and extremely large number of features. A variety of methods have been applied to solve the feature selection problems, in which evolutionary algorithm has recently attracted increasing attention and made great progress. In this study, a two-stage decomposition cooperating coevolution strategy for feature selection (CCFS/TD) is proposed. In the first stage, the proposed algorithm decomposes evolutionary process into $k$ -level and evolves by cooperating coevolution for each level. Then, in the second stage, evolution process of each level is further decomposed into several independent processes. The selected subset of features are determined by the results of all independent processes through majority voting. Experiments on ten benchmark datasets are carried out to verify the effectiveness of the proposed method. The results demonstrate that the proposed CCFS/TD can obtain better classification performance with a smaller number of features in most cases in comparison to some existing methods.

Cite

CITATION STYLE

APA

Wang, Y., Qu, B., Liang, J., Wei, Y., Yue, C., Hu, Y., & Song, H. (2019). Two-Stage Decomposition Method Based on Cooperation Coevolution for Feature Selection on High-Dimensional Classification. IEEE Access, 7, 163191–163201. https://doi.org/10.1109/ACCESS.2019.2946649

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free