University of Cambridge > Talks.cam > Inference Group > Inductive Logic Programming and Kernel methods

Inductive Logic Programming and Kernel methods

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact David MacKay.

With the introduction of kernel methods, statistical approaches to machine learning have increasingly become the focus of research: Kernel methods routinely outperform other approaches at classification in terms of accuracy, and rest on a well-understood and long-researched statistical basis. However, each application to a problem requires the manual definition of a meaningful kernel given expert knowledge to achieve good separability. While Inductive Logic Programming (ILP) has long been established as a versatile tool for hypothesis generation given expert knowledge especially given structured data, on its own it performs poorly on noisy / numeric data. Proposals have been made and experimentally validated to combine the two approaches- using ILP to extract the features on which SVMs can then operate. This talk aims to highlight the advantages of such hybrid approaches, introduce some relevant work, and discuss open challenges / areas of subsequent research.

This talk is part of the Inference Group series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity