Effective pruning for the discovery of conditional functional dependencies
Date
2013
Authors
Li, J.
Liu, J.
Toivonen, H.
Yong, J.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Computer Journal, 2013; 56(3):378-392
Statement of Responsibility
Conference Name
Abstract
Conditional functional dependencies (CFDs) have been proposed as a new type of semantic rules extended from traditional functional dependencies. They have shown great potential for detecting and repairing inconsistent data. Constant CFDs are 100% confidence association rules. The theoretical search space for the minimal set of CFDs is the set of minimal generators and their closures in data. This search space has been used in the currently most efficient constant CFD discovery algorithm. In this paper, we propose pruning criteria to further prune the theoretic search space, and design a fast algorithm for constant CFD discovery. We evaluate the proposed algorithm on a number of media to large real-world data sets. The proposed algorithm is faster than the currently most efficient constant CFD discovery algorithm, and has linear time performance in the size of a data set.
School/Discipline
Dissertation Note
Provenance
Description
Link to a related website: http://www.cs.helsinki.fi/u/htoivone/pubs/ConditionalFDs.pdf, Open Access via Unpaywall
Access Status
Rights
Copyright 2012 The Author