Advertisement
Published in:
2009 | OriginalPaper | Chapter
Robust Elements in Rough Set Abstractions
Author : Christian Meschke
Published in: Formal Concept Analysis
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In [3] the classical rough set approach was generalized in the manner that lower and upper approximations were replaced by arbitrary kernel and closure operators respectively. Furthermore, the resulting lattices of
rough set abstractions
were described as
P-products
. This approach, though promising, needs additional research to become part of a unifying theory of Rough Set Theory and Formal Concept Analysis. For example, the role of
robust
elements and the possible existence of suitable negation operators were not addressed. We present results in these directions and on the structure of these lattices.