• DocumentCode
    3345203
  • Title

    A new feature selection algorithm based on binary ant colony optimization

  • Author

    Kashef, Sadra ; Nezamabadi-pour, Hossein

  • Author_Institution
    Dept. of Electr. Eng., Shahid Bahonar Univ. of Kerman, Kerman, Iran
  • fYear
    2013
  • fDate
    28-30 May 2013
  • Firstpage
    50
  • Lastpage
    54
  • Abstract
    Feature selection is an indispensable preprocessing step for effective analysis of high dimensional data. In this paper a novel feature selection algorithm based on Ant Colony Optimization (ACO), called Advanced Binary ACO (ABACO), is presented. Features are treated as graph nodes to construct a graph model. In this graph, each feature has two nodes, one for selecting that feature and the other for deselecting. Ant colony algorithm is used to select nodes while ants should visit all features. At the end of a tour, each ant has a binary vector with the same length as the number of features where 1 implies selecting and 0 implies deselecting the corresponding feature. The experimental comparison verifies that the algorithm has a good classification accuracy using a smaller feature set than another existing ACO-based feature selection method.
  • Keywords
    ant colony optimisation; data analysis; data reduction; learning (artificial intelligence); pattern classification; advanced binary ACO; binary ant colony optimization; binary vector; dimensionality reduction; feature selection algorithm; graph model; graph nodes; high dimensional data analysis; machine learning; node selection; Accuracy; Algorithm design and analysis; Ant colony optimization; Classification algorithms; Filtering algorithms; Machine learning algorithms; Optimization; Ant colony optimization; Classification; Dimensionality reduction; Feature selection;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information and Knowledge Technology (IKT), 2013 5th Conference on
  • Conference_Location
    Shiraz
  • Print_ISBN
    978-1-4673-6489-8
  • Type

    conf

  • DOI
    10.1109/IKT.2013.6620037
  • Filename
    6620037