• DocumentCode
    3142130
  • Title

    Feature Selection Based on Asynchronous Discrete Particle Swarm Optimal Search Algorithm

  • Author

    Wen-Ting Hsieh ; Shi-Jinn Horng

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan
  • fYear
    2012
  • fDate
    17-20 Dec. 2012
  • Firstpage
    262
  • Lastpage
    268
  • Abstract
    The feature subset selection reduces the cost of collecting redundant features. It is the main goal of feature subset selection that generating a feature subset which can preserve the most useful information of the original features. The feature selection methods often need expensive cost to find the optimal feature subset. The asynchronous discrete particle swarm optimal search algorithm is proposed to implemented and applied in the feature selection. The experimental results show that the proposed algorithm outperforms the others with respect to effective and efficient. The contributions of this study are: to survey methodology for feature selection, to apply the ADPSO-based algorithm on feature selection, and to construct an evaluated function for feature selection.
  • Keywords
    data reduction; feature extraction; particle swarm optimisation; search problems; ADPSO-based algorithm; asynchronous discrete particle swarm optimal search algorithm; dimensionality reduction; feature subset generation; feature subset selection; Accuracy; Algorithm design and analysis; Approximation algorithms; Approximation methods; Classification algorithms; Optimization; Particle swarm optimization; Dimensionality reduction; Feature selection; Particle swarm optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Architectures, Algorithms and Programming (PAAP), 2012 Fifth International Symposium on
  • Conference_Location
    Taipei
  • ISSN
    2168-3034
  • Print_ISBN
    978-1-4673-4566-8
  • Type

    conf

  • DOI
    10.1109/PAAP.2012.44
  • Filename
    6424766