Adaptive feature selection using v-shaped binary particle swarm optimization

PLoS One. 2017 Mar 30;12(3):e0173907. doi: 10.1371/journal.pone.0173907. eCollection 2017.

Abstract

Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their combined effect. Moreover, a greedy search considers only the optimization of the current round and thus cannot be a global search. To evaluate the combined effect of different subsets in the entire feature space, an adaptive feature selection method based on V-shaped binary particle swarm optimization is proposed. In this method, the fitness function is constructed using the correlation information entropy. Feature subsets are regarded as individuals in a population, and the feature space is searched using V-shaped binary particle swarm optimization. The above procedure overcomes the hard constraint on the number of features, enables the combined evaluation of each subset as a whole, and improves the search ability of conventional binary particle swarm optimization. The proposed algorithm is an adaptive method with respect to the number of feature subsets. The experimental results show the advantages of optimizing the feature subsets using the V-shaped transfer function and confirm the effectiveness and efficiency of the feature subsets obtained under different classifiers.

MeSH terms

  • Algorithms*
  • Data Mining / statistics & numerical data*
  • Entropy
  • Humans
  • Machine Learning / statistics & numerical data*
  • Support Vector Machine / statistics & numerical data

Grants and funding

The authors received no specific funding for this work.