Browse our site
You are here:
Efficient learning and evaluation of complex ...
Efficient learning and evaluation of complex concepts in Inductive Logic Programming
Wednesday, 7th of April 2010, 14h00
FCT/UNL, Seminar Room (Ed. II)
Inductive Logic Programming (ILP) is a Machine Learning approach with foundations in Logic Programming. The problem pecification and the models discovered by ILP systems are both represented as Prolog programs allowing for great expressiveness and flexibility. However, this flexibility comes at a high computational cost and ILP systems are known for their difficulty in scaling-up. Constructing and evaluating complex concepts are two of the main problems that prevent ILP systems from tackling many of the most interesting learning problems.Large concepts cannot be constructed or evaluated simply by parallelizing existing top-down search algorithms or improving the underlying Prolog engine.Novel search strategies and cover algorithms are needed. The main focus of this talk is on how to efficiently construct and evaluate such complex hypotheses in an ILP setting.Namely, we will present an efficient theta-subsumption algorithm that improves over Prolog's SLD-resolution by several orders of magnitude. We will also show how a new bottom-up search strategy coupled with this efficient subsumption algorithm led to the discovery of a better model for a protein-binding application problem.
Keywords: Inductive Logic Programming, theta-subsumption, search strategies
José Santos did his undergraduate in Computer Engineering at FCT/UNL (2004) and a master degree in Artificial Intelligence at the same institution (2006). He is expected to finish his PhD in Computer Science at Imperial College, London, later this year. More information at: http://www.doc.ic.ac.uk/~jcs06
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541