Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing

RSFDGrC 1999: New Directions in Rough Sets, Data Mining, and Granular-Soft Computing pp 64–72Cite as

An Algorithm for Finding Equivalence Relations from Tables with Non-deterministic Information

  • Conference paper

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

Abstract

Rough sets theory depending upon DIS(Deterministic Information System) is now becoming a mathematical foundation of soft computing. Here, we pick up NIS(Non-deterministic Information System) which is more general system than DIS and we try to develop the rough sets theory depending upon NIS. We first give a definition of definability for every object set X, then we propose an algorithm for checking it. To find an adequate equivalence relation from NIS for X is the most important part in this algorithm, which is like a resolution. According to this algorithm, we implemented some programs by prolog language on the workstation.

This is a preview of subscription content, 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   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. Pawlak, Z.: Rough Sets. Kluwer Academic Publisher, Dordrecht (1991)

    MATH  Google Scholar 

  2. Pawlak, Z.: Data versus Logic A Rough Set View. In: Proc. 4th Int’l. Workshop on Rough Set, Fuzzy Sets and Machine Discovery, pp. 1–8 (1996)

    Google Scholar 

  3. Orlowska, E., Pawlak, Z.: Logical Foundations of Knowledge Representation. Pas Reports, vol. 537 (1984)

    Google Scholar 

  4. Nakamura, A., Tsumoto, S., Tanaka, H., Kobayashi, S.: Rough Set Theory and Its Applications. Journal of Japanese Society for AI 11(2), 209–215 (1996)

    Google Scholar 

  5. Grzymala-Busse, J.: A New Version of the Rule Induction System LERS. Fundamenta Informaticae 31, 27–39 (1997)

    MATH  Google Scholar 

  6. Komorowski, J., Zytkow, J. (eds.): PKDD 1997. LNCS(LNAI), vol. 1263. Springer, Heidelberg (1997)

    Google Scholar 

  7. Ras, Z., Joshi, S.: Query Approximate Answering System for an Incomplete DKBS. Fundamenta Informaticae 30, 313–324 (1997)

    Google Scholar 

  8. Tsumoto, S.: PRIMEROSE, Bulletin of Int’l. Rough Set Society 2(l), 42–43 (1998)

    Google Scholar 

  9. Zhong, N., Dong, J., Fujitsu, S., Ohsuga, S.: Soft Techniques to Rule Discovery in Data. Transactions of Information Processing Society of Japan 39(9), 2581–2592 (1998)

    Google Scholar 

  10. Sakai, H.: Some Issues on Nondeterministic Knowledge Bases with Incomplete and Selective Information. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 424–431. Springer, Heidelberg (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Kyushu Institute of Technology, Tobata, Kitakyushu, 804, Japan

    Hiroshi Sakai & Akimichi Okuma

Authors
  1. Hiroshi Sakai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akimichi Okuma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The International WIC Institute, Beijing University of Technology, China

    Ning Zhong

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

  3. Professor Emeritus, University of Tokyo,  

    Setsuo Ohsuga

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakai, H., Okuma, A. (1999). An Algorithm for Finding Equivalence Relations from Tables with Non-deterministic Information. In: Zhong, N., Skowron, A., Ohsuga, S. (eds) New Directions in Rough Sets, Data Mining, and Granular-Soft Computing. RSFDGrC 1999. Lecture Notes in Computer Science(), vol 1711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48061-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48061-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation