Covering-based rough sets on Eulerian Matroids

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. © 2013 bin yang et al.