On minimization of axiom sets characterizing covering-based approximation operators

Rough set theory was proposed by Pawlak to deal with the vagueness and granularity in information systems. The classical relation-based Pawlak rough set theory has been extended to covering-based generalized rough set theory. The rough set axiom system is the foundation of the covering-based general...

Full description

Saved in:
Bibliographic Details
Published inInformation sciences Vol. 181; no. 14; pp. 3032 - 3042
Main Authors Zhang, Yan-Lan, Luo, Mao-Kang
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.07.2011
Subjects
Approximation
Axioms
Covering
Covering-based approximation operators
Covering-based generalized rough sets
Equivalence
Information systems
Mathematical analysis
Minimization
Operators
Rough sets
Set theory
Covering-based generalized rough sets
Minimization
Covering-based approximation operators
Axioms
Rough sets
Online AccessGet full text

Cover

More Information
Summary:Rough set theory was proposed by Pawlak to deal with the vagueness and granularity in information systems. The classical relation-based Pawlak rough set theory has been extended to covering-based generalized rough set theory. The rough set axiom system is the foundation of the covering-based generalized rough set theory, because the axiomatic characterizations of covering-based approximation operators guarantee the existence of coverings reproducing the operators. In this paper, the equivalent characterizations for the independent axiom sets of four types of covering-based generalized rough sets are investigated, and more refined axiom sets are presented.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2011.02.020