Abstract
Rough sets and rule induction in an incomplete and continuous information table are investigated under possible world semantics. We show an approach using possible indiscernibility relations, whereas the traditional approaches use possible tables. This is because the number of possible indiscernibility relations is finite, although we have the infinite number of possible tables in an incomplete and continuous information table. First, lower and upper approximations are derived directly using the indiscernibility relation on a set of attributes in a complete and continuous information table. Second, how these approximations are derived are described applying possible world semantics to an incomplete and continuous information table. Lots of possible indiscernibility relations are obtained. The actual indiscernibility relation is one of possible ones. The family of possible indiscernibility relations is a lattice for inclusion with the minimum and the maximum indiscernibility relations. Under the minimum and the maximum indiscernibility relations, we obtain four kinds of approximations: certain lower, certain upper, possible lower, and possible upper approximations. Therefore, there is no computational complexity for the number of values with incomplete information. The approximations in possible world semantics are the same as ones in our extended approach directly using indiscernibility relations. We obtain four kinds of single rules: certain and consistent, certain and inconsistent, possible and consistent, and possible and inconsistent ones from certain lower, certain upper, possible lower, and possible upper approximations, respectively. Individual objects in an approximation support single rules. Serial single rules from the approximation are brought into one combined rule. The combined rule has greater applicability than single rules that individual objects support.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
See reference [16] for an approach using possible classes.
- 2.
\(R_{A}\) is formally \(R_{A}^{\delta _{A}}\). \(\delta _{A}\) is omitted unless confusion.
- 3.
Subscript a of \(\delta _{a}\) is omitted if no confusion.
- 4.
Hu and Yao also say that approximations are described by using an interval set in information tables with incomplete information [5].
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley Publishing Company (1995)
Bosc, P., Duval, L., Pivert, O.: An initial approach to the evaluation of possibilistic queries addressed to possibilistic databases. Fuzzy Sets and Syst. 140, 151–166 (2003)
Grahne, G.: The problem of incomplete information in relational databases. Lect. Notes Comput. Sci. 554 (1991)
Grzymala-Busse, J.W.: Mining numerical data a rough set approach. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets XI. LNCS, vol. 5946, pp. 1–13. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11479-3_1
Hu, M.J., Yao, Y.Y.: Rough set approximations in an incomplete information table. In: Polkowski, L., Yao, Y., Artiemjew, P., Ciucci, D., Liu, D., Ślȩzak, D., Zielosko, B. (eds.) IJCRS 2017. LNCS (LNAI), vol. 10314, pp. 200–215. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-60840-2_14
Imielinski, T., Lipski, W.: Incomplete information in relational databases. J. ACM 31, 761–791 (1984)
Jing, S., She, K., Ali, S.: A universal neighborhood rough sets model for knowledge discovering from incomplete heterogeneous data. Expert Syst. 30(1), 89–96 (2013). https://doi.org/10.1111/j.1468-0394.2012.00633_x
Kryszkiewicz, M.: Rules in incomplete information systems. Inf. Sci. 113, 271–292 (1999)
Libkin, L., Wong, L.: Semantic representations and query languages for or-sets. J. Comput. Syst. Sci. 52, 125–142 (1996)
Lin, T.Y.: Neighborhood systems: a qualitative theory for fuzzy and rough sets. In: Wang, P. (ed.) Advances in Machine Intelligence and Soft Computing, vol. IV, pp. 132–155. Duke University (1997)
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). https://doi.org/10.1109/ISMVL.2009.1
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
Nakata, M., Sakai, H.: Describing rough approximations by indiscernibility relations in information tables with incomplete information. In: Carvalho, J.P., Lesot, M.-J., Kaymak, U., Vieira, S., Bouchon-Meunier, B., Yager, R.R. (eds.) IPMU 2016, Part II. CCIS, vol. 611, pp. 355–366. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40581-0_29
Nakata, M., Sakai, H., Hara, K.: Rules induced from rough sets in information tables with continuous values. In: Medina, J., Ojeda-Aciego, M., Verdegay, J.L., Pelta, D.A., Cabrera, I.P., Bouchon-Meunier, B., Yager, R.R. (eds.) IPMU 2018, Part II. CCIS, vol. 854, pp. 490–502. Springer Cham (2018). https://doi.org/10.1007/978-3-319-91476-3_41
Nakata, M., Sakai, H., Hara, K.: Rule induction based on indiscernible classes from rough sets in information tables with continuous Values. In: Nguyen, H.S., et al. (eds.) IJCRS 2018, LNAI 11103, pp. 323-336. Springer (2018). https://doi.org/10.1007/978-3-319-99368-3_25
Nakata, M., Sakai, H., Hara, K.: Rough sets based on possibly indiscernible Classes in Incomplete Information Tables with Continuous Values. In: Hassanien, A.B., et al. (eds.) Proceedings of the International Conference on Advanced Intelligent Systems and Informatics 2019, Advances in Intelligent Systems and Computing 1058, pp. 13–23. Springer (2019). https://doi.org/10.1007/978-3-030-31129-2_2
Paredaens, J., De Bra, P., Gyssens, M., Van Gucht, D.: The Structure of the Relational Database Model. Springer-Verlag (1989)
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
Stefanowski, J., Tsoukià s, A.: Incomplete information tables and rough classification. Comput. Intell. 17, 545–566 (2001)
Yang, X., Zhang, M., Dou, H., Yang, Y.: Neighborhood systems-based rough sets in incomplete information system. Inf. Sci. 24, 858–867 (2011). https://doi.org/10.1016/j.knosys.2011.03.007
Zenga, A., Lia, T., Liuc, D., Zhanga, J., Chena, H.: A fuzzy rough set approach for incremental feature selection on hybrid information systems. Fuzzy Sets Syst. 258, 39–60 (2015). https://doi.org/10.1016/j.fss.2014.08.014
Zhao, B., Chen, X., Zeng, Q.: Incomplete hybrid attributes reduction based on neighborhood granulation and approximation. In: 2009 International Conference on Mechatronics and Automation, pp. 2066–2071. IEEE Press (2009)
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 (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Nakata, M., Sakai, H., Hara, K. (2021). Rough Sets and Rule Induction from Indiscernibility Relations Based on Possible World Semantics in Incomplete Information Systems with Continuous Domains. In: Hassanien, A.E., Darwish, A. (eds) Machine Learning and Big Data Analytics Paradigms: Analysis, Applications and Challenges. Studies in Big Data, vol 77. Springer, Cham. https://doi.org/10.1007/978-3-030-59338-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-59338-4_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59337-7
Online ISBN: 978-3-030-59338-4
eBook Packages: Computer ScienceComputer Science (R0)