Covering‐Based Rough Sets on Eulerian Matroids

Bin Yang, Ziqiong Lin and William Zhu

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: 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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/254797

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:254797

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().