Abstract
As one of three basic theories of granular computing, rough set theory provides a useful tool for dealing with the granularity in information systems. Covering-based rough set theory is a generalization of this theory for handling covering data, which frequently appear in set-valued information systems. In this paper, we propose a covering in terms of attribute sets in a set-valued information system and study its responding three types of covering approximations. Moreover, we show that the covering approximation operators induced by indiscernible neighborhoods and neighborhoods are equal to the approximation operators induced by the tolerance and similarity relations, respectively. Meanwhile, the covering approximation operators induced by complementary neighborhoods are equal to the approximation operators induced by the inverse of the similarity relation. Finally, by introducing the concept of relational matrices, the relationships of these approximation operators are equivalently represented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Pawlak, Z.: Rough classification. International Journal of Man-Machine Studies 20, 469–483 (1984)
Orlowska, E., Pawlak, Z.: Representation of nondeterministic information. Theoretical Computer Science 29, 27–39 (1984)
Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)
Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Transactions on Knowledge and Data Engineering 12, 331–336 (2000)
Liu, G., Zhu, W.: The algebraic structures of generalized rough set theory. Information Sciences 178, 4105–4113 (2008)
Yao, Y.Y.: On generalizing pawlak approximation operators. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 298–307. Springer, Heidelberg (1998)
Yao, Y.: Constructive and algebraic methods of theory of rough sets. Information Sciences 109, 21–47 (1998)
Li, T., Zhang, W.: Rough fuzzy approximations on two universes of discourse. Information Sciences 178, 892–906 (2008)
Deng, T., Chen, Y., Xu, W., Dai, Q.: A novel approach to fuzzy rough sets based on a fuzzy covering. Information Sciences 177, 2308–2326 (2007)
Zakowski, W.: Approximations in the space (u, π). Demonstratio Mathematica 16, 761–769 (1983)
Bryniarski, E.: A calculus of rough sets of the first order. Bulletin of the Polish Academy of Sciences 36, 71–77 (1989)
Bonikowski, Z.: Algebraic structures of rough sets. In: Ziarko, W. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, Springer, pp. 243–247. Springer, Heidelberg (1994)
Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U.: Extensions and intentions in the rough set theory. Information Sciences 107, 149–167 (1998)
Zhu, W.: Relationship among basic concepts in covering-based rough sets. Information Sciences 179, 2478–2486 (2009)
Zhu, W., Wang, F.: Reduction and axiomization of covering generalized rough sets. Information Sciences 152, 217–230 (2003)
Qin, K., Gao, Y., Pei, Z.: On covering rough sets. In: Yao, J., Lingras, P., Wu, W.-Z., Szczuka, M.S., Cercone, N.J., Ślęzak, D. (eds.) RSKT 2007. LNCS (LNAI), vol. 4481, pp. 34–41. Springer, Heidelberg (2007)
Zhang, W., Ma, J., Fan, S.: Variable threshold concept lattices. Information Sciences 177, 4883–4892 (2007)
Guan, Y., Wang, H.: Set-valued information systems. Information Sciences 176, 2507–2525 (2006)
Qian, Y., Dang, C., Liang, J., Tang, D.: Set-valued ordered information systems. Information Sciences 179, 2809–2832 (2009)
Zhu, W.: Relationship between generalized rough sets based on binary relation and covering. Information Sciences 179, 210–225 (2009)
Ma, L.: On some types of neighborhood-related covering rough sets. International Journal of Approximate Reasoning 53, 901–911 (2012)
Pomykala, J.A.: Approximation operations in approximation space. Bulletin of the Polish Academy of Sciences 35, 653–662 (1987)
Zhang, W.: Incomplete information system and its optimal selections. Computers & Mathematics with Applications 48, 691–698 (2004)
Zhang, W., Yao, Y., Liang, Y.: Rough set and concept lattice. **’an Jiaotong University Press (2006)
Wang, S., Zhu, W., Zhu, Q., Min, F.: Characteristic matrix of covering and its application to boolean matrix decomposition. Information Sciences 263, 186–197 (2014)
Liu, G.: The axiomatization of the rough set upper approximation operations. Fundamenta Informaticae 69, 331–342 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhu, Y., Zhu, W. (2014). Covering Approximations in Set-Valued Information Systems. In: Miao, D., Pedrycz, W., Ślȩzak, D., Peters, G., Hu, Q., Wang, R. (eds) Rough Sets and Knowledge Technology. RSKT 2014. Lecture Notes in Computer Science(), vol 8818. Springer, Cham. https://doi.org/10.1007/978-3-319-11740-9_61
Download citation
DOI: https://doi.org/10.1007/978-3-319-11740-9_61
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11739-3
Online ISBN: 978-3-319-11740-9
eBook Packages: Computer ScienceComputer Science (R0)