Stochastic Local Search in k-term DNF Learning

Proceedings, Twentieth International Conference on Machine Learning

Volumn 2, Issue , 2003, Pages 648-655

  Rückert, Ulrich ^a   Kramer, Stefan ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; DATABASE SYSTEMS; ENCODING (SYMBOLS); LEARNING ALGORITHMS; OPTIMIZATION; STOCHASTIC CONTROL SYSTEMS;

DNF LEARNING; STOCHASTIC LOCAL SEARCH ALGORITHM;

PROBLEM SOLVING;

EID: 1942516820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Bain, M. (1994). Learning logical exceptions in chess. Doctoral dissertation, Department of Statistics and Modelling Science, University of Strathclyde, Scotland.
2. Blake, C., & Merz, C. (1998). UCI repository of machine learning databases.
3. Chisholm, M., & Tadepalli, P. (2002). Learning decision rules by randomized iterative local search. Proceedings ICML-02 (pp. 75-82). Morgan Kaufmann.
4. Fürnkranz, J. (1999). Separate-and-conquer rule learning. Artificial Intelligence Review; 13, 3-54.
5. Fürnkranz, J. (2002). Personal Communication, April 2002.
6. Gomes, C. P., Selman, B., & Kautz, H. (1998). Boosting combinatorial search through randomization. Proceedings AAAI-98 (pp. 431-437). Menlo Park: AAAI Press.
7. Hoos, H. H. (1998). Stochastic local search - methods, models, applications. Doctoral dissertation, Technische Universität Darmstadt.
8. Kamath, A. P., Karmarkar, N. K., Ramakrishnan, K. G., & Resende, M. G. C. (1992). A continuous approach to inductive inference. Mathematical Programming, 57, 215-238.
9. Kearns, M. J., & Vazirani, U. V. (1994). An introduction to computational learning theory. Cambridge, Massachusetts: The MIT Press.
10. McAllester, D., Selman, B., & Kautz, H. (1997). Evidence for invariants in local search. Proceedings AAAI-97 (pp. 321-326). Providence, Rhode Island.
11. Mooney, R. J. (1995). Encouraging experimental results on learning CNF. Machine Learning, 19,79-92.
12. Nalimov, E. V., Haworth, G. M., & Heinz, E. A. (2000). Space efficient indexing of chess endgame tables. ICGA Journal, 23, 148-162.
13. Quinlan, J. R., & Cameron-Jones, R. M. (1995). Induction of logic programs: FOIL and related systems. New Generation Computing, 13,287-312.
14. Rückert, U. (2002). Machine learning in the phase transition framework. Master's thesis, Albert-Ludwigs-Universität Freiburg, http : //home. Informatik. tu-muenchen. de/rueckert/da.pdf.
15. Rückert, U., & De Raedt, L. (2003). An experimental evaluation of the covering algorithm in rule learning, to be submitted.
16. Rückert, U., Kramer, S., & De Raedt, L. (2002). Phase transitions and stochastic local search in k-term dnf learning. Machine Learning: ECML 2002 (pp. 405-417). Springer.
17. Selman, B., & Kautz, H. A. (1993). Domain-independant extensions to GSAT : Solving large structured variables. Proceedings IJCAI-93 (pp. 290-295).
18. Selman, B., Kautz, H. A., & Cohen, B. (1996). Local search strategies for satisfiability testing. In Cliques, coloring, satisfiability: the second dimacs implementation challenge, 521-532. AMS Series in Discrete mathematics and Theortical Computer Science 26.
19. Selman, B., Levesque, H., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. Proceedings AAAI-92 (pp. 459-465).