Fast theta-subsumption with constraint satisfaction algorithms

Machine Learning

Volumn 55, Issue 2, 2004, Pages 137-174

  Maloberti, Jérôme ^a   Sebag, Michèle ^a  

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

Author keywords

Constraint satisfaction; K locality; Meta learning; Phase transition; Relational learning

Indexed keywords

EID: 22944441060     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1023/B:MACH.0000023150.80092.40     Document Type: Article

References (55)

1. Alphonse, E., & Rouveirol, C. (2000). Lazy propositionalisation for relational learning. In W. Horn (Ed.), Proceedings of the 14th European Conference on Artificial Intelligence, ECAI'00 (pp. 256-260). IOS Press.
2. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In J. B. Bocca, M. Jarke, & C. Zaniolo (Eds.), Proceedings of the 20th Int. Conf. Very Large Data Bases, VLDB (pp. 487-499). Morgan Kaufmann.
3. Augier, S. (2000). Apprentissage Supervisé relationnel par algorithmes d'évolution. PhD thesis, Université de Paris 11 - Orsay.
4. Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., & Vandecasteele, H. (2000). Executing query packs in ILP. In Proceedings of the 10th International Conference on Inductive Logic Programming, LNAI 1866 (pp. 60-77). Berlin: Springer-Verlag.
5. Brazdil, P., Gama, J., & Henery, B. ( 1994). Characterizing the applicability of classification algorithms using meta-level learning. In Proceedings of the 7th European Conference on Machine Learning (pp. 83-102). Lecture Notes in Artificial Intelligence, Springer.
6. Botta, M., Giordana, A., Saitta, L., & Sebag, M. (2003). Relational learning as search in a critical region. Journal of Machine Learning Research, 4, 431-463.
7. Bensusan, H., & Kalousis, A. (2001). Estimating the predictive accuracy of a classifier. In P. Flach, & L. De Raedt (Eds.), Proceedings of the 12th European conference on machine learning (pp. 25-36). Springer Verlag.
8. Blake, C., Keogh, E., & Merz, C.J. (1998). UCI Repository of machine, learning databases. http://www.ics. uci.edu/∼mlearn/ MLRepository.html.
9. Bessière, C. & Régin, J.-C. (1996). Mac and combined heuristics: Two reasons to forsake FC (and CBJ ?) on hard problems. In Proceedings of the 2nd Int. Conf. on Principles and Practice of Constraint Programming (pp. 61-75).
10. Blockeel, H., & De Raedt, L. (1998). Top-down induction of first order logical decision trees. Artificial Intelligence, 101:1/2, 285-297.
11. Chen, X. (2000). A theoretical comparison of selected CSP solving and modeling techniques. PhD thesis, University of Alberta, Canada.
12. Cheeseman, P., Kanefsky, B., & Taylor, W.M. (1991). Where the really hard problems are. In Proceedings of Int. Joint Conf. on Artificial Intelligence, IJCAI'91 (pp. 331-337).
13. Costa, V., Srinivasan, A., Camacho, R., Blockeel, H., Demoen, B., Janssens, G., Struyf, J., Vandecasteele, H., & Van Laer, W. (2004). Query transformations for improving the efficiency of ILP systems. Journal of Machine Learning Research, 4, 465-491.
14. Dzeroski, S., & Lavrac, N. (Eds.). (2001). Relational data mining. Springer Verlag. Dolsak, D., & Muggleton, S. (1991). The application of ILP to finite element mesh design. In S. Muggleton (Ed.),
15. Proceedings of the First International Workshop on Inductive Logic Programming (pp. 453-472).
16. Dechter, R., & Pearl, J. (1989). Tree clustering for constraint networks. Artificial Intelligence, 38, 353-366.
17. Dehaspe, L., & De Raedt, L. (1997). Mining association rules in multiple relations. In Proceedings of the 7th International Workshop on Inductive Logic Programming, LNCS 1297 (pp. 125-132). Berlin: Springer-Verlag.
18. Esposito, F., Fanizzi, N., Ferilli, S., & Semeraro, G. (2000). Ideal theory refinement under object identity. In P. Langley (Ed.), Proceedings of the 17th International Conference, on Machine. Learning (pp. 263-270). Morgan Kaufmann.
19. Fürnkranz, J., & Petrak, J. (2001). An evaluation of landmarking variants. Technical report, Austrian Research Institute for Artificial Intelligence.
20. Gomes, C.P., Selman, B., Crato, N., & Kautz, H.A. (2000). Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24:1/2, 67-100.
21. Gyssens, M., Jeavons, P.G., & Cohen, D.A. (1994). Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66, 57-89.
22. Gottlob, G., & Leitsch, A. (1985). On the efficiency of subsumption algorithms. Journal of the Association forComputing Machinery, 32:2, 280-295.
23. Gottlob, G., Leone, N., & Scarcello, F. (2000). A comparison of structural CSP decomposition methods. Artificial Intelligence, 124:2, 243-282.
24. Gent, I.P., MacIntyre, E., Prosser, P., & Walsh, T. (1996). The constrainedness of search. In AAAI/IAAI, vol. 1 (pp. 246-252).
25. Giordana, A., & Saitta, L. (2000). Phase transitions in relational learning. Machine Learning, 2, 217-251.
26. Hogg, T., Huberman, B.A., & Williams, C.P. (Eds.). (1996). Artificial intelligence: Special issue on frontlers in problem solving: Phase, transitions and complexity, vol. 81(1/2), Elsevier.
27. Hirata, K. (2003). On condensation of a clause. In T. Horvath, & A. Yamamoto (Eds.), Proceedings of the 15th Int. Conf. on Inductive Logic. Programming, LNAI (pp. 164-179). Springer-Verlag.
28. Hogg, T. (1996). Refining the phase transition in combinatorial search. Artificial Intelligence, 81, 127-154.
29. Kalousis, A. (2002). Algorithm Selection via Meta-Learning. PhD thesis, Université de Genève, Centre Universitaire d'Informatique.
30. Kietz, J.-U., & Lübbe, M. (1994). An efficient subsumption algorithm for inductive logic programming. In W. Cohen, & H. Hirsh (Eds.), Proceedings of the 11th International Conference on Machine Learning (pp. 130137). Morgan Kaufmann.
31. Kramer, S., Lavrac, N., & Flach, P. (2001). Propositionalization approaches to relational data mining. In S. Dzeroski, & N. Lavrac (Eds.), Relational data mining (pp. 262-291). Springer-Verlag.
32. King, R.D., Srinivasan, A., & Sternberg, M.J.E. (1995). Relating chemical activity to structure: An examination of ILP successes. New Gen. Comput., 13.
33. Lachiche, N. & Flach, P.A. (2003). A true first-order bayesian classifier. In S. Matwin (Ed.), Proceedings of the 14th Int. Conf. on Inductive Logic Programming, LNAI (pp. 133-148). Springer.
34. Lloyd, J. (2003). Logic for learning: Learning comprehensive theories from structured data. Springer-Verlag.
35. Mackworth, A.K. (1977). Consistency in networks of relations. Artificial Intelligence, 8, 99-118.
36. Mauro, N., Basile, T.M.A., Ferilli, S., Esposito, F., & Fanizzi, N. (2003). An exhaustive matching procedure for the improvement of learning efficiency. In T. Horvath, & A. Yamamoto (Eds.), Proceedings of the 15th Int. Conf. on Inductive Logic Progmmming, LNAI (pp. 112-129). Springer-Verlag.
37. Muggleton, S., & De Raedt, L. (1994). Inductive logic programming: Theory and methods. Journal of Logic Programming, 19, 629-679.
38. Maloberti, J., & Sebag, M. (2001). Theta-subsumption in a constraint satisfaction perspective. In C. Rouveirol, & M. Sebag (Eds.), Proceedings of the. 13th Inductive Logic Programming, LNAI 2157 (pp. 164-178). SpringerVerlag.
39. Maloberti, J., & Suzuki, E. (2003). Improving efficiency of frequent query discovery by eliminating non-relevant candidates. In Proceedings of the 6th International Conference on Discovery Science (DS 2003), LNAI 2843 (pp. 219-231), Berlin, Heidelberg, New York, Springer-Verlag.
40. Muggleton, S. (1995). Inverse entailment and PROGOL. New Gen. Comput., 13, 245-286.
41. Nienhuys-Cheng, S., & de Wolf, R. (1997). Foundations of inductive logic pmgramming. Springer-Verlag.
42. Nédellec, C., Rouveirol, C., Adé, H., Bergadano, F., & Tausend, B. (1996). Declarative bias in ILP. In L. de Raedt (Ed.), Advances in ILP (pp. 82-103). IOS Press.
43. Pfahringer, B., Bensusan, H., & Giraud-Carrier, C. (2000). Meta-learning by landmarking various learning algorithms. In Proceedings of the 17th International Conference, on Machine. Learning (pp. 743-750). Morgan Kaufmann.
44. Peña-Castillo, L., & Wrobel, S. (2002). Macro-operators in multirelational learning: A search-space reduction technique. In H. Mannila et al. (Eds.), Proceedings of the 13th European Conference on Machine Learning, LNCS 2430 (pp. 357-368). Berlin: Springer-Verlag.
45. Plotkin, G. (1970). A note on inductive generalization. In B. Meltzer, & D. Michie (Eds.), Machine Intelligence, vol. 5 (pp. 153-163). Edinburgh University Press.
46. Prosser, P. (1993). Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9, 268299.
47. Quinlan, J.R. (1990). Learning logical definitions from, relations. Machine Learning, 5:3, 239-266.
48. De Raedt, L. (1997). Logical settings for concept learning. Artificial Intelligence, 95:1, 187-201.
49. De Raedt, L., & Bruynooghe, M. (1993). A theory of clausal discovery. In Proceedings of Int. Joint Conf. on Artificial Intelligence, IJCAI'93 (pp. 1058-1063). Morgan Kaufmann.
50. Read, R.C., & Corneil, D.G. (1977). The graph isomorph disease. Journal of Graph Theory, 1, 339-363.
51. Robinson, J. (1965). A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:1, 2341.
52. Scheffer, T., Herbrich, R., & Wysotzki, F. (1997). Efficient θ-subsumption based on graph algorithms. In S. Muggleton (Ed.), Proceedings Int. Workshop on Inductive Logic Programming (pp. 212-228). SpringerVerlag.
53. Sebag, M., & Rouveirol, C. (2000). Resource-bounded relational reasoning: Induction and deduction through stochastic matching. Machine Learning, 38, 41-62.
54. Srinivasan, A. (1997). The predictive toxicology evaluation challenge. In Pmceedings of Int. Joint Conf. on Artificial Intelligence, IJCAI'97 (pp. 4-8). Morgan Kaufmann.
55. Srinivasan, A. (2001). The Aleph manual, http://web.comlab.ox.ac.uk/oucl/ research/areas/machlearn/Aleph/. Tsang, E. (1993). Foundations of constraint satisfaction. Academic Press.