Title: Discovering (frequent) constant conditional functional dependencies

Authors: Thierno Diallo; Nöel Novelli; Jean-Marc Petit

Addresses: Université de Lyon, CNRS, INSA-Lyon, LIRIS, UMR5205, and Orchestra Networks, Paris, France. ' Université de la Méditerranée, CNRS, LIF, UMR6166, France. ' Université de Lyon, CNRS, INSA-Lyon, LIRIS, UMR5205, Paris, France

Abstract: Conditional functional dependencies (CFDs) have been recently introduced in the context of data cleaning. They can be seen as an unification of functional dependencies (FDs) and association rules (AR) since they allow to mix attributes and attribute/values in dependencies. In this paper, we introduce our first results on constant CFD inference. Not surprisingly, data mining techniques developed for functional dependencies and association rules can be reused for constant CFD mining. We focus on two types of techniques inherited from FD inference: the first one extends the notion of agree sets and the second one extends the notion of non-redundant sets, closure and quasi-closure. We have implemented the latter technique on which experiments have been carried out showing both the feasibility and the scalability of our proposition.

Keywords: conditional functional dependencies; CFDs; data dependencies; data mining; database theory; data cleaning; association rules.

DOI: 10.1504/IJDMMM.2012.048104

International Journal of Data Mining, Modelling and Management, 2012 Vol.4 No.3, pp.205 - 223

Published online: 23 Aug 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article