Skip to main content

An Efficient Feature Selection Using Ant Colony Optimization Algorithm

  • Conference paper
Neural Information Processing (ICONIP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5864))

Included in the following conference series:

Abstract

This paper presents an efficient feature selection algorithm by utilizing the strategy of ant colony optimization, called as ACOFS. Initially, ACOFS uses a modified framework to guide the ants in the right directions while constructing the graph (subset) paths. In the subsequent part, a set of new modified pheromone update rules as well as a set of new modified estimation of heuristic information for features are introduced. The effect of such modifications ultimately assists ants to generate salient feature subsets with reduced size. We evaluate the performance of ACOFS on four real-world benchmark datasets. The experimental results show that ACOFS has a remarkable capability to generate reduced size subsets of salient features with yielding significant classification accuracies.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hall, M.A.: Correlation-based feature selection for discrete and numeric class machine learning. In: 17th International Conference on Machine Learning (2000)

    Google Scholar 

  2. Gasca, E., Sanchez, J.S., Alonso, R.: Eliminating redundancy and irrelevance using a new MLP-based feature selection method. Pattern Recognition 39, 313–315 (2006)

    Article  MATH  Google Scholar 

  3. Guan, S., Liu, J., Qi, Y.: An incremental approach to contribution-based feature selection. Journal of Intelligence Systems 13(1) (2004)

    Google Scholar 

  4. Abe, S.: Modified backward feature selection by cross validation. In: Proceedings of the European Symposium on Artificial Neural Networks, pp. 163–168 (2005)

    Google Scholar 

  5. Yang, J.H., Honavar, V.: Feature subset selection using a genetic algorithm. IEEE intelligent systems 13(2), 44–49 (1998)

    Article  Google Scholar 

  6. Muni, D.P., Pal, N.R., Das, J.: Genetic Programming for Simultaneous Feature Selection and Classifier Design. IEEE Trans. on Syst., Man, and Cybern.-Part B: Cybern. 36(1) (2006)

    Google Scholar 

  7. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperative agents. IEEE Trans. on Systems, Man, and Cybern. 26(1), 29–41 (1996)

    Article  Google Scholar 

  8. Maniezzo, V., Colorni, A.: The ant system applied to the quadratic assignment problem. IEEE transaction on knowledge and data engineering 11(5), 769–778 (1999)

    Article  Google Scholar 

  9. Aghdam, M.H., Aghaee, N.G., Basiri, M.E.: Text feature selection using ant colony optimization. Expert systems with applicantions 36, 6843–6853 (2009)

    Article  Google Scholar 

  10. Kanan, H.R., Faez, K., Taheri, S.M.: Feature selection using ACO: a new method and comparative study in the application of face recognition system. In: Intl. conf. on data mining, pp. 63–76 (2007)

    Google Scholar 

  11. Khushaba, R.N., Alsukker, A., Ani, A.A., Jumaily, A.A.: Enhanced feature selection algorithm using ant colony optimization and fuzzy memberships. In: Intl. conf. on biomedical engineeri., pp. 34–39 (2008)

    Google Scholar 

  12. Sivagaminathan, R.K., Ramakrishnan, S.: A hybrid approach for feature subset selection using neural networks and ant colony optimization. Expert systems with applications 33, 49–60 (2007)

    Article  Google Scholar 

  13. Ani, A.: Feature subset selection using ant colony optimization. International journal of computational intelligence 2, 53–58 (2005)

    Google Scholar 

  14. Ke, L., Feng, Z., Ren, Z.: An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognition Letters 29, 1351–1357 (2008)

    Article  Google Scholar 

  15. Robbins, K.R., Zhang, W., Bertrand, J.K.: The ant colony algorithm for feature selection in high-dimension gene expression data for disease classification. J. of Math. Medi. and Biol., 1–14 (2008)

    Google Scholar 

  16. Kwok, T.Y., Yeung, D.Y.: Objective functions for training new hidden units in constructive neural networks. IEEE Trans. Neural Network 8(5), 1131–1148 (1997)

    Article  Google Scholar 

  17. Goldberg, D.E.: Genetic Algorithms in search, optimization and machine learning (2004)

    Google Scholar 

  18. Mitchell, T.M.: Machine learning. McGraw-Hill, New York (1997)

    MATH  Google Scholar 

  19. Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  20. Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases, Dept. of Information and Computer Sciences, University of California, Irvine (1998)

    Google Scholar 

  21. Rumelhart, D.E., McClelland, J.: Parallel distributed processing. MIT Press, Cambridge (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kabir, M.M., Shahjahan, M., Murase, K. (2009). An Efficient Feature Selection Using Ant Colony Optimization Algorithm. In: Leung, C.S., Lee, M., Chan, J.H. (eds) Neural Information Processing. ICONIP 2009. Lecture Notes in Computer Science, vol 5864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10684-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10684-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10682-8

  • Online ISBN: 978-3-642-10684-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics