Pierre Faure-Giovagnoli

Pierre Faure-Giovagnoli

Auto-generated profile, based on publicly available information

Pierre Faure-Giovagnoli

INSA Lyon, CNRS, UCBL, LIRIS UMR 5205

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 November 2022 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
AVAishwarya Venkataramanan
Aishwarya Venkataramanan
PFPierre Faure-Giovagnoli
Pierre Faure-Giovagnoli
CRCyril Regan
Cyril Regan
DHDavid Heudre
David Heudre
CFCécile Figus
Cécile Figus
MLMartin Laviale
Martin Laviale

16 April 2026 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
PFPierre Faure–Giovagnoli
Pierre Faure–Giovagnoli
SVSimon Vilmin
Simon Vilmin
JPJean Michel Petit
Jean Michel Petit
VSVasile-Marian Scuturici
Vasile-Marian Scuturici
The incorporation of domain knowledge (DK) in AI has been studied for years and turns out to be critical in practice. Functions are also a basic notion for dealing with data science projects and are somehow related to DK. Consider the following scenario. Let \(D(y, z_1, \ldots , z_n)\) be a dataset, Alice a data scientist, Bob a domain expert and \(y = f(z_1, \ldots , z_n)\) a function known to Bob from his background knowledge. Alice is interested in the following simple yet crucial questions: How to define the satisfaction of f in D ? How to measure that satisfaction efficiently? How does this satisfaction relate to the supervised learning task of learning f from D ? It turns out that these problems are related to the study of counterexamples through the use of functional dependencies (FDs) and, in particular, FD measures used to quantify their satisfaction in a dataset such as the \(g_3\) indicator where the equality is replaced by more flexible predicates. In this article, we first examine the complexity of computing \(g_3\) . It is known that \(g_3\) can be computed in polynomial time when using equality, while it becomes NP -hard when using general predicates. Our goal is to refine this dichotomy by studying the impact of the following common properties: reflexivity, transitivity, symmetry, and antisymmetry. We show that symmetry and transitivity together are sufficient to guarantee that the \(g_3\) can be computed in polynomial time. However, removing one of them makes the problem NP -hard. Second, we study the computation of \(g_3\) in the polynomial and NP -hard cases identified previously. We propose different exact and approximate solutions for the computation of \(g_3\) in both cases. We compare these solutions in a detailed experimental study of time performance and approximation accuracy. All the algorithms are also made available via fastg3 , an open-source Python library with an underlying C++ implementation. Finally, we link counterexamples and \(g_3\) to supervised learning with a web application called adesit . adesit is intended to be part of an iterative data refinement process right after data selection and just before the machine learning process itself. It provides a way to evaluate the ability of a dataset to perform well for a given supervised learning problem through statistical and visual exploration. In a last section, we validate our approach by applying it to the industrial problem of air gap monitoring in compact hydro-generators.