• DocumentCode
    2137802
  • Title

    A cluster-based sequential feature selection algorithm

  • Author

    Kexin Zhu ; Jian Yang

  • Author_Institution
    Int. WIC Inst., Beijing Univ. of Technol., Beijing, China
  • fYear
    2013
  • fDate
    23-25 July 2013
  • Firstpage
    848
  • Lastpage
    852
  • Abstract
    Feature selection is an effective machine learning method for reducing dimensionality, removing irrelevant features, increasing learning accuracy, and improving result comprehensibility. However, many existing feature selection methods are incapable for high dimensional data because of their high time complexity, especially wrapper feature selection algorithms. In this work, a fast sequential feature selection algorithm (AP-SFS) is proposed based on affinity propagation clustering. AP-SFS divides the original feature space into several subspaces by a cluster algorithm, then applies sequential feature selection for each subspace, and collects all selected features together. Experimental results on several benchmark datasets indicate that AP-SFS can be implemented much faster than sequential feature selection but has comparable accuracies.
  • Keywords
    feature selection; learning (artificial intelligence); pattern clustering; AP-SFS; affinity propagation clustering; cluster-based sequential feature selection algorithm; feature space; high dimensional data; learning accuracy; machine learning method; Accuracy; Classification algorithms; Clustering algorithms; Computational modeling; Machine learning algorithms; Sonar; Vectors; affinity propagation cluster; high dimensional data; sequential feature selection; wrapper;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Natural Computation (ICNC), 2013 Ninth International Conference on
  • Conference_Location
    Shenyang
  • Type

    conf

  • DOI
    10.1109/ICNC.2013.6818094
  • Filename
    6818094