IDEAS home Printed from https://ideas.repec.org/a/ids/ijdmmm/v4y2012i3p205-223.html
   My bibliography  Save this article

Discovering (frequent) constant conditional functional dependencies

Author

Listed:
  • Thierno Diallo
  • Nöel Novelli
  • Jean-Marc Petit

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.

Suggested Citation

  • Thierno Diallo & Nöel Novelli & Jean-Marc Petit, 2012. "Discovering (frequent) constant conditional functional dependencies," International Journal of Data Mining, Modelling and Management, Inderscience Enterprises Ltd, vol. 4(3), pages 205-223.
  • Handle: RePEc:ids:ijdmmm:v:4:y:2012:i:3:p:205-223
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=48104
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijdmmm:v:4:y:2012:i:3:p:205-223. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=342 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.