Skip to main content

Kryszkiewicz’s Relation for Indiscernibility of Objects in Data Tables Containing Missing Values

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2023)

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

Included in the following conference series:

  • 187 Accesses

Abstract

We check Kryszkiewicz’s approach for rough sets in data tables containing missing values in terms of Lipski’s approach based on possible world semantics. The relation for indiscernibility of objects used by Kryszkiewicz, which most authors use, derives a pair of lower and upper approximations as the actual approximations to a target set. This means that Kryszkiewicz’s approach is accompanied by information loss because what Lipski’s approach derives is the lower and upper bounds of the actual approximations. It is clarified that Kryszkiewicz’s relation for indiscernibility is equal to the union of possible indiscernibility relations in Lipski’s approach. As a result, the lower and the upper approximation derived from Kryszkiewicz’s relation are equal to the lower bound of the actual lower approximation and the upper bound of the actual upper approximation, respectively. Bridging the gap between the two approaches, we propose another relation for indiscernibility that is equal to the intersection of possible indiscernibility relations. By using Kryszkiewicz’s relation and the proposed relation, Kryszkiewicz’s approach can derive the same approximations as Lipski’s one. Therefore, we can keep using Kryszkiewicz’s approach without information loss.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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

References

  1. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991). https://doi.org/10.1007/978-94-011-3534-4

    Book  Google Scholar 

  2. Parsons, S.: Current approaches to handling imperfect information in data and knowledge bases. IEEE Trans. Knowl. Data Eng. 8, 353–372 (1996)

    Article  Google Scholar 

  3. Parsons, S.: Addendum to current approaches to handling imperfect information in data and knowledge bases. IEEE Trans. Knowl. Data Eng. 10, 862 (1998)

    Google Scholar 

  4. Kryszkiewicz, M.: Rough set approach to incomplete information systems. Inf. Sci. 112, 39–49 (1998)

    Article  MathSciNet  Google Scholar 

  5. Kryszkiewicz, M.: Rules in incomplete information systems. Inf. Sci. 113, 271–292 (1999)

    Article  MathSciNet  Google Scholar 

  6. Greco, S., Matarazzo, B., Słowinski, R.: Handling missing values in rough set analysis of multi-attribute and multi-criteria decision problems. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 146–157. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-540-48061-7_19

    Chapter  Google Scholar 

  7. Grzymala-Busse, J.W.: Data with missing attribute values: generalization of indiscernibility relation and rule induction. Trans. Rough Sets I, 78–95 (2004)

    Google Scholar 

  8. Grzymala-Busse, J.W.: Characteristic relations for incomplete data: a generalization of the indiscernibility relation. Trans. Rough Sets IV, 58–68 (2005)

    Google Scholar 

  9. Latkowski, R.: Flexible indiscernibility relations for missing values. Fund. Inf. 67, 131–147 (2005)

    MathSciNet  Google Scholar 

  10. Leung, Y., Li, D.: Maximum consistent techniques for rule acquisition in incomplete information systems. Inf. Sci. 153, 85–106 (2003)

    Article  Google Scholar 

  11. Nakata, M., Sakai, H.: Rough sets handling missing values probabilistically interpreted. In: Ślezak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 325–334. Springer, Heidelberg (2005). https://doi.org/10.1007/11548669_34

  12. Nakata, M., Sakai, H.: Twofold rough approximations under incomplete information. Int. J. Gen Syst 42, 546–571 (2013). https://doi.org/10.1080/17451000.2013.798898

    Article  MathSciNet  Google Scholar 

  13. Sakai, H.: Twofold rough approximations under incomplete information. Fund. Inf. 48, 343–362 (2001)

    Google Scholar 

  14. Stefanowski, J., Tsoukiàs, A.: Incomplete information tables and rough classification. Comput. Intell. 17, 545–566 (2001)

    Article  Google Scholar 

  15. Sun, L., Wanga, L., Ding, W., Qian, Y., Xu, J.: Neighborhood multi-granulation rough sets-based attribute reduction using lebesgue and entropy measures in incomplete neighborhood decision systems. Knowl.-Based Syst. 192, 105373 (2020)

    Article  Google Scholar 

  16. Wang, G.: Extension of rough set under incomplete information systems. In: 2002 IEEE World Congress on Computational Intelligence. IEEE International Conference on Fuzzy Systems. FUZZ-IEEE 2002, pp. 1098–1103 (2002) https://doi.org/10.1109/FUZZ.2002.1006657

  17. Nguyen, D.V., Yamada, K., Unehara, M.: Extended tolerance relation to define a new rough set model in incomplete information systems. Adv. Fuzzy Syst. Article ID 372091, 10 (2013). https://doi.org/10.1155/2013/372091

  18. Rady, E.A., Abd El-Monsef, M.M.E., Adb El-Latif, W.A.: A modified rough sets approach to incomplete information systems. J. Appl. Math. Decis. Sci. Article ID 058248, 13 (2007)

    Google Scholar 

  19. Nakata, M., Sakai, H.: Applying rough sets to information tables containing missing values. In: Proceedings of 39th International Symposium on Multiple-Valued Logic, pp. 286–291. IEEE Press (2009). DOI: https://doi.org/10.1109/ISMVL.2009.1

  20. Yang, T., Li, Q., Zhou, B.: Related family: a new method for attribute reduction of covering information systems. Inf. Sci. 228, 175–191 (2013)

    Article  MathSciNet  Google Scholar 

  21. Lipski, W.: On semantics issues connected with incomplete information databases. ACM Trans. Database Syst. 4, 262–296 (1979)

    Article  Google Scholar 

  22. Nakata, M., Saito, N., Sakai, H., Fujiwara, T.: Structures derived from possible tables in an incomplete information table. In: Proceedings in SCIS 2022, p. 6. IEEE Press (2022) https://doi.org/10.1109/SCISISIS55246.2022.10001919

Download references

Acknowledgment

Part of this work is supported by JSPS KAKENHI Grant Number JP20K11954.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michinori Nakata .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nakata, M., Saito, N., Sakai, H., Fujiwara, T. (2023). Kryszkiewicz’s Relation for Indiscernibility of Objects in Data Tables Containing Missing Values. In: Campagner, A., Urs Lenz, O., Xia, S., Ślęzak, D., Wąs, J., Yao, J. (eds) Rough Sets. IJCRS 2023. Lecture Notes in Computer Science(), vol 14481. Springer, Cham. https://doi.org/10.1007/978-3-031-50959-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-50959-9_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-50958-2

  • Online ISBN: 978-3-031-50959-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics