Approximate Dependency Inference from Relations.

@inproceedings{DBLP:conf/icdt/KivinenM92,
  author    = {Jyrki Kivinen and
               Heikki Mannila},
  editor    = {Joachim Biskup and
               Richard Hull},
  title     = {Approximate Dependency Inference from Relations},
  booktitle = {Database Theory - ICDT'92, 4th International Conference, Berlin,
               Germany, October 14-16, 1992, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {646},
  year      = {1992},
  isbn      = {3-540-56039-4},
  pages     = {86-98},
  ee        = {db/conf/icdt/KivinenM92.html},
  crossref  = {DBLP:conf/icdt/92},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Journal Version

References

[1]

Hussein Almuallim, Thomas G. Dietterich: Learning with Many Irrelevant Features. AAAI 1991: 547-552 BibTeX

[2]

Dana Angluin: Queries and Concept Learning. Machine Learning 2(4): 319-342(1987) BibTeX

[3]

Dana Angluin, Michael Frazier, Leonard Pitt: Learning Conjunctions of Horn Clauses (Extended Abstract). FOCS 1990: 186-192 BibTeX

[4]

Dana Angluin, Leslie G. Valiant: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. J. Comput. Syst. Sci. 18(2): 155-193(1979) BibTeX

[5]

Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman: On the Structure of Armstrong Relations for Functional Dependencies. J. ACM 31(1): 30-46(1984) BibTeX

[6]

Mokrane Bouzeghoub, Georges Gardarin, Elisabeth Métais: Database Design Tools: An Expert System Approach. VLDB 1985: 82-95 BibTeX

[7]

...

[8]

Rina Dechter: Decomposing an N-ary Relation into a Tree of Binary Relations. PODS 1987: 185-189 BibTeX

[9]

...

[10]

...

[11]

Thomas Eiter, Georg Gottlob: Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM J. Comput. 24(6): 1278-1304(1995) BibTeX

[12]

Richard J. Lipton, Jeffrey F. Naughton, Donovan A. Schneider: Practical Selectivity Estimation through Adaptive Sampling. SIGMOD Conference 1990: 1-11 BibTeX

[13]

David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX

[14]

Heikki Mannila, Kari-Jouko Räihä: Design by Example: An Application of Armstrong Relations. J. Comput. Syst. Sci. 33(2): 126-141(1986) BibTeX

[15]

Heikki Mannila, Kari-Jouko Räihä: Dependency Inference. VLDB 1987: 155-158 BibTeX

[16]

...

[17]

...

[18]

...

[19]

...

[20]

Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin: An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic. J. ACM 28(3): 435-453(1981) BibTeX

[21]

...

[22]

Antonio M. Silva, Michel A. Melkanoff: A Method for Helping Discover the Dependencies of a Relation. Advances in Data Base Theory 1979: 115-133 BibTeX

[23]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX

[24]

Leslie G. Valiant: A Theory of the Learnable. Commun. ACM 27(11): 1134-1142(1984) BibTeX

Referenced by

1. Jyrki Kivinen, Heikki Mannila: The Power of Sampling in Knowledge Discovery. PODS 1994: 77-85