Skip to main content

A New Discernibility Matrix and Function

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2006)

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

Included in the following conference series:

Abstract

In the paper, we define a new discernibility matrix and function between two decision tables. They are extension of Hu’s improved discernibility matrix and function such that the reducts and the cores of decision tables could be calculated by parts of them. The method of new discernibility matrix and function may be applied to the cases of large amount of data and incremental data.

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. Pawlak, Z.: Rough sets-Theoretical Aspect of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    Google Scholar 

  2. Skowron, A.: Rough Sets in KDD. In: Special Invited Speaking, WCC2000 in Beijing (August 2000)

    Google Scholar 

  3. Bazan, G.J.: A Comparison of Dynamic Non-dynamic Rough Set Methods for Extracting Laws from Decision Tables. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1:Methodology and Applications, pp. 321–365. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  4. Bazan, G.J., Nguyen, H.S., Nguyen, S.H., Synak, P., Wroblewski, J.: Rough Set Algorithms in Classification Problem. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications, pp. 49–88. Physica-Verlag (2000)

    Google Scholar 

  5. Liu, Q.: Rough Sets and Rough Reasoning (in Chinese). Science Press (2001)

    Google Scholar 

  6. Ye, D.: A New Discernibility Matrix and the Computation of a Core. Acta Electronica Sinica (in Chinese) 7, 1086–1088 (2002)

    Google Scholar 

  7. Wang, G.: Calculation Methods for Core Attributes of Decision Table. Chinese Journal of Computers (in Chinese) 5, 611–615 (2003)

    Google Scholar 

  8. Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: Slowiski, R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, pp. 311–362. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  9. Hu, X., Cercone, N.: Learning in Relational Databases: a Rough Set Approach. Computational Intelligence 2, 323–337 (1995)

    Article  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-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deng, D., Huang, H. (2006). A New Discernibility Matrix and Function. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_17

Download citation

  • DOI: https://doi.org/10.1007/11795131_17

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-36299-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics