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. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Meschke, C. (2009). Robust elements in rough set abstractions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5548 LNAI, pp. 114–129). https://doi.org/10.1007/978-3-642-01815-2_10
Mendeley helps you to discover research relevant for your work.