Skip to main content

A New Rough Sets Model Based on Database Systems

  • Conference paper
  • First Online:

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

Abstract

In this paper we present a new rough sets model based on database systems. We borrow the main ideas of the original rough sets theory and redefine them based on the database theory to take advantage of the very efficient set-oriented database operation. We present a new set of algorithms to calculate core, reduct based on our new database based rough set model. Almost all the operations used in generating core, reduct in our model can be performed using the database set operations such as Count, Projection. Our new rough sets model is designed based on database set operations, compared with the traditional rough set models, ours is very efficient and scalable.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cercone N., Ziarko W., Hu X., Rule Discovery from Databases: A Decision Matrix Approach, Methodologies for Intelligent System, Ras Zbigniew, Zemankova Maria (eds), 1996

    Google Scholar 

  2. Hu, X., Cercone N., Han, J., Ziarko, W, GRS: A Generalized Rough Sets Model, in Data Mining, Rough Sets and Granular Computing, T.Y. Lin, Y.Y. Yao and L. Zadeh (eds), Physica-Verlag

    Google Scholar 

  3. John, G., Kohavi, R., Pfleger, K., Irrelevant Features and the Subset Selection Problem, In Proc. ML-94, 1994

    Google Scholar 

  4. Kira, K.; Rendell, L.A. The feature Selection Problem: Traditional Methods and a New Algorithm, In Proc. AAAI-92

    Google Scholar 

  5. Kumar A., A New Technique for Data Reduction in A Database System for Knowledge Discovery Applications, Journal of Intelligent Systems, 10(3)

    Google Scholar 

  6. Lin T.Y., Yao Y.Y. Zadeh L. (eds), Data Mining, Rough Sets and Granular Computing, Physica-Verlag, 2002

    Google Scholar 

  7. T. Y. Lin, H. Cao, “Searching Decision Rules in Very Large Databases using Rough Set Theory.” In Rough sets and Current Trends in Computing, Ziarko & Yao (eds)

    Google Scholar 

  8. Modrzejewski, M. Feature Selection Using Rough Sets Theory, in Proc. ECML-93

    Google Scholar 

  9. Pawlak Z., Rough Sets, International Journal of Information and Computer Science, 11(5), 1982

    Google Scholar 

  10. Ziarko, W., Variable Precision Rough Set Model, Journal of Computer and System Sciences, Vol. 46, No. 1, 1993

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, X.T., Lin, T.Y., Han, J. (2003). A New Rough Sets Model Based on Database Systems. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2003. Lecture Notes in Computer Science(), vol 2639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39205-X_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-39205-X_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14040-5

  • Online ISBN: 978-3-540-39205-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics