QG/GA: A stochastic search for Progol

Machine Learning

Volumn 70, Issue 2-3, 2008, Pages 121-133

  Muggleton, Stephen ^a   Tamaddoni Nezhad, Alireza ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Genetic Algorithms; Refinement; Stochastic search

Indexed keywords

GENETIC ALGORITHMS; GRAPH THEORY; STANDARDS;

REFINEMENT; STOCHASTIC SEARCH;

RANDOM PROCESSES;

EID: 37849037799     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-007-5029-3     Document Type: Conference Paper

References (19)

1. 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.
2. Haussler, D., Kearns, M., & Shapire, R. (1994). Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension. Machine Learning, 14(1), 83-113.
3. Inoue, K. (2001). Induction, abduction and consequence-finding. In C. Rouveirol & M. Sebag (Eds.), Lecture notes in artificial intelligence : Vol. 2157. Proceedings of the eleventh international workshop on inductive logic programming (ILP01) (pp. 65-79). Berlin: Springer.
4. Ito, K., & Yamamoto, A. (1998). Finding hypotheses from examples by computing the least generalization of bottom clauses. In S. Arikawa & H. Motoda (Eds.), Lecture notes in artificial intelligence : Vol. 1532. Proceedings of discovery science '98 (pp. 303-314). Berlin: Springer.
5. King, R., Muggleton, S., Srinivasan, A., & Sternberg, M. (1996). Structure-activity relationships derived by machine learning: the use of atoms and their bond connectives to predict mutagenicity by inductive logic programming. Proceedings of the National Academy of Sciences, 93, 438-442.
6. Kovacic, M. (1994). Stochastic inductive logic programming. PhD thesis, University of Ljubljana, Ljubljana, Slovenia.
7. Mitchell, T. (1997). Machine learning. New York: McGraw-Hill.
8. Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing, 13, 245-286.
9. Muggleton, S. H., & Feng, C. (1990). Efficient induction of logic programs. In Proceedings of the first conference on algorithmic learning theory (pp. 368-381). Tokyo: Ohmsha.
10. Paes, A., Zelezny, F., Zaverucha, G., Page, D., & Srinivasan, A. (2006). ILP through Propositionalization and Stochastic k-term DNF learning. In S. Muggleton, R. Otero, & A. Tamaddoni-Nezhad (Eds.), Proceedings of the 16th international conference on inductive logic programming (pp. 379-393). Berlin: Springer.
11. Page, D., & Srinivasan, A. (2003). ILP: a short look back and a longer look forward. Journal of Machine Learning Research, 4, 415-430.
12. Ray, O., Broda, K., & Russo, A. (2003). Hybrid abductive inductive learning: a generalization of Progol. In Lecture notes in artificial intelligence : Vol. 2835. 13th international conference on inductive logic programming (pp. 311-328). Berlin: Springer.
13. Ruckert, U., & Kramer, S. (2003). Stochastic local search in k-term DNF learning. In Proceedings of the 20th international conference on machine learning (pp. 648-655).
14. Sebag, M., & Rouveirol, C. (2000). Resource-bounded relational reasoning: Induction and deduction through stochastic matching. Machine Learning, 38, 43-65.
15. Srinivasan, A. (2000). A study of two probabilistic methods for searching large spaces with ILP (Technical Report PRG-TR-16-00). Oxford University Computing Laboratory, Oxford.
16. Srinivasan, A. (2005). Five problems in five areas for five years. In S. Kramer & B. Pfahringer (Eds.), Lecture notes in artificial intelligence : Vol. 3625. Proceedings of the 15th international conference on inductive logic programming (p. 424). Berlin: Springer.
17. Tamaddoni-Nezhad, A., & Muggleton, S. H. (2000). Searching the subsumption lattice by a genetic algorithm. In J. Cussens & A. Frisch (Eds.), Proceedings of the 10th international conference on inductive logic programming (pp. 243-252). Berlin: Springer.
18. Tamaddoni-Nezhad, A., & Muggleton, S. H. (2002). A genetic algorithms approach to ILP. In Proceedings of the 12th international conference on inductive logic programming (pp. 285-300). Berlin: Springer.
19. Zelezny, F., Srinivasan, A., & Page, D. (2004). A Monte Carlo study of randomised restarted search in ILP. In Lecture notes in artificial intelligence : Vol. 3194. Proceedings of the 14th international conference on inductive logic programming (pp. 341-358). Berlin: Springer.