2011 | OriginalPaper | Buchkapitel
On Lattice–Based Fuzzy Rough Sets
verfasst von : Anna Maria Radzikowska
Erschienen in: 35 Years of Fuzzy Set Theory
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Rough sets were originally proposed by Pawlak as a formal tool for analyzing and processing incomplete information represented in data tables. Later on, fuzzy generalizations of rough sets were introduced and investigated to be able to deal with imprecision. In this paper we present
L
-fuzzy rough sets as a further generalization of rough sets. As an underlying algebraic structure we take an
extended
residuated
lattice
, that is a residuated lattice endowed with a De Morgan negation. The signature of these structures gives algebraic counterparts of main fuzzy logical connectives. Properties of
L
-fuzzy rough sets are presented. We show that under some conditions families of all lower (resp. upper)
L
-fuzzy rough sets are complete (distributive) lattices. It is also pointed out that in some specific cases lower and upper fuzzy rough approximation operators are
L
-fuzzy topological operators of interior and closure, respectively.