Arbitrary relations in formal concept analysis and logical information systems

27Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A logical view of formal concept analysis considers attributes of a formal context as unary predicates. In a first part, we propose an augmented definition that handles binary relations between objects. A Galois connection is defined on augmented contexts. It represents concept inheritance as usual, but also relations between concepts. As usual, labeling operators are also defined. In particular, concepts and relations are visible and labeled in a single structure. In a second part, we show how relations can be used for navigating in an augmented concept lattice. This part augments the theory of Logical Information Systems. An implementation is sketched, and first experimental results are presented. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Ferré, S., Ridoux, O., & Sigonneau, B. (2005). Arbitrary relations in formal concept analysis and logical information systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3596 LNAI, pp. 166–180). Springer Verlag. https://doi.org/10.1007/11524564_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free