Geometric Lattice Structure of Covering-Based Rough Sets through Matroids

Abstract

Covering-based rough set theory is a useful tool to deal with inexact, uncertain, or vague knowledge in information systems. Geometric lattice has been widely used in diverse fields, especially search algorithm design, which plays an important role in covering reductions. In this paper, we construct three geometric lattice structures of covering-based rough sets through matroids and study the relationship among them. First, a geometric lattice structure of covering-based rough sets is established through the transversal matroid induced by a covering. Then its characteristics, such as atoms, modular elements, and modular pairs, are studied. We also construct a one-to-one correspondence between this type of geometric lattices and transversal matroids in the context of covering-based rough sets. Second, we present three sufficient and necessary conditions for two types of covering upper approximation operators to be closure operators of matroids. We also represent two types of matroids through closure axioms and then obtain two geometric lattice structures of covering-based rough sets. Third, we study the relationship among these three geometric lattice structures. Some core concepts such as reducible elements in covering-based rough sets are investigated with geometric lattices. In a word, this work points out an interesting view, namely, geometric lattice, to study covering-based rough sets.