Efficient Discovery of Functional and Approximate Dependencies Using Partitions.

@inproceedings{DBLP:conf/icde/HuhtalaKPT98,
  author    = {Yk{\"a} Huhtala and
               Juha K{\"a}rkk{\"a}inen and
               Pasi Porkka and
               Hannu Toivonen},
  title     = {Efficient Discovery of Functional and Approximate Dependencies
               Using Partitions},
  booktitle = {Proceedings of the Fourteenth International Conference on Data
               Engineering, February 23-27, 1998, Orlando, Florida, USA},
  publisher = {IEEE Computer Society},
  year      = {1998},
  isbn      = {0-8186-8289-2},
  pages     = {392-401},
  ee        = {db/conf/icde/HuhtalaKPT98.html},
  crossref  = {DBLP:conf/icde/98},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1998 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

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-7 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

Printed Edition

References

[1]

...

[2]

Dina Bitton, Jeffrey Millman, Solveig Torgersen: A Feasibility and Performance Study of Dependency Inference. ICDE 1989: 635-641 BibTeX

[3]

Mehmet M. Dalkilic, Edward L. Robertson, Dirk Van Gucht: CE: the Classifier-Estimator Framework for Data Mining. DS-7 1997: 89-104 BibTeX

[4]

...

[5]

Jyrki Kivinen, Heikki Mannila: Approximate Inference of Functional Dependencies from Relations. Theor. Comput. Sci. 149(1): 129-149(1995) BibTeX

[6]

Stefan Kramer, Bernhard Pfahringer: Efficient Search for Strong Partial Determinations. KDD 1996: 371-374 BibTeX

[7]

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

[8]

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

[9]

...

[10]

...

[11]

Heikki Mannila, Kari-Jouko Räihä: Algorithms for Inferring Functional Dependencies from Relations. Data Knowl. Eng. 12(1): 83-99(1994) BibTeX

[12]

Heikki Mannila, Hannu Toivonen: Levelwise Search and Borders of Theories in Knowledge Discovery. Data Min. Knowl. Discov. 1(3): 241-258(1997) BibTeX

[13]

...

[14]

Jean-Marc Petit, Farouk Toumani, Jean-François Boulicaut, Jacques Kouloumdjian: Towards the Reverse Engineering of Denormalized Relational Databases. ICDE 1996: 218-227 BibTeX

[15]

Bernhard Pfahringer, Stefan Kramer: Compression-Based Evaluation of Partial Determinations. KDD 1995: 234-239 BibTeX

[16]

...

[17]

...

[18]

Jeffrey C. Schlimmer: Efficiently Inducing Determinations: A Complete and Systematic Search Algorithm that Uses Optimal Pruning. ICML 1993: 284-290 BibTeX

[19]

...

[20]

...

[21]

Grant E. Weddell: Reasoning about Functional Dependencies Generalized for Semantic Data Models. ACM Trans. Database Syst. 17(1): 32-64(1992) BibTeX

Referenced by

1. Noel Novelli, Rosine Cicchetti: FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies. ICDT 2001: 189-203
2. Stéphane Lopes, Jean-Marc Petit, Lotfi Lakhal: Efficient Discovery of Functional Dependencies and Armstrong Relations. EDBT 2000: 350-364
3. Edwin M. Knorr, Raymond T. Ng: Finding Intensional Knowledge of Distance-Based Outliers. VLDB 1999: 211-222