Skip to main content

Information and Rough Set Theory Based Feature Selection Techniques

  • Conference paper
Active Media Technology (AMT 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8210))

Included in the following conference series:

  • 1150 Accesses

Abstract

Feature selection is a well known and studied technique that aims to solve “the curse of dimensionality” and improve performance by removing irrelevant and redundant features. This paper highlights some well known approaches to filter feature selection, information theory and rough set theory, and compares a recent fitness function with some traditional methods. The contributions of this paper are two-fold. First, new results confirm previous research and show that the recent fitness function can also perform favorably when compared to rough set theory. Secondly, the measure of redundancy that is used in traditional information theory is shown to damage the performance when a similar approach is applied to the recent fitness function.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157–1182 (2003)

    MATH  Google Scholar 

  2. Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artif. Intell. 97(1-2), 273–324 (1997)

    Article  MATH  Google Scholar 

  3. Peng, H.P.H., Long, F.L.F., Ding, C.: Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(8), 1226–1238 (2005)

    Article  Google Scholar 

  4. Zhong, N., Dong, J., Ohsuga, S.: Using rough sets with heuristics for feature selection. J. Intell. Inf. Syst. 16(3), 199–214 (2001)

    Article  MATH  Google Scholar 

  5. Cervante, L., Bing, X., Zhang, M.: Binary particle swarm optimisation for feature selection: A filter based approach. In: Proceedings of 2012 IEEE Congress on Evolutionary Computation, pp. 881–888. IEEE Press (2012)

    Google Scholar 

  6. Shannon, C.E., Weaver, W.: A Mathematical Theory of Communication. University of Illinois Press, Champaign (1963)

    Google Scholar 

  7. Pawlak, Z.: Rough sets. International Journal of Parallel Programming 11, 341–356 (1982), 10.1007/BF01001956

    Google Scholar 

  8. Yao, Y.: Probabilistic rough set approximations. Int. J. Approx. Reasoning 49(2), 255–271 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Cervante, L., Gao, X. (2013). Information and Rough Set Theory Based Feature Selection Techniques. In: Yoshida, T., Kou, G., Skowron, A., Cao, J., Hacid, H., Zhong, N. (eds) Active Media Technology. AMT 2013. Lecture Notes in Computer Science, vol 8210. Springer, Cham. https://doi.org/10.1007/978-3-319-02750-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02750-0_17

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02749-4

  • Online ISBN: 978-3-319-02750-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics