Skip to main content

Estimating Optimal Feature Subsets Using Mutual Information Feature Selector and Rough Sets

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2009)

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

Included in the following conference series:

Abstract

Mutual Information (MI) is a good selector of relevance between input and output feature and have been used as a measure for ranking features in several feature selection methods. Theses methods cannot estimate optimal feature subsets by themselves, but depend on user defined performance. In this paper, we propose estimation of optimal feature subsets by using rough sets to determine candidate feature subset which receives from MI feature selector. The experiment shows that we can correct nonlinear problems and problems in situation of two or more combined features are dominant features, maintain an improve classification accuracy.

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. Battiti, R.: Using mutual information for selecting features in supervised neural net learning. IEEE Trans. Neural Networks 5 (July 1994)

    Google Scholar 

  2. Kwak, N., Choi, C.-H.: Input Feature Selection for Classification Problems. IEEE Trans. Neural Networks 13(1), 143–159 (2002)

    Article  Google Scholar 

  3. Al-ani, A., Deriche, M.: An optimal feature selection technique using the concept of mutual information. In: Proc. 6th ISSPA, Kuala Lumpar, Malaysia, pp. 477–480 (2001)

    Google Scholar 

  4. Li, W.T.: Mutual information functions versus correlation functions. Stat. Phys. 60(5/6), 823–837 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Principe, J.C., Xu, D., Fisher III, J.: Information theoretic learning. In: Haykin, S. (ed.) Unsupervised Adaptive Filtering, pp. 265–320. Wiley, New York (2000)

    Google Scholar 

  6. Murphy, P.M., Aha, D.W.: UCI Repository of Machine Learning Databases (1994)

    Google Scholar 

  7. Taguchi, G.: Taguchi on Robust Technology Development. Amer. Soc. Mech. Eng., New York (1993)

    Book  Google Scholar 

  8. Pawlaw, Z.: Rough sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishing, Dordrecht (1991)

    Book  Google Scholar 

  9. Fraser, A.M., Swinney, H.L.: Independent coordinates for strange attractors from mutual information. Phys. Rev. A 33(2) (1986)

    Google Scholar 

  10. Katzberg, J., Ziarko, W.: Variable precision rough sets with asymmetric bounds. In: Proc. of the RSKD 1993, Banff, Canada, October 12–15, pp. 163–191 (1993)

    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

Foitong, S., Rojanavasu, P., Attachoo, B., Pinngern, O. (2009). Estimating Optimal Feature Subsets Using Mutual Information Feature Selector and Rough Sets. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, TB. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2009. Lecture Notes in Computer Science(), vol 5476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01307-2_103

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01307-2_103

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01306-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics