Li, Jiuyong and Liu, Jixue and Toivonen, Hannu and Yong, Jianming (2013) Effective pruning for the discovery of conditional functional dependencies. The Computer Journal, 56 (3). pp. 378-392. ISSN 0010-4620
|HTML Citation||EndNote||Dublin Core||Reference Manager|
Full text not available from this archive.
Official URL: http://comjnl.oxfordjournals.org/content/56/3/378
Identification Number or DOI: doi: 10.1093/comjnl/bxs082
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.
|Item Type:||Article (Commonwealth Reporting Category C)|
|Additional Information:||Copyright of Computer Journal is the property of Oxford University Press and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. First published online 24 Jun 2012.|
|Uncontrolled Keywords:||functional dependencies; conditional functional dependencies; association rules; closed patterns|
|Fields of Research (FOR2008):||08 Information and Computing Sciences > 0806 Information Systems > 080610 Information Systems Organisation|
08 Information and Computing Sciences > 0806 Information Systems > 080604 Database Management
01 Mathematical Sciences > 0101 Pure Mathematics > 010107 Mathematical Logic, Set Theory, Lattices and Universal Algebra
|Socio-Economic Objective (SEO2008):||E Expanding Knowledge > 97 Expanding Knowledge > 970108 Expanding Knowledge in the Information and Computing Sciences|
|Deposited On:||17 Oct 2012 13:03|
|Last Modified:||21 May 2013 12:58|
Archive Staff Only: edit this record