Sciweavers

Share
AAAI
2006

kFOIL: Learning Simple Relational Kernels

10 years 4 months ago
kFOIL: Learning Simple Relational Kernels
A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FOIL with kernel methods. The feature space is constructed by leveraging FOIL search for a set of relevant clauses. The search is driven by the performance obtained by a support vector machine based on the resulting kernel. In this way, kFOIL implements a dynamic propositionalization approach. Both classification and regression tasks can be naturally handled. Experiments in applying kFOIL to wellknown benchmarks in chemoinformatics show the promise of the approach.
Niels Landwehr, Andrea Passerini, Luc De Raedt, Pa
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where AAAI
Authors Niels Landwehr, Andrea Passerini, Luc De Raedt, Paolo Frasconi
Comments (0)
books