kFOIL: learning simple relational kernels
national conference on artificial intelligence(2006)
摘要
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.
更多查看译文
关键词
system foil,well-known inductive logic programming,dynamic propositionalization approach,simple relational kernel,inductive logic programming,kernel method,feature space,well-known benchmarks,foil search,resulting kernel,kfoil algorithm,support vector machine
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络