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.
Supported by the DFG research grant no. GA 216/10-1.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)
Ganter, B.: Lattices of Rough Set Abstractions as P-Products. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 199–216. Springer, Heidelberg (2008)
Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Heidelberg (1999)
Ganter, B.: Relational galois connections. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 1–17. Springer, Heidelberg (2007)
Meschke, C.: Robust Elements in Rough Set Abstractions. In: Ferré, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol. 5548, pp. 114–129. Springer, Heidelberg (2009)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meschke, C. (2010). Approximations in Concept Lattices. In: Kwuida, L., Sertkaya, B. (eds) Formal Concept Analysis. ICFCA 2010. Lecture Notes in Computer Science(), vol 5986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11928-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-11928-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11927-9
Online ISBN: 978-3-642-11928-6
eBook Packages: Computer ScienceComputer Science (R0)