Abstract
Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis covering positive examples and excluding negative examples. It uses first-order logic as a uniform representation for examples and hypothesis. In this paper we propose a method to boost any ILP learning algorithm by first decomposing the set of examples to subsets and applying the learning algorithm to each subset separately, second, merging the hypotheses obtained for the subsets to get a single hypothesis for the complete set of examples, and finally refining this single hypothesis to make it shorter. The proposed technique significantly outperforms existing approaches.
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
Barabási, A.L., Réka, A.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Barták, R., Kuželka, O., Železný, F.: Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem. Technical Report WS-10-08 (WARA), pp. 2–7. AAAI Press (2010)
Chovanec, A.: Constraint satisfaction for inductive logic programming. Master Thesis, Charles University in Prague (2011)
Ginsberg, M.L., Harvey, W.D.: Iterative broadening. Artificial Intelligence 55(2), 367–383 (1992)
Gottlob, G., Leone, N., Scarcello, F.: On the complexity of some inductive logic programming problems. New Generation Computing 17, 53–75 (1999)
Maloberti, J., Sebag, M.: Fast Theta-Subsumption with Constraint Satisfaction Algorithms. Machine Learning 55, 137–174 (2004)
Muggleton, S., De Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming 19, 629–679 (1994)
Plotkin, G.: A note on inductive generalization. Machine Intelligence 5, 153–163 (1970)
Scheffer, T., Herbrich, R., Wysotzki, F.: Efficient Q-Subsumption Based on Graph Algorithms. In: Muggleton, S. (ed.) ILP 1996. LNCS (LNAI), vol. 1314, pp. 212–228. Springer, Heidelberg (1997)
Srinivasan, A.: The Aleph Manual (2012), http://www.comlab.ox.ac.uk/activities/machinelearning/Aleph/aleph.html (accessed January 23, 2012)
Wysotzki, F., Kolbe, W., Selbig, J.: Concept Learning by Structured Examples - An Algebraic Approach. In: Proceedings of the 7th International Joint Conference on Artificial Intelligence (IJCAI 1981), pp. 153–158. Morgan Kaufmann (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chovanec, A., Barták, R. (2012). Decomposition, Merging, and Refinement Approach to Boost Inductive Logic Programming Algorithms. In: Ramsay, A., Agre, G. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2012. Lecture Notes in Computer Science(), vol 7557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33185-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-33185-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33184-8
Online ISBN: 978-3-642-33185-5
eBook Packages: Computer ScienceComputer Science (R0)