Abstract
Most ILP systems employ the covering algorithm whereby hypotheses are constructed iteratively clause by clause. Typically the covering algorithm is greedy in the sense that each iteration adds the best clause according to some local evaluation criterion. Some typical problems of the covering algorithm are: unnecessarily long hypotheses, difficulties in handling recursion, difficulties in learning multiple predicates. This paper investigates a non-covering approach to ILP, implemented as a Prolog program called HYPER, whose goals were: use intensional background knowledge, handle recursion well, and enable multi-predicate learning. Experimental results in this paper may appear surprising in the view of the very high combinatorial complexity of the search space associated with the non-covering approach.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bratko, I., Grobelnik, M. (1993) Inductive learning applied to program construction and verification. Proc. ILP Workshop 93, Bled, Slovenia.
Grobelnik, M. (1992) Markus-an optimised model inference system. Proc. ECAI Workshop on Logical Approaches to Machine Learning, Vienna.
Muggleton, S. (1995) Inverse entailment and Progol. New Generation Computing, 13 (1995), 245–286.
Pompe, U. (1998) Constraint Inductive Logic Programming. Ph.D. Thesis, University of Ljubljana, Faculty of Computer and Info. Sc. (In Slovenian).
Quinlan, J.R. (1990) Learning logical definitions from relations. Machine Learning, 5 (1990), 239–266.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bratko, I. (1999). Refining Complete Hypotheses in ILP. In: Džeroski, S., Flach, P. (eds) Inductive Logic Programming. ILP 1999. Lecture Notes in Computer Science(), vol 1634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48751-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-48751-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66109-2
Online ISBN: 978-3-540-48751-7
eBook Packages: Springer Book Archive