Condition for covering-based upper approximation operators to be closure operators of matroids
by Lirun Su; William Zhu
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 3, No. 2, 2013

Abstract: Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. In order to broaden the application and theoretical areas of rough sets and matroids, some authors have combined them from many different viewpoints, such as circuits, rank function and spanning sets. In this paper, we study the relationship between five types of covering-based upper approximation operators and closure operators of matroids. On one hand, comparing those characterisations of five types of covering-based upper approximation operators with the characterisations of closure operators of matroids, we discuss the condition under which five types of covering-based upper approximation operators form closure operators of matroids and get some results. For example, the necessary and sufficient conditions for the second type of covering-based upper approximation operator to satisfy idempotence is obtained. On the other hand, by using the characterisations of unary coverings, close friends, neighbourhoods, indiscernible neighbourhoods and reduct, we present necessary and sufficient conditions for five types of covering-based upper approximation operators to be closure operators of matroids.

Online publication date: Sat, 19-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com