Abstract
Motivated by Rough Set Theory we describe an interval arithmetic on complete lattices. Lattice elements get approximated by approximations which are pairs consisting of a lower and an upper approximation. The approximations form a complete lattice again. We describe these lattices of approximations by formal contexts. Furthermore, we interpret the result for concept lattices as restricting the scope to a subcontext of interesting objects and attributes. © Springer-Verlag Berlin Heidelberg 2010.
Cite
CITATION STYLE
Meschke, C. (2010). Approximations in concept lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5986 LNAI, pp. 104–123). https://doi.org/10.1007/978-3-642-11928-6_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
