The Connectivity of the Covering Approximation Space

  • Duixia MaEmail author
  • William Zhu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9436)


As a covering approximation space, its connectivity directly reflects a relationship, which plays an important role in data mining, among elements on the universe. In this paper, we study the connectivity of a covering approximation space and give its connected component. Especially, we give three methods to judge whether a covering approximation space is connected or not. Firstly, the conception of the maximization of a family of sets is given. Particularly, we find that a covering and its maximization have the same connectivity. Second, we investigate the connectivity of special covering approximation spaces. Finally, we give three methods of judging the connectivity of a covering approximation space from the viewpoint of matrix, graph and a new covering.


Covering approximation space Connectivity Granular computing 



This work is in part supported by The National Nature Science Foundation of China under Grant Nos. 61170128, 61379049 and 61379089, the Key Project of Education Department of Fujian Province under Grant No. JA13192, the Project of Education Department of Fujian Province under Grant No. JA14194, the Zhangzhou Municipal Natural Science Foundation under Grant No. ZZ2013J03, and the Science and Technology Key Project of Fujian Province, China Grant No. 2012H0043.


  1. 1.
    Bollobás, B.: Modern Graph Theory. Springer, New York (1998)CrossRefGoogle Scholar
  2. 2.
    Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U.: Extensions and intentions in the rough set theory. Inf. Sci. 107, 149–167 (1998)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Dubois, D., Prade, H.: Rough fuzzy sets and fuzzy rough sets. Int. J. Gen. Syst. 17, 191–209 (1990)CrossRefGoogle Scholar
  4. 4.
    Gao, S.: Graph Theory and Network Flow Theory. Higher Education Press, Beijing (2009)Google Scholar
  5. 5.
    Ge, X.: Connectivity of covering approximation spaces and its applications on epidemiological issue. Appl. Soft. Comput. 25, 445–451 (2014)CrossRefGoogle Scholar
  6. 6.
    Jensen, R., Shen, Q.: Finding rough set reducts with ant colony optimization. In: Proceedings of the 2003 UK Workshop on Computational Intelligence, pp. 15–22 (2003)Google Scholar
  7. 7.
    Lai, H.: Matroid Theory. Higher Education Press, Beijing (2001)Google Scholar
  8. 8.
    Lin, T.Y.: Granular computing on binary relations. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 296–299. Springer, Heidelberg (2002) CrossRefGoogle Scholar
  9. 9.
    Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Boston (1991) CrossRefGoogle Scholar
  10. 10.
    Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)CrossRefGoogle Scholar
  11. 11.
    Pawlak, Z., Skowron, A.: Rudiments of rough sets. Inf. Sci. 177, 3–27 (2007)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Wang, F.: Outline of a computational theory for linguistic dynamic systems: toward computing with words. Int. J. Intell. Control Syst. 2, 211–224 (1998)Google Scholar
  14. 14.
    Wang, Z., Shu, L., Ding, X.: Minimal description and maximal description in covering-based rough sets. Fundamenta Informaticae 128, 503–526 (2013)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Wang, S., Zhu, W., Zhu, Q., Min, F.: Characteristic matrix of covering and its application to boolean matrix decomposition. Inf. Sci. 263, 186–197 (2014)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Wang, S., Zhu, W., Zhu, Q., Min, F.: Four matroidal structures of covering and their relationships with rough sets. Int. J. Approximate Reasoning 54, 1361–1372 (2013)MathSciNetCrossRefGoogle Scholar
  17. 17.
    West, D., et al.: Introduction to Graph Theory. Pearson Education, Singapore (2002) Google Scholar
  18. 18.
    Wu, W., Leung, Y., Mi, J.: On characterizations of (I, T) -fuzzy rough approximation operators. Fuzzy Sets Syst. 154, 76–102 (2005)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Yao, Y.Y.: On generalizing pawlak approximation operators. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, p. 298. Springer, Heidelberg (1998) CrossRefGoogle Scholar
  20. 20.
    Yao, Y.: Relational interpretations of neighborhood operators and rough set approximation operators. Inf. Sci. 111, 239–259 (1998)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)CrossRefGoogle Scholar
  22. 22.
    Zakowski, W.: Approximations in the space (u, \(\pi \)). Demonstratio Mathematica 16, 761–769 (1983)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Zhu, W., Wang, F.: Reduction and axiomization of covering generalized rough sets. Inf. Sci. 152, 217–230 (2003)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Zhu, W.: Relationship between generalized rough sets based on binary relation and covering. Inf. Sci. 179, 210–225 (2009)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Zhu, W., Wang, F.: On three types of covering-based rough sets. IEEE Trans. Knowl. Data Eng. 19, 1131–1144 (2007)CrossRefGoogle Scholar
  26. 26.
    Zhu, W., Wang, F.: A new type of covering rough sets. In: 2006 3rd International IEEE Conference on Intelligent Systems, pp. 444–449. IEEE (2006)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (, which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Authors and Affiliations

  1. 1.Lab of Granular ComputingMinnan Normal UniversityZhangzhouChina

Personalised recommendations