Title: kFOIL: Learning simple relational kernels
Authors: Landwehr, Niels
Passerini, Andrea
De Raedt, Luc
Frasconi, Paolo #
Issue Date: 2006
Publisher: AAAI Press
Host Document: Proceedings of the Twenty-First National Conference on Artificial Intelligence pages:389-394
Conference: AAAI 2006 edition:21 location:Boston, MA, USA date:July 16-20
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.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Non-KU Leuven Association publications
# (joint) last author

Files in This Item:
File Description Status SizeFormat
paper.pdfMain Paper Published 161KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.