A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On Avoiding Redundancy in Inductive Logic Programming
[chapter]
2004
Lecture Notes in Computer Science
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
doi:10.1007/978-3-540-30109-7_13
fatcat:5nqimiv3m5efbb5o7rgxczgr24