Abstract
As a technique for granular computing, rough sets deal with the vagueness and granularity in information systems. Covering-based rough sets are natural extensions of the classical rough sets by relaxing the partitions to coverings and have been applied for many fields. In this paper, a new type of covering-based rough sets are proposed and the properties of this new type of covering-based rough sets are studied. First, we introduce a concept of inclusion degree into covering-based rough set theory to explore some properties of the new type of covering approximation space. Second, a new type of covering-based rough sets is established based on inclusion degree. Moreover, some properties of the new type of covering-based rough sets are studied. Finally, a simple application of the new type of covering-based rough sets to network security is given.
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
Preview
Unable to display preview. Download preview PDF.
References
Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U.: Extensions and intentions in the rough set theory. Information Sciences 107, 149–167 (1998)
Dai, J., Xu, Q.: Approximations and uncertainty measures in incomplete information systems. Information Sciences 198, 62–80 (2012)
Ge, X.: An application of covering approximation spaces on network security. Computers and Mathematics with Applications 60, 1191–1199 (2010)
Hu, B.Q., Wong, H.: Generalized interval-valued fuzzy rough sets based on interval-valued fuzzy logical operators. International Journal of Fuzzy Systems 15, 381–391 (2013)
Järvinen, J.: On the structure of rough approximations. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 123–130. Springer, Heidelberg (2002)
Kondo, M.: On the structure of generalized rough sets. Information Sciences 176, 589–600 (2006)
Li, X., Liu, S.: Matroidal approaches to rough set theory via closure operators. International Journal of Approximate Reasoning 53, 513–527 (2012)
Liu, G.: Generalized rough sets over fuzzy lattices. Information Sciences 178, 1651–1662 (2008)
Liu, G.: Closures and topological closures in quasi-discrete closure. Applied Mathematics Letters 23, 772–776 (2010)
Ma, Z., Hu, B.: Topological and lattice structures of \(\mathcal{L}\)-fuzzy rough sets determined by lower and upper sets. Information Sciences 218, 194–204 (2013)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Pawlak, Z.: Rough sets: theoretical aspects of reasoning about data. Kluwer Academic Publishers, Boston (1991)
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)
Rajagopal, P., Masone, J.: Discrete mathematics for computer science. Saunders College, Canada (1992)
Wang, C., Chen, D., Sun, B., Hu, Q.: Communication between information systems with covering based rough sets. Information Sciences 216, 17–33 (2012)
Wang, J., Zhu, W.: Applications of matrices to a matroidal structure of rough sets. Journal of Applied Mathematics 2013, article ID 493201, 9 pages (2013)
Wang, S., Zhu, Q., Zhu, W., Min, F.: Matroidal structure of rough sets and its characterization to attribute reduction. Knowledge-Based Systems 35, 155–161 (2012)
Wei, W., Liang, J., Qian, Y.: A comparative study of rough sets for hybrid data. Information Sciences 190, 1–16 (2012)
Yang, B., Zhu, W.: Matroidal structure of generalized rough sets based on symmetric and transitive relations. In: CCECE 2013, pp. 1–5 (2013)
Yang, B., Lin, Z., Zhu, W.: Covering-based rough sets on eulerian matroids. Journal of Applied Mathematics 2013, article ID 254797, 8 pages (2013)
Yao, H., Zhu, W., Wang, F.Y.: Secondary basis unique augmentation matroids and union minimal matroids. International Journal of Machine Learning and Cybernetics (2014), doi:10.1007/s13042–014–0237–1
Yao, Y.: Constructive and algebraic methods of theory of rough sets. Information Sciences 109, 21–47 (1998)
Yao, Y.: Relational interpretations of neighborhood operators and rough set approximation operators. Information Sciences 111, 239–259 (1998)
Zakowski, W.: Approximations in the space (u, π). Demonstratio Mathematica 16, 761–769 (1983)
Zhang, J., Li, T., Ruan, D., Gao, Z., Zhao, C.: A parallel method for computing rough set approximations. Information Sciences 194, 209–223 (2012)
Zhang, Y., Li, J., Wu, W.: On axiomatic characterizations of three pairs of covering based approximation operators. Information Sciences 180, 274–287 (2010)
Zhu, W., Wang, F.: Reduction and axiomization of covering generalized rough sets. Information Sciences 152, 217–230 (2003)
Zhu, W., Wang, F.: On three types of covering rough sets. IEEE Transactions on Knowledge and Data Engineering 19, 1131–1144 (2007)
Zhu, W.: Relationship among basic concepts in covering-based rough sets. Information Sciences 179, 2478–2486 (2009)
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
Yang, B., Zhu, W. (2014). A New Type of Covering-Based Rough Sets. 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_45
Download citation
DOI: https://doi.org/10.1007/978-3-319-11740-9_45
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11739-3
Online ISBN: 978-3-319-11740-9
eBook Packages: Computer ScienceComputer Science (R0)