Covering matroid

09/22/2012
by   Yanfang Liu, et al.
0

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions, coverings are more natural combinatorial objects and can sometimes be more efficient to deal with problems in the real world. Through extending partitions to coverings, we propose a new type of matroids called covering matroids and prove them to be an extension of partition matroids. Secondly, since some researchers have successfully applied partition matroids to classical rough sets, we study the relationships between covering matroids and covering-based rough sets which are an extension of classical rough sets. Thirdly, in matroid theory, there are many special matroids, such as transversal matroids, partition matroids, 2-circuit matroid and partition-circuit matroids. The relationships among several special matroids and covering matroids are studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/23/2012

Characteristic of partition-circuit matroid through approximation number

Rough set theory is a useful tool to deal with uncertain, granular and i...
research
11/28/2009

Covering rough sets based on neighborhoods: An approach without using neighborhoods

Rough set theory, a mathematical tool to deal with inexact or uncertain ...
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/25/2012

Lattice structures of fixed points of the lower approximations of two types of covering-based rough sets

Covering is a common type of data structure and covering-based rough set...
research
12/16/2013

Connectedness of graphs and its application to connected matroids through covering-based rough sets

Graph theoretical ideas are highly utilized by computer science fields e...
research
06/29/2023

Exploiting Strict Constraints in the Cylindrical Algebraic Covering

One of the few available complete methods for checking the satisfiabilit...
research
11/28/2009

An axiomatic approach to the roughness measure of rough sets

In Pawlak's rough set theory, a set is approximated by a pair of lower a...

Please sign up or login with your details

Forgot password? Click here to reset