Skip to main content
SpringerLink
Log in

Basic Algorithms and Tools for Rough Non-deterministic Information Analysis

  • Conference paper
Book cover Transactions on Rough Sets I

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 3100))

Abstract

Roughnon-deterministicinformation analysis is a framework for handling the rough sets based concepts, which are defined in not only DISs (DeterministicInformation Systems) but also NISs (Non-deterministicInformation Systems), on computers. NISs were proposed for dealing with information incompleteness in DISs. In this paper, two modalities, i.e., the certainty and the possibility, are defined for each concept like the definability of a set, the consistency of an object, data dependency, rule generation, reduction of attributes, criterion of rules support, accuracy and coverage. Then, each algorithm for computing two modalities is investigated. An important problem is how to compute two modalities depending upon all derived DISs. A simple method, such that two modalities are sequentially computed in all derived DISs, is not suitable. Because the number of all derived DISs increases in exponential order. This problem is uniformly solved by means of applying either inf and sup information or possibleequivalence relations. An information analysis tool for NISs is also presented.

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

    MATH  Google Scholar 

  2. Pawlak, Z.: New Look on Bayes’ Theorem - The Rough Set Outlook. Bulletin of Int’l. Rough Set Society 5, 1–8 (2001)

    Google Scholar 

  3. Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough Sets: A Tutorial. In: Rough Fuzzy Hybridization, pp. 3–98. Springer, Heidelberg (1999)

    Google Scholar 

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

    Google Scholar 

  5. Polkowski, L., Skowron, A. (eds.): Rough Sets in Knowledge Discovery 1. Studies in Fuzziness and Soft Computing. Physica-Verlag, Heidelberg (1998)

    MATH  Google Scholar 

  6. Polkowski, L., Skowron, A. (eds.): Rough Sets in Knowledge Discovery 2. Studies in Fuzziness and Soft Computing, vol. 19. Physica-Verlag, Heidelberg (1998)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  8. Ziarko, W.: Variable Precision Rough Set Model. Journal of Computer and System Sciences 46, 39–59 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Tsumoto, S.: Knowledge Discovery in Clinical Databases and Evaluation of Discovered Knowledge in Outpatient Clinic. Information Sciences 124, 125–137 (2000)

    Article  Google Scholar 

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

    Google Scholar 

  11. Rough Set Software. Bulletin of Int’l. Rough Set Society 2, 15–46 (1998)

    Google Scholar 

  12. Codd, E.: A Relational Model of Data for Large Shared Data Banks. Communication of the ACM 13, 377–387 (1970)

    Article  MATH  Google Scholar 

  13. Orłowska, E., Pawlak, Z.: Representation of Nondeterministic Information. Theoretical Computer Science 29, 27–39 (1984)

    Article  MathSciNet  Google Scholar 

  14. Orłowska, E.: What You Always Wanted to Know about Rough Sets. In: Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing, vol. 13, pp. 1–20. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  15. Lipski, W.: On Semantic Issues Connected with Incomplete Information Databases. ACM Transaction on Database Systems 4, 262–296 (1979)

    Article  Google Scholar 

  16. Lipski, W.: On Databases with Incomplete Information. Journal of the ACM 28, 41–70 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  17. Nakamura, A.: A Rough Logic based on Incomplete Information and Its Application. Int’l. Journal of Approximate Reasoning 15, 367–378 (1996)

    Article  MATH  Google Scholar 

  18. Grzymala-Busse, J.: On the Unknown Attribute Values in Learning from Examples. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1991. LNCS, vol. 542, pp. 368–377. Springer, Heidelberg (1991)

    Google Scholar 

  19. Grzymala-Busse, J., Werbrouck, P.: On the Best Search Method in the LEM1 and LEM2 Algorithms. In: Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing, vol. 13, pp. 75–91. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  20. Kryszkiewicz, M.: Properties of Incomplete Information Systems in the Framework of Rough Sets. In: Rough Sets in Knowledge Discovery 1. Studies in Fuzziness and Soft Computing, vol. 18, pp. 442–450. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  21. Kryszkiewicz, M.: Rough Set Approach to Incomplete Information Systems. Information Sciences 112, 39–49 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  22. Kryszkiewicz, M.: Rules in Incomplete Information Systems. Information Sciences 113, 271–292 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  23. Sakai, H.: Effective Procedures for Data Dependencies in Information Systems. In: Rough Set Theory and Granular Computing. Studies in Fuzziness and Soft Computing, vol. 125, pp. 167–176. Springer, Heidelberg (2003)

    Google Scholar 

  24. Sakai, H., Okuma, A.: An Algorithm for Finding Equivalence Relations from Tables with Non-deterministic Information. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 64–72. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  25. Sakai, H.: Effective Procedures for Handling Possible Equivalence Relations in Nondeterministic Information Systems. Fundamenta Informaticae 48, 343–362 (2001)

    MathSciNet  Google Scholar 

  26. Sakai, H., Okuma, A.: An Algorithm for Checking Dependencies of Attributes in a Table with Non-deterministic Information: A Rough Sets based Approach. In: Mizoguchi, R., Slaney, J.K. (eds.) PRICAI 2000. LNCS, vol. 1886, pp. 219–229. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  27. Sakai, H.: A Framework of Rough Sets based Rule Generation in Non-deterministic Information Systems. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 143–151. Springer, Heidelberg (2003)

    Chapter  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. Department of Electrical and Computer Engineering, University of Manitoba, R3T 5V6, Winnipeg, Manitoba, Canada

    James F. Peters

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

    Andrzej Skowron  & Marcin S. Szczuka  & 

  3. Institute of Computer Science, Polish Academy of Sciences, 01–237, Warsaw, Poland

    Jerzy W. Grzymała-Busse

  4. Multimedia Systems Department, Gdańsk University of Technology, Narutowicza 11/12, 80-952, Gdańsk, Poland

    Bożena Kostek

  5. Department of Mathematical and Computer Sciences, San Diego State University, 5500 Campanile Drive, CA 92182, San Diego, USA

    Roman W. Świniarski

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakai, H., Okuma, A. (2004). Basic Algorithms and Tools for Rough Non-deterministic Information Analysis. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B., Świniarski, R.W., Szczuka, M.S. (eds) Transactions on Rough Sets I. Lecture Notes in Computer Science, vol 3100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27794-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27794-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-27794-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation