Sciweavers

ILP
2004
Springer

On Avoiding Redundancy in Inductive Logic Programming

13 years 10 months ago
On Avoiding Redundancy in Inductive Logic Programming
ILP systems induce first-order clausal theories performing a search through very large hypotheses spaces containing redundant hypotheses. The generation of redundant hypotheses may prevent the systems from finding good models and increases the time to induce them. In this paper we propose a classification of hypotheses redundancy and show how expert knowledge can be provided to an ILP system to avoid it. Experimental results show that the number of hypotheses generated and execution time are reduced when expert knowledge is used to avoid redundancy.
Nuno A. Fonseca, Vítor Santos Costa, Fernan
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where ILP
Authors Nuno A. Fonseca, Vítor Santos Costa, Fernando M. A. Silva, Rui Camacho
Comments (0)