Authors: Shiping Wang; William Zhu
Addresses: School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, China. ' Lab of Granular Computing, Zhangzhou Normal University, Zhangzhou, 363000, China
Abstract: Covering-based rough set theory is a generalisation of rough set theory. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. In this paper, we introduce matroid theory to covering-based rough sets, and explore the matroidal structure and properties of covering-based rough sets. Specifically, we define the upper approximation number to establish the matroidal structure of covering-based rough sets. So many important concepts and methods in matroid theory can be employed to investigate covering-based rough sets. The rank plays a very important role in a matrix, so we use the rank function of the matroid induced by a covering to measure the covering. With the rank function, a pair of approximation operators, namely, matroid approximation operators, are constructed. This type of approximation operators not only inherits the properties of those traditional ones which are defined from the perspective of set theory, but also presents some new properties. Finally, the matroid upper approximations are compared with the second upper approximations in covering-based rough sets.
Keywords: covering based rough sets; matroid theory; matroids; upper approximation number; approximation operator; rank function; rough set theory.
International Journal of Granular Computing, Rough Sets and Intelligent Systems, 2011 Vol.2 No.2, pp.141 - 148
Available online: 26 Oct 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article