Open Access
2013 Covering-Based Rough Sets on Eulerian Matroids
Bin Yang, Ziqiong Lin, William Zhu
J. Appl. Math. 2013: 1-8 (2013). DOI: 10.1155/2013/254797


Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets. Matroid theory is a vital structure with high applicability and borrows extensively from linear algebra and graph theory. In this paper, one type of covering-based approximations is studied from the viewpoint of Eulerian matroids. First, we explore the circuits of an Eulerian matroid from the perspective of coverings. Second, this type of covering-based approximations is represented by the circuits of Eulerian matroids. Moreover, the conditions under which the covering-based upper approximation operator is the closure operator of a matroid are presented. Finally, a matroidal structure of covering-based rough sets is constructed. These results show many potential connections between covering-based rough sets and matroids.


Download Citation

Bin Yang. Ziqiong Lin. William Zhu. "Covering-Based Rough Sets on Eulerian Matroids." J. Appl. Math. 2013 1 - 8, 2013.


Published: 2013
First available in Project Euclid: 14 March 2014

zbMATH: 06950585
MathSciNet: MR3100822
Digital Object Identifier: 10.1155/2013/254797

Rights: Copyright © 2013 Hindawi

Vol.2013 • 2013
Back to Top