Learning Minimal Covers of Functional Dependencies with Queries

Authors:
Montserrat Hermo;Víctor Lavín
Affiliations:
-;-
Venue:
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Year:
1999

Citing 12
Cited 2

Learning regular sets from queries and counterexamples

Information and Computation
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Negative Results for Equivalence Queries

Machine Learning
Learning Conjunctions of Horn Clauses

Machine Learning - Computational learning theory
Fundamentals of database systems (2nd ed.)

Fundamentals of database systems (2nd ed.)
Quantifying Prior Determination Knowledge Using the PAC Learning Model

Machine Learning
Learning nearly monotone k-term DNF

Information Processing Letters
Learning from Examples and Membership Queries with Structured Determinations

Machine Learning
A relational model of data for large shared data banks

Communications of the ACM
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Learning Monotone Term Decision Lists

EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory

On learning multivalued dependencies with queries

Theoretical Computer Science
Negative results on learning multivalued dependencies with queries

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional dependencies play an important role in the design of databases. We study the learnability of the class of minimal covers of functional dependencies (MCFD) within the exact learning model via queries. We prove that neither equivalence queries alone nor membership queries alone suffice to learn the class. In contrast, we show that learning becomes feasible if both types of queries are allowed. We also give some properties concerning minimal covers.