Topological characterizations to three types of covering approximation operators

09/29/2012
by   Aiping Huang, et al.
0

Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Topology, one of the most important subjects in mathematics, provides mathematical tools and interesting topics in studying information systems and rough sets. In this paper, we present the topological characterizations to three types of covering approximation operators. First, we study the properties of topology induced by the sixth type of covering lower approximation operator. Second, some topological characterizations to the covering lower approximation operator to be an interior operator are established. We find that the topologies induced by this operator and by the sixth type of covering lower approximation operator are the same. Third, we study the conditions which make the first type of covering upper approximation operator be a closure operator, and find that the topology induced by the operator is the same as the topology induced by the fifth type of covering upper approximation operator. Forth, the conditions of the second type of covering upper approximation operator to be a closure operator and the properties of topology induced by it are established. Finally, these three topologies space are compared. In a word, topology provides a useful method to study the covering-based rough sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/02/2012

Relationship between the second type of covering-based rough set and matroid via closure operator

Recently, in order to broad the application and theoretical areas of rou...
research
09/29/2012

Geometric lattice structure of covering-based rough sets through matroids

Covering-based rough set theory is a useful tool to deal with inexact, u...
research
11/24/2016

Double-quantitative γ^∗-fuzzy coverings approximation operators

In digital-based information boom, the fuzzy covering rough set model is...
research
12/07/2011

Multi-granular Perspectives on Covering

Covering model provides a general framework for granular computing in th...
research
07/02/2012

Characteristic matrix of covering and its application to boolean matrix decomposition and axiomatization

Covering is an important type of data structure while covering-based rou...
research
04/01/2015

Knowledge reduction of dynamic covering decision information systems with immigration of more objects

In practical situations, it is of interest to investigate computing appr...
research
09/25/2012

Condition for neighborhoods induced by a covering to be equal to the covering itself

It is a meaningful issue that under what condition neighborhoods induced...

Please sign up or login with your details

Forgot password? Click here to reset