Approximate inference of functional dependencies from relations

DOI10.1016/0304-3975(95)00028-UzbMath0874.68247WikidataQ114683719 ScholiaQ114683719MaRDI QIDQ672339

Heikki Mannila, Jyrki Kivinen

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

functional dependency inference problem; machine learning algorithm

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

Related Items

Functional and approximate dependency mining: database and FCA points of view, A definition for fuzzy approximate dependencies, Elastic translation invariant matching of trajectories, A note on approximation measures for multi-valued dependencies in relational databases, Functional and multivalued dependencies in nested databases generated by record and list constructor

Cites Work

• Design by example: An application of Armstrong relations
• Decomposing a relation into a tree of binary relations
• Truthlikeness
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• On the complexity of inferring functional dependencies
• Structure identification in relational data
• Learning conjunctions of Horn clauses
• Learning Boolean concepts in the presence of many irrelevant features
• Horn approximations of empirical data
• Queries and concept learning
• A theory of the learnable
• On the Structure of Armstrong Relations for Functional Dependencies
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• Algorithms for inferring functional dependencies from relations
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item