A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis

Theoretical Computer Science

Volumn 292, Issue 2, 2003, Pages 481-495

  Akutsu, Tatsuya ^a,c   Miyano, Satoru ^a   Kuhara, Satoru ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

Average case analysis; Functional dependencies; Greedy algorithm; Knowledge discovery; Set cover

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; PROBLEM SOLVING; SET THEORY;

AVERAGE CASE ANALYSIS;

RELATIONAL DATABASE SYSTEMS;

EID: 0037467662     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00183-4     Document Type: Conference Paper

References (14)

1. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proc. ACM SIGMOD Conf. on Management of Data, ACM, New York, 1993, pp. 207-216.
2. Akutsu T., Bao F. Approximating minimum keys and optimal substructure screens. Proc. COCOON '96. Lecture Notes in Computer Science. Vol. 1090:1996;290-299 Springer, Berlin.
3. T. Akutsu, S. Miyano, Selecting informative genes for cancer classification using gene expression data, in: Proc. 2001 IEEE - EURASIP Workshop on Nonlinear Signal and Image Processing (CD-ROM book, http://www.ee.udel.edu/nsip/index.html, 2001).
4. Akutsu T., Miyano S., Kuhara S. Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function. J. Comput. Biol. 7:2000;331-343.
5. T. Akutsu, A. Takasu, Inferring approximate functional dependencies from example data, in: Proc. AAAI93 Workshop on Knowledge Discovery in Databases, AAAI, New York, 1993, pp. 138-152.
6. Coppersmith D., Winograd S. Matrix multiplication via arithmetic progression. J. Symbol. Comput. 9:1990;251-280.
7. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;The MIT Press, Cambridge, MA.
8. Johnson D.S. Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9:1974;256-278.
9. J. Kivinen, H. Mannila, Approximate dependency inference from relations, in: Proc. Fourth Internat. Conf. on Database Theory, 1992, pp. 86-98.
10. H. Mannila, K. Räihä, Dependency inference, in: Proc. 13th VLDB Conf., 1987, pp. 155-158.
11. Mannila H., Räihä K. On the complexity of inferring functional dependencies. Discrete Appl. Math. 40:1992;237-243.
12. Motowani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press, Cambridge.
13. Quinlan J.R. C4.5 Programs for Machine Learning. 1993;Morgan Kaufmann, Los Altos, CA.
14. Somogyi R., Sniegoski C.A. Modeling the complexity of genetic networks: understanding multigene and pleiotropic regulation. Complexity. 1:1996;45-63.