Using concept lattices to mine functional dependencies

Concept Lattices have been proved to be a valuable tool to represent the knowlegde in a database. In this paper we show how functional dependencies in databases can be extracted using Concept Lattices, not preprocessing the original database, but providing a new closure operator. We also prove that this method generalizes the previous methods and closure operators that are being used to find association rules in binary databases.Postprint (published version

Operational resolutions and state transitions in a categorical setting

We define a category with as objects operational resolutions and with as morphisms - not necessarily deterministic - state transitions. We study connections with closure spaces and join-complete lattices and sketch physical applications related to evolution and compoundness. An appendix with preliminaries on quantaloids is included.Comment: 21 page