P.A. Flach and I. Savnik (1999). Database dependency discovery: a machine learning approach. AI Communications, to appear. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
FastFDs: A Heuristic-Driven, Depth-First Algorithm for.. - Wyss, Giannella.. (Correct)
....tests on distinct benchmark relation instances, comparing the Dep Miner and FastFDs hypergraph approaches to Tane s partitioning approach for mining FDs from a relation instance. At the end of the paper (appendix A) we provide experimental data comparing FastFDs with a third algorithm, fdep [FS 99] 1 Introduction Functional dependencies (FDs) are a well studied aspect of relational database theory [AHV 95] Originally, the study of FDs was motivated by the fact that they could be used to express constraints which hold on a relation schema independently of any particular instance of the ....
....instance of the schema (for example, a business rule) Recently, a new research direction for FDs has emerged: the dependency discovery problem. 1 Given a relation schema, R, and an instance of the schema, r, determine all FDs which hold over r. Our paper addresses this problem. 1 Like [FS 99] we do not use the term dependency inference to avoid confusion with the problem of inferring the dependencies implied by a given set of dependencies (which is not the problem of interest in this paper) We develop an algorithm, FastFDs, for finding the canonical cover of the set of FDs (F r ....
[Article contains additional citation context not shown here]
Flach, Peter and Savnik, Iztok. "Database Dependency Discovery: a Machine Learning Approach." AI Comm. vol. 12, no. 3, pg 139-160.
Rule Evaluation Measures: A Unifying View - Nada Lavrac Peter (1999) (6 citations) Self-citation (Flach) (Correct)
No context found.
P.A. Flach and I. Savnik (1999). Database dependency discovery: a machine learning approach. AI Communications, to appear.
Logical Characterisations Of Inductive Learning - Flach (2000) (1 citation) Self-citation (Flach) (Correct)
No context found.
P. A. Flach and I. Savnik. Database dependency discovery: a Machine Learning approach. AI Communications 12(3), 139--160, 1999.
Confirmation-guided discovery of first-order rules with Tertius - Flach, LACHICHE (2000) (2 citations) Self-citation (Flach) (Correct)
....algorithms tend to be more efficient because they are tailored towards that specific task. Database dependency discovery is such a restricted form of clausal discovery. The INDEX system [9] provided a straightforward top down refinement approach in a deductive database setting. The fdep system [11] offers more sophisticated and efficient bottom up algorithms. Tertius can in principle be applied to database dependency discovery tasks, although it will not have the efficiency of the special purpose fdep system. The confirmation heuristic, however, directly carries over to database dependency ....
P.A. Flach and I. Savnik. Database dependency discovery: a machine learning approach. AI Communications, 12(3):139--160, 1999.
Discovery of Multivalued Dependencies from Relations - Savnik, Flach (2000) (2 citations) Self-citation (Flach Savnik) (Correct)
....from S. 2 We avoid using the ambiguous term dependency inference , which has been used in the literature both for dependency discovery and for the problem of constructing dependencies that are implied by given dependencies, which is not the problem we are dealing with in this paper. 2 in [5]. The present paper details the application of top down and bottom up algorithms for the discovery of multivalued dependencies. The contributions of this paper are: the definition of the hypothesis space for the discovery of multivalued dependencies; the introduction of the data structure which ....
....manipulation of the sets of multivalued dependencies; an improved procedure for the enumeration of hypotheses; and the empirical analysis of the developed discovery algorithms. A more detailed description of the relations between the work on the discovery of database dependencies presented in [5] and the work on the discovery of multivalued dependencies presented in this paper is given in Section 5. 1.1 Overview of the paper Section 2 introduces multivalued dependencies, as well as a language providing an efficient representation. The generalisation specialisation relationship among the ....
[Article contains additional citation context not shown here]
P.A. Flach, I. Savnik, Database dependency discovery: a machine learning approach, AI Communications 12(3), 1999, pp. 139-160.
A First-Order Approach to Unsupervised Learning - Flach, LACHICHE (1999) Self-citation (Flach) (Correct)
....algorithms tend to be more efficient because they are tailored towards that specific task. Database dependency discovery is such a restricted form of clausal discovery. The INDEX system [4] provided a straightforward top down refinement approach in a deductive database setting. The FDEP system [7] offers more sophisticated and efficient bottom up algorithms. Tertius can in principle be applied to database dependency discovery tasks, although it will not have the efficiency of the special purpose FDEP system. The confirmation heuristic, however, directly carries over to database dependency ....
Peter A. Flach and Iztok Savnik. Database dependency discovery: a machine learning approach. AI Communications, 1999. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC