Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Novel Feature Selection Approach by Hybrid Genetic Algorithm

  • Conference paper
PRICAI 2006: Trends in Artificial Intelligence (PRICAI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4099))

Included in the following conference series:

Abstract

Feature selection plays an important role in pattern classification. In this paper, a hybrid genetic algorithm (HGA) is adopted to find a subset of the most relevant features. The approach utilizes an improved estimation of the conditional mutual information as an independent measure for feature ranking in the local search operations. It takes account of not only the relevance of the candidate feature to the output classes but also the redundancy between the candidate feature and the already-selected features. Thus, the ability of the HGA to search for the optimal subset of features has been greatly enhanced. Experimental results on a range of benchmark datasets demonstrate that the proposed method can usually find the excellent subset of features on which high classification accuracy is achieved.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
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.

Similar content being viewed by others

References

  1. Guyon, B.I., Elisseeff, A.: An introduction to variable and feature selection. Journal of Machine Learning Research 3, 1157–1182 (2003)

    Article  MATH  Google Scholar 

  2. Dash, M., Liu, H.: Feature selection for classification. Intelligent Data Analysis 1, 131–156 (1997)

    Article  Google Scholar 

  3. Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artificial Intelligence 97, 273–324 (1997)

    Article  MATH  Google Scholar 

  4. Koller, D., Sahami, M.: Toward optimal feature selection. In: Proceedings of International Conference on Machine Learning, Bari, Italy, pp. 284–292 (1996)

    Google Scholar 

  5. Yu, L., Liu, H.: Efficient Feature Selection via Analysis of Relevance and Redundancy. Journal of Machine Learning Research 5, 1205–1224 (2004)

    MathSciNet  Google Scholar 

  6. Dash, M., Liu, H.: Consistency-based search in feature selection. Artificial Intelligence 151(1-2), 155–176 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. Univ. Illinois Press, Urbana, IL (1949)

    MATH  Google Scholar 

  8. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)

    Book  MATH  Google Scholar 

  9. Last, M., Maimon, O.: A compact and accurate model for classification. IEEE Transactions on Knowledge and Data Engineering 16(2), 203–215 (2004)

    Article  Google Scholar 

  10. Battiti, R.: Using mutual information for selecting features in supervised neural net learning. IEEE Transactions on Neural Networks 5(4), 537–550 (1994)

    Article  Google Scholar 

  11. Kwak, N., Choi, C.H.: Input feature selection for classification problems. IEEE Transactions on Neural Networks 13(1), 143–159 (2002)

    Article  Google Scholar 

  12. Grall-Maes, E., Beauseroy, P.: Mutual information-based feature extraction on the time-frequency plane. IEEE Transactions on Signal Processing 50(4), 779–790 (2002)

    Article  Google Scholar 

  13. Quinlan, J.R.: Improved use of continuous attributes in C4. 5. Journal of Artificial Intelligence Research 4, 77–90 (1996)

    MATH  Google Scholar 

  14. Amaldi, E., Kann, V.: On the approximation of minimizing non zero variables or unsatisfied relations in linear systems. Theoretical Computer Science 209, 237–260 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Somol, P., Pudil, P., Kittler, J.: Fast branch & bound algorithms for optimal feature selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(7), 900–912 (2004)

    Article  Google Scholar 

  16. Baudat, G., Anouar, F.: Feature vector selection and projection using kernels. Neurocomputing 55(1-2), 21–38 (2003)

    Article  Google Scholar 

  17. Bhanu, B., Lin, Y.: Genetic algorithm based feature selection for target detection in SAR images. Image and Vision Computing 21(7), 591–608 (2003)

    Article  Google Scholar 

  18. Il-Seok, O., Lee, J.-S., Moon, B.-R.: Hybrid Genetic Algorithms for Feature Selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(11), 1424–1437 (2004)

    Article  Google Scholar 

  19. Torkkola, K.: Feature Extraction by Non-Parametric Mutual Information Maximization. Journal of Machine Learning Research 3, 1415–1438 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, J., Lv, N., Li, W. (2006). A Novel Feature Selection Approach by Hybrid Genetic Algorithm. In: Yang, Q., Webb, G. (eds) PRICAI 2006: Trends in Artificial Intelligence. PRICAI 2006. Lecture Notes in Computer Science(), vol 4099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36668-3_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-36668-3_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36667-6

  • Online ISBN: 978-3-540-36668-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics