Approximations in concept lattices

Authors:
Christian Meschke
Affiliations:
Institut für Algebra, TU Dresden, Germany
Venue:
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Year:
2010

Citing 5
Cited 2

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Robust Elements in Rough Set Abstractions

ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Relational galois connections

ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Lattices of rough set abstractions as P-products

ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis

Merging ordered sets

ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.