Phase transitions and stochastic local search in k-term DNF learning

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

Volumn 2430, Issue , 2002, Pages 405-417

  Rückert, Ulrich ^a   Kramer, Stefan ^a   De Raedt, Luc ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INDUCTIVE LOGIC PROGRAMMING (ILP); LOCAL SEARCH (OPTIMIZATION); MACHINE LEARNING; STOCHASTIC SYSTEMS;

BOOLEAN FORMULAE; BOOLEAN VARIABLES; HARD PROBLEMS; NEGATIVE EXAMPLES; STOCHASTIC LOCAL SEARCHES;

BOOLEAN ALGEBRA;

EID: 84923529666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36755-1_34     Document Type: Conference Paper

References (28)

1. Bain, M. E. (1994) Learning logical exceptions in chess. PhD thesis. Department of Statistics and Modelling Science, University of Strathclyde, Scotland
2. Barber, M. N. (1983) Finite-size scaling. Phase Transitions and critical phenomena, Vol. 8, 145-266, Academic Press
3. Cheeseman, P., Kanefsky, B., and Taylor, W. M. (1991). Where the really hard problems are. Proceedings of the 12th IJCAI, 331-337
4. Domingos, P. (1999) The role of Occam’s razor in knowledge discovery. Data Mining and Knowledge Discovery, Vol. 3, Nr. 4, 409-425
5. Fürnkranz, J. (2002) Personal communication
6. Gent, I. P., and Walsh, T. (1995). The number partition phase transition. Research report 95-185, Department of Computer Science, University of Strathclyde
7. Gent, I. P., and Walsh, T. (1996). The TSP phase transition, Artificial Intelligence, 88, 1-2, 349-358
8. Giordana, A., Saitta, L., Sebag, M., and Botta, M. (2000) Analyzing Relational Learning in the Phase Transition Framework. Proc. 17th International Conf. on Machine Learning, 311-318
9. Giordana, A., Saitta, L. (2000) Phase Transitions in Relational Learning. Machine Learning, 41(2), 217-25
10. Giordana, A., Saitta, L., and Zini, F. (1994) Learning disjunctive concepts by means of genetic algorithms. Proc. 11th International Conf. on Machine Learning, 96-104
11. Giordana, A., Botta, M., and Saitta, L. (1999) An experimental study of phase transitions in matching. IJCAI 1999, 1198-1203
12. Hoos, H. H. (1998) Stochastic local search - methods, models, applications, PhD Thesis, Technische Universitat Darmstadt
13. Kamath, A. P., Karmarkar, N. K., Ramakrishnan, K. G., and Resende, M. G. C. (1991). A continous approach to inductive inference. Mathematical Programming, 57, 1992, 215-238.
14. Kearns, M. J., and Vazirani, U. V. (1994). An introduction to computational learning theory. Cambridge, MA: MIT Press
15. Kirkpatrick, S., and Selman, B. (1994). Critical behavior in the satisfiability of random boolean expressions. Science, 264, 1297-1301
16. Kovacic, M. (1994) MILP - a stochastic approach to Inductive Logic Programming. Proc. 4th International Workshop on Inductive Logic Programming, 123-138
17. McAllester, D., Selman, B., and Kautz, H. (1997) Evidence for invariants in local search. Proceedings of the 14th National Conference on Artificial Intelligence, 321-326
18. Mitchell, D., Selman, B., and Levesque, H. (1992) Hard and easy distributions of SAT problems. Proceedings of the 10th National Conference on Artificial Intelligence, AAAI Press/MIT Press, San Jose, CA, 459-465
19. Mooney, R. J. (1995) Encouraging experimental results on learning CNF. Machine Learning, Vol. 19, 1, 79-92
20. Nalimov, E. V., Haworth, G.McC., and Heinz, E. A. (2000) Space-efficient indexing of chess endgame tables. ICGA Journal, Vol. 23, Nr. 3, 148-162
21. Plotkin, G. D. (1970) A note on inductive generalization. Machine Intelligence 5, Edinburgh University Press, 153-163.
22. Quinlan, J. R., and Cameron-Jones, R. M. (1995) Induction of logic programs: FOIL and related systems. New Generation Computing, Vol. 13, 287-312
23. Selman, B., and Kautz, H. A. (1992) A new method for solving hard satisfiability problems. Proceedings of the 10th National Conference on Artificial Intelligence, San Jose, CA, 440-446
24. Selman, B., Kautz, H. A., and Cohen, B. (1993) Local search strategies for satisfiability testing. Proceedings of the 10th National Conference on Artificial Intelligence, San Jose, CA
25. Selman, B., and Kautz, H. A. (1993) Domain-independent extensions to GSAT: solving large structured satisfiability problems. Proceedings of IJCAI 93, 290-295
26. Selman, B., Kautz, H. A. and Cohen, B. (1994) Noise strategies for improving local search. Proceedings of the 14th National Conference on Artificial Intelligence, 337-343
27. Webb, G. J. (1996) Further evidence against the utility of Occam’s razor. Journal of Artificial Intelligence Research, Vol. 4, 397-417
28. Weisstein, E. W. (2002) Stirling number of the second kind, http://mathworld.wolfram.com/StirlingNumberoftheSecondKind.html