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

Feature Selection Using Rough Sets

  • Chapter
Multi-Objective Machine Learning

Part of the book series: Studies in Computational Intelligence ((SCI,volume 16))

Abstract

Feature selection refers to the selection of input attributes that are most predictive of a given outcome. This is a problem encountered in many areas such as machine learning, signal processing, and recently bioinformatics/computational biology. Feature selection is one of the most important and challenging tasks, when it comes to dealing with large datasets with tens or hundreds of thousands of variables. Areas of web-mining and gene expression array analysis provide examples, where selection of interesting and useful features determines the performance of subsequent analysis. The intrinsic nature of noise, uncertainty, incompleteness of data makes extraction of hidden and useful information very difficult. Capability of handling imprecision, inexactness and noise, has attracted researchers to use rough sets for feature selection. This article provides an overview on recent literature in this direction.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. A. Anand. Representation and learning of inexact information using rough set theory. Master's thesis, Department of Mathematics, Indian Institute of Technology, Kanpur, India, 2002.

    Google Scholar 

  2. M. Banerjee, S. Mitra, and H. Banka. Evolutionary-rough feature selection in gene expression data. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 2005. Accepted.

    Google Scholar 

  3. A. T. Bjorvand. ‘Rough Enough’ – A system supporting the rough sets approach. In Proceedings of the Sixth Scandinavian Conference on Artificial Intelligence, pages 290–291, Helsinki, Finland, 1997.

    Google Scholar 

  4. L. Cao, H. P. Lee, C. K. Seng, and Q. Gu. Saliency analysis of support vector machines for gene selection in tissue classification. Neural Computing and Applications, 11:244–249, 2003.

    Article  MATH  Google Scholar 

  5. V. Chankong and Y. Y. Haimes. Multiobjective Decision Making Theory and Methodology. North-Holland, 1983.

    Google Scholar 

  6. F. Chu, W. Xie, and L. Wang. Gene selection and cancer classification using a fuzzy neural network. In Proceedings of 2004 Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS 2004), volume 2, pages 555–559, 2004.

    Google Scholar 

  7. K. Deb. Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, London, 2001.

    MATH  Google Scholar 

  8. K. Deb, S. Agarwal, A. Pratap, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6:182–197, 2002.

    Article  Google Scholar 

  9. D.E. Goldberg. Genetic Algorithms for Search, Optimization, and Machine Learning. Addison-Wesley, Reading, 1989.

    Google Scholar 

  10. C. -J. Huang. Class prediction of cancer using probabilistic neural networks and relative correlation metric. Applied Artificial Intelligence, 18:117–128, 2004.

    Article  Google Scholar 

  11. R. Jensen. Combining rough and fuzzy sets for feature selection. PhD thesis, School of Informatics, University of Edinburgh, 2004.

    Google Scholar 

  12. J. Komorowski, A. Øhrn, and A. Skowron. The rosetta rough set software system. In W. Klasgen and J. Zytkow, editors, Handbook of Data Mining and Knowledge Discovery, chapter D.2.3. Oxford University Press, 2002.

    Google Scholar 

  13. Z. Pawlak. Rough sets. International J. Comp & Inf. Sc., 1982.

    Google Scholar 

  14. Z. Pawlak. Rough Sets, Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, 1991.

    MATH  Google Scholar 

  15. A. Skowron and C. Rauszer. The discernibility matrices and functions in information systems. In R. Slowinski, editor, Handbook of Applications and Advances of the Rough Set Theory, pages 331–362. Kluwer Academic Publishers, Dordrecht, 1992.

    Google Scholar 

  16. S. Vinterbo and A. Øhrn. Minimal approximate hitting sets and rule templates. International Journal of Approximate Reasoning, pages 123–143, 2000.

    Google Scholar 

  17. J. Wroblewski. Finding minimal reducts using genetic algorithms. In Second Annual Joint Conference on Information Sciences, pages 186–189, 1995.

    Google Scholar 

  18. L. Yu and H. Liu. Efficient feature selection via analysis of relevance and redundancy. Journal of Machine Learning Research, 5:1205–1224, 2004.

    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

About this chapter

Cite this chapter

Banerjee, M., Mitra, S., Anand, A. (2006). Feature Selection Using Rough Sets. In: Jin, Y. (eds) Multi-Objective Machine Learning. Studies in Computational Intelligence, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33019-4_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-33019-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30676-4

  • Online ISBN: 978-3-540-33019-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics