FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2114, Issue , 2001, Pages 101-110

  Wyss, Catharine ^a   Giannella, Chris ^a   Robertson, Edward ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; DATA WAREHOUSES; GRAPH THEORY; MINERS; WAREHOUSES;

DATABASE RESEARCH; DEPTH FIRST; DEPTH-FIRST ALGORITHMS; EXPONENTIAL COMPLEXITY; FUNCTIONAL DEPENDENCY; HYPER GRAPH; PROBLEM-BASED;

PROBLEM SOLVING;

EID: 84958780501     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44801-2_11     Document Type: Conference Paper

References (13)

1. Agrawal, Rakesh; Mannila, Heikki; Srikant, Ramakrishnan; Toivonen, Hannu and Verkamo, A.I. “Fast Discovery of Association Rules." Advances in KDD, AAAI Press, Menlo Park, CA, pg. 307-328, 1996.
2. Demetrovics, J; Katona, G; Miklos, D; Seleznjev, O. and Thalheim, B. “The Average Length of Keys and Functional Dependencies in (Random) Databases." Lecture Notes in Computer Science, vol. 893, 1995.
3. Eiter, Thomas and Gottlob, Goerg. “Identifying the Minimal Traversals of a Hypergraph and Related Problems." SIAM Journal of Computing, vol. 24, no. 6, pg. 1278-1304, 1995.
4. Flach, Peter and Savnik, Iztok. “Database Dependency Discovery: a Machine Learning Approach." AI Comm. vol. 12, no. 3, pg 139-160.
5. Gunopulos, Dimitrios; Khardon, Roni; Mannila, Heikki; and Toivonen, Hannu. “Data Mining, Hypergraph Traversals, and Machine Learning (extended abstract)", PODS, 1997, pg 209-216.
6. Huhtala, Ykä; Kärkkäinen, Juha; Porkka, Pasi and Toivonen, Hannu. “TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies." The Computer Journal, vol. 42, no. 2, 1999.
7. Kantola, Martti; Mannila, Heikki; Räihä, Kari-Jouko and Siirtola, Harri. “Discovering Functional and Inclusion Dependencies in Relational Databases." Journal of Intelligent Systems, vol. 7, pg. 591-607, 1992.
8. Lopes, Stephane; Petit, Jean-Marc and Lakhal, Lot. “Efficient Discovery of Functional Dependencies and Armstrong Relations." Proceedings of ECDT 2000. Lecture Notes in Computer Science, vol 1777.
9. Mannila, Heikki and Räihä, Kari-Jouko. “Dependency Inference (Extended Abstract)", Proceedings of the Very Large Databases Conference (VLDB), Brighton, pg. 155-158, 1987.
10. Mannila, Heikki and Räihä, Kari-Jouko. “Algorithms for Inferring Functional Dependencies from Relations", Data & Knowledge Engineering, 12, pg. 83-99, 1994.
11. Merz, C.J. and Murphy, P.M. UCI Machine Learning databases (1996). http://www.ics.uci.edu/~mlearn/MLRepository.html. Irvine, CA: University of California, Department of Information and Comp. Sci.
12. The Tane and Tane/mem source code is available on the web at http://www.cs.helsinki.fi/research/fdk/datamining/tane.
13. Wyss, C; Giannella, C; and Robertson E. “FastFDs: A Heuristic-Driven, Depth- First Algorithm for Mining Functional Dependencies from Relation Instances", Technical Report, Dept. of Comp. Sci, Indiana University, May 2001.