Improving inductive logic programming by using simulated annealing

Information Sciences

Volumn 178, Issue 6, 2008, Pages 1423-1441

  Serrurier, Mathieu ^a   Prade, Henri ^a  

^a UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

Inductive logic programming; Neighborhood of clause; Simulated annealing

Indexed keywords

LEARNING ALGORITHMS; PROBLEM SOLVING; SIMULATED ANNEALING;

ANNEALING FRAMEWORK; EXPERIMENTATION RESULTS; NEIGHBORHOOD OF CLAUSE;

LOGIC PROGRAMMING;

EID: 38349038397     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.10.015     Document Type: Article

References (38)

1. Aarts E., and Korst J. Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing (1989), John Wiley & Sons
2. Aarts E.H.L., and Van Laarhoven P.J.M. Statistical cooling: a general approach to combinatorial optimisation problems. Philips Journal of Research 40 (1985) 193-226
3. Badea L. Refinement operator can be (weakly) perfect. In: Dzeroski S., and Flach P. (Eds). Proceedings of the 9th International Conference of Inductive Logic Programming, ILP 1999. LNAI vol. 1634 (1999), Springer 21-32
4. Badea L. A refinement operator for theories. In: Rouveirol C., and Sebag M. (Eds). Proceedings of the 11th International Conference of Inductive Logic Programming, ILP 2001 (2001), Springer 1-14
5. Bratko I. Refining complete hyphotesys in ILP. In: Dzeroski S., and Flach P. (Eds). Proceedings of the 9th International Conference of Inductive Logic Programming, ILP 1999. LNAI vol. 1634 (1999), Springer 44-55
6. Braund A., and Vrain C. A genetic algorithm for propositionalization. In: Rouveirol C., and Sebag M. (Eds). Proceedings of the 11th International Conference of Inductive Logic Programming, ILP 2001 (2001), Springer 27-40
7. De Raedt L., and Bruynooghe M. A theory of clausal discovery. In: Bajcsy R. (Ed). Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93) (1993), Morgan Kaufmann 1058-1063
8. N. Friedman, L. Getoor, D. Koller, A. Pfeffer, Learning probabilistic relational models, in: Proceedings of the 16th International Joint Conference on Artificial Intelligence, 1999.
9. Giordana A., and Neri F. Search-intensive concept induction. Evolutionary Computation 3 4 (1995) 375-416
10. Giordana A., and Sale C. Learning structured concepts using genetic algorithms. In: Sleeman D., and Edwards P. (Eds). The 9th International Workshop on Machine Learning (1992), Morgan Kaufmann
11. Golden R. Mathematical Methods for Neural Network Analysis and Design (1996), MIT Press
12. Hajek B. Cooling schedules for optimal annealing. Mathematics of Operations Research 13 (1988) 311-329
13. Halpern J. An analysis of first-order logics of probability. Artificial Intelligence 46 (1990) 310-355
14. Hekanaho J. DOGMA: A GA-based relational learner. Proceedings of the 8th International Conference on Inductive Logic Programming (1998), Springer 205-214
15. Hitzler P., Hlldobler S., and Seda A. Logic. Programs and connectionist networks. Journal of Applied Logic 2 (2004) 245-272
16. Kietz J.U. Learnability of description logic programs. In: Matwin S., and Sammut C. (Eds). Proceedings of the 12th International Conference of Inductive Logic Programming, ILP 2002 (2002), Springer 117-132
17. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
18. Kravitz S., and Rutenbar R. Placement by simulated annealing on a multiprocessor. IEEE Transactions on Computer Aided Design 6 (1987) 534-549
19. Lavrac N., Flach P., and Zupan B. Rule evaluation measures: a unfifying view. In: Dzeroski S., and Flach P. (Eds). Proceedings of the 9th International Conference of Inductive Logic Programming, ILP 1999. LNAI vol. 1634 (1999), Springer 174-185
20. Liang F. Annealing stochastic approximation Monte Carlo algorithm for neural network training. Machine Learning 68 (2007) 201-233
21. McCulloch W., and Pitt W. A logical calculus of ideas imminent in nervous activity. Bulletin of Mathematical Biophysics 5 (1943)
22. Muggleton S. Learning structure and parameters of stochastic logic programs. In: Matwin S., and Sammut C. (Eds). Proceedings of the 12th International Conference on Inductive Logic Programming. Lecture Notes in Artificial Intelligence vol. 2583 (2003), Springer-Verlag 198-206
23. Muggleton S.H. Inverse entailment and Progol. New Generation Computing 13 (1995) 245-286
24. Muggleton S.H., and De Raedtm L. Inductive logic programming: theory and methods. New Generation Computing 19 20 (1994) 629-680
25. Nienhuys-Cheng S.-H., and de Wolf R. Foundations of Inductive Logic Programming. LNAI vol. 1228 (1997), Springer
26. Quinlan J.R. Learning logical definitions from relations. Machine Learning 5 (1990) 239-266
27. Quinlan J.R. C4.5: Program for Machine Learning (1993), Morgan Kaufman
28. B.L. Richards, R.J. Mooney, Learning relations by pathfinding, in: Proceedings of the AAAI Conference, AAAI 1992, 1992, pp. 50-55.
29. M. Serrurier, H. Prade, Coping with exceptions in multiclass ILP problems using possibilistic logic, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), 2005, pp. 1761-1764.
30. Serrurier M., Prade H., and Richard G. A simulated annealing framework for ILP. In: Camacho R., King R., and Srinivasan A. (Eds). Proceedings of ILP 2004. LNAI vol. 3194 (2004), Springer 288-304
31. E.Y. Shapiro, Inductive inference from facts. Research report 193, Yale University, 1981. Reprinted in computational research, J.-L. Lassez, G. Plopkin (Eds.), MIT Press, MA, 1991, 1981.
32. T. Sheffer, R. Herbrich, Unbiased learning assessments of learning algorithms, in: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), 1997, pp. 698-803.
33. A. Srinivasan, R. King, S. Muggleton, The role of background knowledge: using a problem from chemistry to examine the performance of an ILP program, Technical Report PRG-TR-08-99, Oxford university Computing Laboratory, Oxford, 1999.
34. Tamaddoni-Nezhad A., and Muggleton S.H. Searching the subsumption lattice by a genetic algorithm. In: Cussens J., and Frish A. (Eds). Proceedings of the 10th International Conference of Inductive Logic Programming, ILP 2000 (2000), Springer 243-252
35. Tamaddoni-Nezhad A., and Muggleton S.H. A genetic algorithms approach to ILP. In: Matwin S., and Sammut C. (Eds). Proceedings of the 12th International Conference of Inductive Logic Programming, ILP 2002 (2002), Springer 285-300
36. P.R.J. van der Laag, An analysis of refinement operators in inductive logic programming, PhD thesis, Erasmus Universiteit, Rotterdam, the Netherlands, 1995.
37. Vapnik V.N. The Nature of Statistical Learning Theory (1995), Springer-Verlag, New York, Inc., New York, NY, USA
38. Zelezny F., Srinivasan A., and Page D. Lattice-search runtime distributions may be heavy-tailed. In: Matwin S., and Sammut C. (Eds). Proceedings of the 12th International Conference of Inductive Logic Programming, ILP 2002 (2002), Springer 333-345