Skip to main content
SpringerLink
Log in

A New Computation Model for Rough Set Theory Based on Database Systems

  • Conference paper
Data Warehousing and Knowledge Discovery (DaWaK 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2737))

Included in the following conference series:

Abstract

We propose a new computation model for rough set theory using relational algebra operations in this paper. We present the necessary and sufficient conditions on data tables under which an attribute is a core attribute and those under which a subset of condition attributes is a reduct, respectively. With this model, two algorithms for core attributes computation and reduct generation are suggested. The correctness of both algorithms is proved and their time complexity is analyzed. Since relational algebra operations have been efficiently implemented in most widely-used database systems, the algorithms presented can be extensively applied to these database systems and adapted to a wide range of real-life applications with very large data sets.

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

Access this chapter

Log in via an institution
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. Bell, D., Guan, J.: Computational methods for rough classification and discovery. J. of ASIS 49(5), 403–414 (1998)

    Google Scholar 

  2. Cercone, N., Ziarko, W., Hu, X.: Rule Discovery from Databases: A Decision Matrix Approach. In: Proc. Int’l Sym. on Methodologies for Intelligent System (1996)

    Google Scholar 

  3. Deogun, J., Choubey, S., Taghavan, V., Sever, H.: Feature selection and effective classifiers. J. of ASIS 49(5), 423–434 (1998)

    Google Scholar 

  4. Hu, X., Lin, T.Y., Han, J.: A New Rough Sets Model Based on Database Systems. In: Proc. of the 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (2003)

    Google Scholar 

  5. Garcia-Molina, H., Ullman, J.D., Widom, J.: Database System Implementation. Prentice Hall, Englewood Cliffs (2000)

    Google Scholar 

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

    Google Scholar 

  7. Lin, T.Y., Cercone, N.: Applications of Rough Sets Theory and Data Mining. Kluwer Academic Publishers, Dordrecht (1997)

    Google Scholar 

  8. Lin, T.Y., Yao, Y.Y., Zadeh, L.A.: Data Mining, Rough Sets and Granular Computing. Physical-Verlag, Heidelberg (2002)

    MATH  Google Scholar 

  9. Modrzejewski, M.: Feature Selection Using Rough Sets Theory. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 213–226. Springer, Heidelberg (1993)

    Google Scholar 

  10. Pawlak, Z.: Rough Sets. International Journal of Information and Computer Science 11(5), 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, California State University Dominguez, Hills 1000 E. Victoria St., Carson, CA, 90747, USA

    Jianchao Han

  2. College of Information Science and Technology, Drexel University, 3141 Chestnut St., Philadelphia, PA, 19104, USA

    Xiaohua Hu

  3. Dept. of Computer Science, San Jose State University, One Washington Square, San Jose, CA, 94403, USA

    T. Y. Lin

Authors
  1. Jianchao Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaohua Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. Y. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo, 606-8501, Kyoto, Japan

    Yahiko Kambayashi

  2. I.B.M. India Research Lab, India

    Mukesh Mohania

  3. Institute for Application Oriented Knowledge Processing (FAW), Johannes Kepler University Linz, Austria

    Wolfram Wöß

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, J., Hu, X., Lin, T.Y. (2003). A New Computation Model for Rough Set Theory Based on Database Systems. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2003. Lecture Notes in Computer Science, vol 2737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45228-7_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45228-7_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40807-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation