Matroidal Structure of Rough Sets from the Viewpoint of Graph Theory

Abstract EN

Constructing structures with other mathematical theories is an important research field of rough sets.

As one mathematical theory on sets, matroids possess a sophisticated structure.

This paper builds a bridge between rough sets and matroids and establishes the matroidal structure of rough sets.

In order to understand intuitively the relationships between these two theories, we study this problem from the viewpoint of graph theory.

Therefore, any partition of the universe can be represented by a family of complete graphs or cycles.

Then two different kinds of matroids are constructed and some matroidal characteristics of them are discussed, respectively.

The lower and the upper approximations are formulated with these matroidal characteristics.

Some new properties, which have not been found in rough sets, are obtained.

Furthermore, by defining the concept of lower approximation number, the rank function of some subset of the universe and the approximations of the subset are connected.

Finally, the relationships between the two types of matroids are discussed, and the result shows that they are just dual matroids.