Relational learning as search in a critical region

Journal of Machine Learning Research

Volumn 4, Issue 4, 2004, Pages 431-463

  Botta, Marco ^a   Giordana, Attilio ^a   Saitta, Lorenza ^b   Sebag, Michèle ^c  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^c UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LOGIC PROGRAMMING; PHASE TRANSITIONS; PROBABILITY;

INDUCTIVE LOGIC PROGRAMMING (ILP); LOGIC LANGUAGES; RELATIONAL LEARNING;

LEARNING SYSTEMS;

EID: 2542464090     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244304773936018     Document Type: Conference Paper

References (45)

1. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, and M.S.O. Molloy. Random constraint satisfaction: A more accurate picture. In Third International Conference on Principles and Practice of Constraint Programming, pages 107-120. Springer, 1997.
2. C. Anglano, A. Giordana, G. Lobello, and L. Saitta. An experimental evaluation of coevolutive concept learning. In Proceedings of the 15th International Conference on Machine Learning, pages 19-23, Madison, WI, July 1998.
3. F. Bergadano, A. Giordana, and L. Saitta. Machine Learning: An Integrated Framework and its Applications. Ellis Horwood, Chichester, UK, 1991.
4. M. Botta and A. Giordana. SMART+: A multi-strategy learning tool. In IJCAI-93, Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pages 937-943, Chambéry, France, 1993.
5. M. Botta, A. Giordana, and L. Saitta. An experimental study of phase transitions in matching. In Proceedings of th 16th International Joint Conference on Artificial Intelligence, pages 1198-1203, Stockholm, Sweden, 1999.
6. M. Botta, A. Giordana, L. Saitta, and M. Sebag. Relational learning: Hard problems and phase transitions. In Proceedings of the 6th National Italian Conference on Artificial Intelligence, volume LNAI 1792, pages 178-189. Springer-Verlag, 2000.
7. P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In Proceedings 12th International Joint Conference on Artificial Intelligence, pages 331-337, Sidney, Australia, 1991.
8. W. Cohen. A PAC-learning algorithm for a restricted class of recursive logic programs. In Proceedings 10th National Conference On Artificial Intelligence, Washington, DC, 1993.
9. J.M. Crawford and L.D Auton. Experimental results on the crossover point in random 3-SAT. Artificial Intelligence, 81:31-58, 1996.
10. C.J. Date. An Introduction to Database Systems. Addison-Wesley, 1995.
11. T.G. Dietterich. Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation, 10 (7):1895-1924, 1998.
12. B. Dolsak, I. Bratko, and A. Jezeraik. Application of machine learning in finite element computation. In R.S. Michalski, I. Bratko, and M. Kubat, editors, Machine Learning and Data Mining, pages 147-171. Wiley, 1998.
13. S. Džeroski, S. Muggleton, and S. Russell. PAC-learnability of determinate logic programs. In Proceedings of COLT-92, pages 128-134, Pittsburgh, PA, 1992.
14. I.P. Gent and T. Walsh. The TSP phase transition. Artificial Intelligence, 88:349-358, 1996.
15. A. Giordana and L. Saitta. Phase transitions in relational learning. Machine Learning, 41(2):17-251, 2000.
16. A. Giordana, L. Saitta, and F. Bergadano. Enigma: A system that learns diagnostic knowledge. IEEE Transactions on Knowledge and Data Engineering, KDE-5:15-28, February 1993.
17. A. Giordana, L. Saitta, M. Sebag, and M. Botta. Analyzing relational learning in the phase transition framework. In 17th International Conference on Machine Learning, pages 311-318, Stanford, CA, July 2000. Morgan Kaufmann.
18. T. Hogg, B.A. Huberman, and C.P. Williams, editors. Artificial Intelligence: Special Issue on Frontiers in Problem Solving: Phase Transitions and Complexity, volume 81(1-2). Elsevier, 1996a.
19. T. Hogg, B.A. Huberman, and C.P. Williams. Phase transitions and the search problem. Artificial Intelligence, 81:1-15, 1996b.
20. R. Holte, L. Acker, and B. Porter. Concept learning and the problem of small disjuncts. In Proceedings of the 11th International Joint Conference on Artificial Intelligence, volume 1, pages 813-818, Detroit, MI, 1989. Morgan Kaufmann.
21. M.J. Kearns and U.V. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
22. R. Khardon. Learning first order universal Horn expression. In Proceedings of COLT-98, pages 154-165, Madison, WI, 1998.
23. J.U. Kietz and K. Morik. A polynomial approach to the constructive induction of structural knowledge. Machine Learning, 14:193-218, 1994.
24. R.D. King, A. Srinivasan, and M.J.E. Stenberg. Relating chemical activity to structure: an examination of ILP successes. New Generation Computing, 13:411-433, 1995.
25. J. Maloberti and M. Sebag. Theta-subsumption in a constraint satisfaction perspective. In Proceedings of Inductive Logic Programming, pages 164-178. Springer Verlag, LNAI 2157, 2001.
26. R. Michalski. A theory and methodology of inductive learning. In R. Michalski, J. Carbonell, and T. Mitchell, editors, Machine Learning: An Artificial Intelligence Approach, pages 83-134, Los Altos, CA, 1983. Morgan Kaufmann.
27. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In 10th National Conference on Artificial Intelligence, pages 459-465. MIT Press, 1992.
28. T.M. Mitchell. Generalization as search. Artificial Intelligence, 18:203-226, 1982.
29. T.M. Mitchell. Machine Learning. McGraw Hill, 1997.
30. S. Muggleton, editor. Inductive Logic Programming. Academic Press, London, UK, 1992.
31. S. Muggleton. Inverse entailment and PROGOL. New Gen. Comput., 13:245-286, 1995.
32. S. Muggleton and L. De Raedt. Inductive logic programming: theory and methods. Journal of Logic Programming, 19/20:629-679, 1994.
33. S. Muggleton and C. Feng. Efficient induction of logic programs. In S. Muggleton, editor, Inductive Logic Programming. Academic Press, London, UK, 1992.
34. S. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming. Springer Verlag, 1997.
35. M.J. Pazzani and D. Kibler. The utility of knowledge in inductive learning. Machine Learning, 9: 57-94, 1992.
36. G. Plotkin. A note on inductive generalization. In Machine Intelligence, volume 5, pages 153-163. Edinburgh University Press, 1970.
37. P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81:81-110, 1996.
38. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5:239-266, 1990.
39. R.J. Quinlan. Induction of decision trees. Machine Learning, 1:81-106, 1986.
40. J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
41. M. Sebag and C. Rouveirol. Resource-bounded relational reasoning: Induction and deduction through stochastic matching. Machine Learning, 38:41-62, 2000.
42. B.M. Smith and M.E. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:155-181, 1996.
43. L.G. Valiant. A theory of the learnable. Communications of the ACM, 27:1134-1142, 1984.
44. T. Walsh. The constrainedness knife-edge. In Proceedings of the 15th National Conference on Artificial Intelligence, pages 406-411, Madison, WI, 1998.
45. C.P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117, 1994.