Abstract
We show how certain lattices occurring in the theory of Rough Sets can be described in the language of Formal Concept Analysis. These lattices are obtained from generalised approximation operators forming a kernel-closure pair. We prove a general context representation theorem and derive first consequences. It becomes clear under which conditions the approximations can be interpreted as intervals in a lattice of "definable sets". © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Ganter, B. (2008). Lattices of rough set abstractions as P-products. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4933 LNAI, pp. 199–216). https://doi.org/10.1007/978-3-540-78137-0_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
