Computing Dependencies Using FCA

Jaume Baixeries, Víctor Codocedo, Mehdi Kaytoue, Amedeo Napoli

Abstract: Constraints, in a broad sense, are restrictions that exist (or should exist) in a dataset. There are many different kinds of constraints, that differ not only in their semantics, but also, in the domains in which they are present: database design, knowledge discovery, data analysis, to name a few. Formal Concept Analysis and Pattern Structures has been used to characterize and compute different kinds of constraints. The fact that this unified framework can embrace all this diversity has been an appealing line of research during the last years. In this paper we revisit some of our relevant results in this field. Moreover, we also discuss limitations and drawbacks and suggest possible directions within this field.