Download:
|
by John M. Zelle, Raymond J. Mooney, Joshua B. Konvisser
in Proceedings of the Eleventh International Conference on Machine Learning ML-94, Morgan-Kaufmann
ftp://ftp.cs.utexas.edu/pub/mooney/papers/chill-ml-94.ps.gz
Add To MetaCart
Abstract:
This paper describes a new method for inducing logic programs from examples which attempts to integrate the best aspects of existing ILP methods into a single coherent framework. In particular, it combines a bottomup method similar to Golem with a topdown method similar to Foil. It also includes a method for predicate invention similar to Champ and an elegant solution to the "noisy oracle " problem which allows the system to learn recursive programs without requiring a complete set of positive examples. Systematic experimental comparisons to both Golem and Foil on a range of problems are used to clearly demonstrate the advantages of the approach. 1
Citations
|
843
|
Efficient induction of logic programs
– Muggleton, Feng
- 1990
|
|
747
|
Learning logical definitions from relations
– Quinlan
- 1990
|
|
371
|
A further note on inductive generalization
– Plotkin
- 1971
|
|
154
|
Machine invention of first-order predicates by inverting resolution
– Muggleton, Buntine
- 1988
|
|
136
|
Mechanisms of sentence processing: Assigning roles to constituents of sentences
– McClelland, Kawamoto
- 1986
|
|
80
|
Learning logical de nitions from relations
– Quinlan
- 1990
|
|
64
|
Learning semantic grammars with constructive inductive logic programming
– Zelle, Mooney
- 1993
|
|
52
|
Efficient top-down induction of logic programs
– Cameron-Jones, Quinlan
- 1994
|
|
44
|
Discrimination-based constructive induction of logic programs
– Kijsirikul, Numao, et al.
- 1992
|
|
42
|
Extensions of inversion of resolution applied to theory completion
– Rouveirol
- 1992
|
|
33
|
Constraints on Predicate Invention
– Wirth, O'Rorke
- 1991
|
|
29
|
Sub-unification : A tool for efficient induction of recursive programs
– Lapointe, Matwin
- 1992
|
|
27
|
E cient induction of logic programs
– Muggleton, Feng
- 1992
|
|
18
|
Machine invention of rst-order predicates by inverting resolution
– Muggleton, Buntine
- 1988
|
|
13
|
Two methods for improving inductive logic programming systems
– Stahl, Tausend, et al.
- 1993
|
|
11
|
Learning by failure to prove
– Wirth
- 1988
|
|
9
|
Learning theoretical terms
– Banerji
- 1992
|
|
6
|
Sub-uni cation: A tool for e cient induction of recursive programs
– Lapointe, Matwin
- 1992
|
|
4
|
Pac-learning a resticted class of recursive logic programs
– Cohen
- 1993
|