Skip to main content

Applying Rough Sets to Information Tables Containing Probabilistic Values

  • Conference paper

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

Abstract

Rough sets are applied to information tables containing imprecise values that are expressed in a probability distribution. A family of weighted equivalence classes is obtained where each equivalence class is accompanied by the probability to which it is an actual one. By using the family of weighted equivalence classes, we derive lower and upper approximations. The lower and upper approximations coincide with ones obtained from methods of possible worlds. Therefore, the method of weighted equivalence classes is justified. In addition, this method is applied to missing values interpreted probabilistically. Using weighted equivalence classes correctly derives a lower approximation, even in the case where the method of Kryszkiewicz does not derive any lower approximation.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, London, UK (1995)

    MATH  Google Scholar 

  2. Greco, S., Matarazzo, B., Slowinski, R.: Handling Missing Values in Rough Set Analysis of Multi-attribute and Multi-criteria Decision Problem. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) New Directions in Rough Sets, Data Mining, and Granular-Soft Computing. LNCS (LNAI), vol. 1711, pp. 146–157. Springer, Heidelberg (1999)

    Google Scholar 

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

    Google Scholar 

  4. Grzymala-Busse, J.W: Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction, Transactions on Rough Sets I, pp. 78–95 (2004)

    Google Scholar 

  5. Grzymala-Busse, J.W.: Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation, Transactions on Rough Sets IV, pp. 58–68 (2005)

    Google Scholar 

  6. Guan, Y.-Y., Wang, H.-K.: Set-valued Information Systems. Information Sciences 176, 2507–2525 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Imielinski, T., Lipski, W.: Incomplete Information in Relational Databases. Journal of the ACM 31(4), 761–791 (1984)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Kryszkiewicz, M.: Properties of Incomplete Information Systems in the framework of Rough Sets. In: Polkowski, L., Skowron, A. (eds.) Rough Set in Knowledge Discovery 1: Methodology and Applications. Studies in Fuzziness and Soft Computing, vol. 18, pp. 422–450. Physica Verlag, Heidelberg (1998)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Latkowski, R.: On Decomposition for Incomplete Data. Fundamenta Informaticae 54, 1–16 (2003)

    MATH  MathSciNet  Google Scholar 

  12. Leung, Y., Li, D.: Maximum Consistent Techniques for Rule Acquisition in Incomplete Information Systems. Information Sciences 153, 85–106 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Nakata, N., Sakai, H.: Rough-set-based approaches to data containing incomplete information: possibility-based cases, pp. 234–241. IOS Press, Amsterdam, Trento, Italy (2005)

    Google Scholar 

  14. Nakata, N., Sakai, H.: Checking Whether or Not Rough-Set-Based Methods to Incomplete Data Satisfy a Correctness Criterion. In: Torra, V., Narukawa, Y., Miyamoto, S. (eds.) MDAI 2005. LNCS (LNAI), vol. 3558, pp. 227–239. Springer, Heidelberg (2005)

    Google Scholar 

  15. Nakata, N., Sakai, H.: Rough Sets Handling Missing Values Probabilistically Interpreted. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 325–334. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Nakata, N., Sakai, H.: Lower and Upper Approximations in Data Tables Containing Possibilistic Information, Transactions on Rough Sets VII, 170–189 (2007)

    Google Scholar 

  17. Orłowska, E., Pawlak, Z.: Representation of Nondeterministic Information. Theoretical Computer Science 29, 313–324 (1984)

    Google Scholar 

  18. Parsons, S.: Current Approaches to Handling Imperfect Information in Data and Knowledge Bases. IEEE Transactions on Knowledge and Data Engineering 8(3), 353–372 (1996)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  20. Sakai, H.: Effective Procedures for Handling Possible Equivalence Relation in Non-deterministic Information Systems. Fundamenta Informaticae 48, 343–362 (2001)

    MathSciNet  Google Scholar 

  21. Sakai, H., Nakata, M.: An Application of Discernibility Functions to Generating Minimal Rules in Non-deterministic Information Systems. Journal of Advanced Computational Intelligence and Intelligent Informatics 10, 695–702 (2006)

    Google Scholar 

  22. Sakai, H., Okuma, A.: Basic Algorithms and Tools for Rough Non-deterministic Information Systems, Transactions on Rough Sets I, pp. 209–231 (2004)

    Google Scholar 

  23. Słowiński, R., Stefanowski, J.: Rough Classification in Incomplete Information Systems. Mathematical and Computer Modelling 12(10/11), 1347–1357 (1989)

    Article  Google Scholar 

  24. Stefanowski, J., Tsoukiàs, A.: On the Extension of Rough Sets under Incomplete Information. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) New Directions in Rough Sets, Data Mining, and Granular-Soft Computing. LNCS (LNAI), vol. 1711, pp. 212–219. Springer, Heidelberg (1999)

    Google Scholar 

  25. Stefanowski, J., Tsoukiàs, A.: Incomplete Information Tables and Rough Classification. Computational Intelligence 17(3), 545–566 (2001)

    Article  Google Scholar 

  26. Ziarko, W.: Probabilistic Rough Sets. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 283–293. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  27. Ziarko, W.: Stochastic Approach to Rough Set Theory. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 38–48. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  28. Zimányi, E., Pirotte, A.: Imperfect Information in Relational Databases. In: Motro, A., Smets, P. (eds.) Uncertainty Management in Information Systems: From Needs to Solutions, pp. 35–87. Kluwer Academic Publishers, Boston, MA (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Vicenç Torra Yasuo Narukawa Yuji Yoshida

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nakata, M., Sakai, H. (2007). Applying Rough Sets to Information Tables Containing Probabilistic Values . In: Torra, V., Narukawa, Y., Yoshida, Y. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2007. Lecture Notes in Computer Science(), vol 4617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73729-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73729-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-73729-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics