Performance analysis of a greedy algorithm for inferring boolean functions

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

Volumn 2843, Issue , 2003, Pages 114-127

  Fukagawa, Daiji ^a   Akutsu, Tatsuya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242266107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39644-4_11     Document Type: Article

References (17)

1. Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules between Sets of Items in Large Databases. In Proc. SIGMOD Conference 1993, Washington, D.C. (1993) 207-216
2. Akutsu, T. and Bao, F.: Approximating Minimum Keys and Optimal Substructure Screens. In: Proc. COCOON 1996. Lecture Notes in Computer Science, Vol. 1090. Springer-Verlag, Berlin Heidelberg New York (1996) 290-299
3. Akutsu, T., Miyano, S., Kuhara, S.: Identification of Genetic Networks from a Small Number of Gene Expression Patterns Under the Boolean Network Model. In Proc. Pacific Symposium on Biocomputing (1999) 17-28
4. Akutsu, T., Miyano, S., Kuhara, S.: A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis. Theoretical Computer Science 292 (2003) 481-495.
5. Preliminary version has appeared in DS 2000 (LNCS 1967)
6. Blum, A., Langley, P.: Selection of Relevant Features and Examples in Machine Learning. Artificial Intelligence 97 (1997) 245-271
7. Boros, E., Horiyama, T., Ibaraki, T., Makino, K., Yagiura, M.: Finding Essential Attributes from Binary Data. Annals of Mathematics and Artificial Intelligence 39 (2003) 223-257
8. Gamberger, D.: A Minimization Approach to Propositional Inductive Learning. In: Proc. ECML 1995. Lecture Notes in Computer Science, Vol. 912. Springer-Verlag, Berlin Heidelberg New York (1995) 151-160
9. Gamberger, D., Lavrac, N.: Conditions for Occam's Razor Applicability and Noise Elimination. In: Proc. ECML 1997. Lecture Notes in Computer Science, Vol. 1224. Springer-Verlag, Berlin Heidelberg New York (1997) 108-123
10. Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. The MIT Press (1994)
11. Lavrac, N., Gamberger, D., Jovanoski, V.: A Study of Relevance for Learning in Deductive Databases. Journal of Logic Programming 40 (1999) 215-249
12. Littlestone, N.: Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm. Machine Learning 2 (1987) 285-318
13. Mannila, H., Raiha, K.-J.: On the Complexity of Inferring Functional Dependencies. Discrete Applied Mathematics 40 (1992) 237-243
14. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge Univ. Press (1995)
15. Pagallo, G., Haussler, D.: Boolean Feature Discovery in Empirical Learning. Machine Learning 5 (1990) 71-99
16. Tsai, C.-C., Marek-Sadowska, M.: Boolean Matching Using Generalized Reed-Muller Forms. In Proc. Design Automation Conference (1994) 339-344
17. Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)