Abstract
Covering-based rough sets provide an efficient theory to process information in data mining. Matroid theory is a generalization of both linear algebra and graph theory, and has a variety of applications in many fields, such as covering-based rough sets. In this paper, we study the connectedness of graphs and matroids through covering-based rough sets. First, we present an approach to induce a covering by a graph. Then we use the covering upper approximation operator and the rank of matrix representation of the covering to study the connectedness of the graph. Moreover, we give the expression of the number of the connected components of a graph. Second, we establish a matroid based on the covering induced by a graph and study the connectedness of this matroid.
References
Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)
Pawlak, Z.: Rough classification. Int. J. Man-Mach. Stud. 20, 469–483 (1984)
Wu, W., Zhang, W.: Rough set approximations vs. measurable spaces (in chinese). In: Granular Computing (GrC), 2006 IEEE International Conference on Granular Computing, pp. 329–332. IEEE Press, China (2006)
Diker, M.: Textural approach to generalized rough sets based on relations. Inf. Sci. 180, 1418–1433 (2010)
Liu, G., Zhu, W.: The algebraic structures of generalized rough set theory. Inf. Sci. 178, 4105–4113 (2008)
Zhu, W., Wang, F.: Reduction and axiomization of covering generalized rough sets. Inf. Sci. 152, 217–230 (2003)
Wang, S., Zhu, W., Zhu, Q., Min, F.: Covering base. J. Inf. Comput. Sci. 9, 1343–1355 (2012)
Nettleton, D.F.: Data mining of social networks represented as graphs. Comput. Sci. Revi. 7, 1–34 (2013)
Fukami, T., Takahashi, N.: New classes of clustering coefficient locally maximizing graphs. Discrete Appl. Math. 162, 202–213 (2014)
Huang, A., Zhu, W.: Connectedness of graphs and its application to connected matroids through covering-based rough sets. arXiv preprint arXiv:1312.4234 (2013)
Oxley, J.G.: Matroid Theory. Oxford University Press, New York (1993)
Lai, H.: Matroid Theory. Higher Education Press, Beijing (2001)
Liu, Y., Zhu, W.: Characteristic of partition-circuit matroid through approximation number. In: Granular Computing (GrC), 2012 IEEE International Conference on Granular Computing, pp. 314–319. IEEE Press, Hangzhou (2012)
Zhu, W., Wang, S.: Matroidal approaches to generalized rough sets based on relations. Int. J. Mach. Learn. Cybern. 2, 273–279 (2011)
Liu, C., Miao, D.: Covering rough set model based on multi-granulations. In: Kuznetsov, S.O., Ślęzak, D., Hepting, D.H., Mirkin, B.G. (eds.) RSFDGrC 2011. LNCS, vol. 6743, pp. 87–90. Springer, Heidelberg (2011)
Pomykala, J.A.: Approximation operations in approximation space. Bul. Pol. Acad. Sci. 35, 653–662 (1987)
Chen, J., Li, J., Lin, Y.: On the structure of definable sets in covering approximation spaces. Int. J. Mach. Learn. Cybern. 4, 195–206 (2013)
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)
West, D.B., et al.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)
Wang, S., Zhu, Q., Zhu, W., Min, F.: Equivalent characterizations of some graph problems by covering-based rough sets. J. Appl. Math. (2013)
Wang, Z.: Graph Theory. Beijing Institute of Technology Press, Beijing (2002)
Acknowledgments
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, and the Science and Technology Key Project of Fujian Province, China Grant No. 2012H0043.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, H., Zhu, W. (2015). Connectedness of Graph and Matroid by Covering-Based Rough Sets. In: Yao, Y., Hu, Q., Yu, H., Grzymala-Busse, J.W. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. Lecture Notes in Computer Science(), vol 9437. Springer, Cham. https://doi.org/10.1007/978-3-319-25783-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-25783-9_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25782-2
Online ISBN: 978-3-319-25783-9
eBook Packages: Computer ScienceComputer Science (R0)