Skip to main content

An extended transformation approach to inductive logic programming

Nada Lavrac, Peter A. Flach, An extended transformation approach to inductive logic programming. ACM Transactions on Computational Logic, 2 (4). ISSN 1529-3785, pp. 458–494. October 2001. PDF, 303 Kbytes. External information

Abstract

Inductive logic programming (ILP) is concerned with learning relational descriptions that typically have the form of logic programs. In a transformation approach, an ILP task is transformed into an equivalent learning task in a different representation formalism. Propositionalization is a particular transformation method, in which the ILP task is compiled to an attribute-value learning task. The main restriction of propositionalization methods such as LINUS is that they are unable to deal with nondeterminate local variables in the body of hypothesis clauses. In this paper we show how this limitation can be overcome., by systematic first-order feature construction using a particular individual-centered feature bias. The approach can be applied in any domain where there is a clear notion of individual. We also show how to improve upon exhaustive first-order feature construction by using a relevancy filter. The proposed approach is illustrated on the ?trains? and ?mutagenesis? ILP domains.

Bibtex entry.

Contact details

Publication Admin