Extension of the Top-Down Data-Driven Strategy to ILP

  • Authors:
  • Erick Alphonse;Céline Rouveirol

  • Affiliations:
  • LIPN-CNRS UMR 7030, Université Paris 13, France;LIPN-CNRS UMR 7030, Université Paris 13, France

  • Venue:
  • Inductive Logic Programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several upgrades of Attribute-Value learning to Inductive Logic Programming have been proposed and used successfully. However, the Top-Down Data-Driven strategy, popularised by the AQfamily, has not yet been transferred to ILP: if the idea of reducing the hypothesis space by covering a seed example is utilised with systems like PROGOL, Aleph or MIO, these systems do not benefit from the associated data-driven specialisation operator. This operator is given an incorrect hypothesis hand a covered negative example eand outputs a set of hypotheses more specific than hand correct wrt e. This refinement operator is very valuable considering heuristic search problems ILP systems may encounter when crossing plateaus in relational search spaces. In this paper, we present the data-driven strategy of AQ, in terms of a lgg-based change of representation of negative examples given a positive seedexample, and show how it can be extended to ILP. We evaluate a basic implementation of AQin the system Propalon a number of benchmark ILP datasets.