kFOIL: learning simple relational kernels

  • Authors:
  • Niels Landwehr;Andrea Passerini;Luc De Raedt;Paolo Frasconi

  • Affiliations:
  • Machine Learning Lab, Department of Computer Science, Albert-Ludwigs Universität Freiburg, Germany;Machine Learning and Neural Networks Group, Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Florence, Italy;Machine Learning Lab, Department of Computer Science, Albert-Ludwigs Universität Freiburg, Germany;Machine Learning and Neural Networks Group, Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Florence, Italy

  • Venue:
  • AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 well-known benchmarks in chemoinformatics show the promise of the approach.