Showing cs.DMShow all
3 papers · 1 filter
cs.DM2023
Functional Dependencies with Predicates: What Makes the -error Easy to Compute?
Simon Vilmin, Pierre Faure--Giovagnoli, Jean-Marc Petit +1
The notion of functional dependencies (FDs) can be used by data scientists and domain experts to confront background knowledge against data. To overcome the classical, too restrict…
cs.DM2020
Hierarchical Decompositions of dihypergraphs
Lhouari Nourine, Simon Vilmin
In this paper we are interested in decomposing a dihypergraph into simpler dihypergraphs, that can be handled more efficiently. We study the proper…
cs.DM2019
Translating between the representations of a ranked convex geometry
Oscar Defrain, Lhouari Nourine, Simon Vilmin
It is well known that every closure system can be represented by an implicational base, or by the set of its meet-irreducible elements. In Horn logic, these are respectively known…