Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting

We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap between traditional inductive logic programming (ILP) representations and statistical approaches to supervised learning. Logic programs are first used to generate proofs of given visitor programs that use predicates declared in the available background knowledge. A kernel is then defined over pairs of proof trees. The method can be used for supervised learning tasks and is suitable for classification as well as regression. We report positive empirical results on Bongard-like and M -of- N problems that are difficult or impossible to solve with traditional ILP techniques, as well as on real bioinformatics and chemoinformatics data sets. [abs] [ pdf ][ bib ] &copy JMLR 2006. ( edit, beta )

Authors

• Andrea Passerini
• Paolo Frasconi
• Luc De Raedt KU Leuven Örebro University

Keywords

No keywords are indexed for this paper.