Skip to main content

Finding Rough Set Reducts with SAT

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2005)

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

Abstract

Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine learning, pattern recognition and signal processing. In particular, solution to this has found successful application in tasks that involve datasets containing huge numbers of features (in the order of tens of thousands), which would be impossible to process further. Recent examples include text processing and web content classification. Rough set theory has been used as such a dataset pre-processor with much success, but current methods are inadequate at finding minimal reductions, the smallest sets of features possible. This paper proposes a technique that considers this problem from a propositional satisfiability perspective. In this framework, minimal subsets can be located and verified. An initial experimental investigation is conducted, comparing the new method with a standard rough set-based feature selector.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bakar, A.A., Sulaiman, M.N., Othman, M., Selamat, M.H.: IP algorithms in compact rough classification modeling. Intelligent Data Analysis 5(5), 419–429 (2001)

    MATH  Google Scholar 

  2. Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases. Irvine, University of California (1998), http://www.ics.uci.edu/~mlearn/

  3. Chouchoulas, A., Shen, Q.: Rough set-aided keyword reduction for text categorisation. Applied Artificial Intelligence 15(9), 843–873 (2001)

    Article  Google Scholar 

  4. Dash, M., Liu, H.: Feature Selection for Classification. Intelligent Data Analysis 1(3), 131–156 (1997)

    Article  Google Scholar 

  5. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5, 394–397 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hoos, H.H., Stützle, T.: Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT. Artificial Intelligence 112, 213–232 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Jensen, R., Shen, Q.: Semantics-Preserving Dimensionality Reduction: Rough and Fuzzy-Rough Based Approaches. IEEE Transactions on Knowledge and Data Engineering 16(12), 1457–1471 (2004)

    Article  Google Scholar 

  8. Kryszkiewicz, M.: Comparative Study of Alternative Types of Knowledge Reduction in Inconsistent Systems. International Journal of Intelligent Systems 16(1), 105–120 (2001)

    Article  MATH  Google Scholar 

  9. Nguyen, H.S., Skowron, A.: Boolean Reasoning for Feature Extraction Problems. In: Proceedings of the 10th International Symposium on Methodologies for Intelligent Systems, pp. 117–126 (1997)

    Google Scholar 

  10. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishing, Dordrecht (1991)

    MATH  Google Scholar 

  11. Polkowski, L.: Rough Sets: Mathematical Foundations. Advances in Soft Computing. Physica, Heidelberg (2002)

    Google Scholar 

  12. Skowron, A., Rauszer, C.: The discernibility matrices and functions in Information Systems. In: Slowinski, R. (ed.) Intelligent Decision Support, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  13. Starzyk, J.A., Nelson, D.E., Sturtz, K.: Reduct Generation in Information Systems. Bulletin of the International Rough Set Society 3(1-2), 19–22 (1999)

    Google Scholar 

  14. Zhang, L., Malik, S.: The Quest for Efficient Boolean Satisfiability Solvers. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 295–313. Springer, Heidelberg (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jensen, R., Shen, Q., Tuson, A. (2005). Finding Rough Set Reducts with SAT. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548669_21

Download citation

  • DOI: https://doi.org/10.1007/11548669_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28653-0

  • Online ISBN: 978-3-540-31825-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics