Approximate inference of functional dependencies from relations
From MaRDI portal
(Redirected from Publication:672339)
Recommendations
- Algorithms for inferring functional dependencies from relations
- On the complexity of inferring functional dependencies
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries
- Functional and approximate dependency mining: database and FCA points of view
- Functional dependencies distorted by errors
Cites work
- A theory of the learnable
- Algorithms for inferring functional dependencies from relations
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
- Decomposing a relation into a tree of binary relations
- Design by example: An application of Armstrong relations
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Horn approximations of empirical data
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 4074550 (Why is no real title available?)
- scientific article; zbMATH DE number 4083037 (Why is no real title available?)
- scientific article; zbMATH DE number 50693 (Why is no real title available?)
- scientific article; zbMATH DE number 108405 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Learning Boolean concepts in the presence of many irrelevant features
- Learning conjunctions of Horn clauses
- On the complexity of inferring functional dependencies
- On the Structure of Armstrong Relations for Functional Dependencies
- Queries and concept learning
- Structure identification in relational data
- Truthlikeness
Cited in
(29)- On the complexity of inferring functional dependencies
- Impurity measures in databases
- Elastic translation invariant matching of trajectories
- Approximation and dependence via multiteam semantics
- A note on approximation measures for multi-valued dependencies in relational databases
- A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
- Approximate keys and functional dependencies in incomplete databases with limited domains
- Mining relaxed functional dependencies from data
- Functional dependencies are helpful for partial materialization of data cubes
- Exploiting domain knowledge to detect outliers
- Reasoning about functional and full hierarchical dependencies over partial relations
- Functional and multivalued dependencies in nested databases generated by record and list constructor
- Learning an extension of the class of functional dependencies with queries
- Mining approximate interval-based temporal dependencies
- The logic of approximate dependence
- Construction and learnability of canonical Horn formulas
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Algorithms for inferring functional dependencies from relations
- Functional and approximate dependency mining: database and FCA points of view
- Relational decomposition through partial functional dependencies
- scientific article; zbMATH DE number 846961 (Why is no real title available?)
- scientific article; zbMATH DE number 1453046 (Why is no real title available?)
- Integrity constraints revisited: from exact to approximate implication
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries
- On learning multivalued dependencies with queries
- Predictive mining of multi-temporal relations
- Approximate integrity constraints in incomplete databases with limited domains
- Consistent query answering in multi-relation databases
- A definition for fuzzy approximate dependencies
This page was built for publication: Approximate inference of functional dependencies from relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672339)
