Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Muggleton, S.: Inductive logic programming. In: Proceedings of the 1st Conference on Algorithmic Learning Theory, Ohmsma, Tokyo, Japan, pp. 43–62 (1990)
Sebag, M., Rouveirol, C.: Tractable induction and classification in first order logic via stochastic matching. In: 15th Int. Join Conf. on Artificial Intelligence (IJCAI 1997), pp. 888–893. Morgan Kaufmann, San Francisco (1997)
Camacho, R.: Improving the efficiency of ilp systems using an incremental language level search. In: Annual Machine Learning Conference of Belgium and the Netherlands (2002)
Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., Vandecasteele, H.: Improving the efficiency of Inductive Logic Programming through the use of query packs. Journal of Artificial Intelligence Research 16, 135–166 (2002)
Costa, V.S., Srinivasan, A., Camacho, R., Blockeel, H., Van Laer, W.: Query transformations for improving the efficiency of ilp systems. In: JMLR (2002)
Camacho, R.: As lazy as it can be. In: Doherty, P., Tassen, B., Ala-Siuru, P., Mayoh, B. (eds.) The Eighth Scandinavian Conference on Artificial Intelligence (SCAI 2003), Bergen, Norway, pp. 47–58 (November 2003)
Dehaspe, L., De Raedt, L.: Parallel inductive logic programming. In: Proceedings of the MLnet Familiarization Workshop on Statistics, Machine Learning and Knowledge Discovery in Databases (1995)
Matsui, T., Inuzuka, N., Seki, H., Itoh, H.: Comparison of three parallel implementations of an induction algorithm. In: 8th Int. Parallel Computing Workshop, Singapore, pp. 181–188 (1998)
van der Laag, P.R.J.: An analysis of refinement operators in inductive logic programming. PhD thesis, Erasmus Universiteit, Rotterdam, the Netherlands (1995)
Shapiro, E.Y.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)
Srinivasan, A., King, R.D., Bain, M.E.: An empirical study of the use of relevance information in inductive logic programming. In: JMLR (2003)
Srinivasan ,A.: Aleph manual (2003)
Hogger, C.J.: Essentials of Logic Programming. Oxford University Press, Oxford (1990)
Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS, vol. 1228. Springer, Heidelberg (1997)
Gottlob, G., Fermuller, C.G.: Removing redundancy from a clause. Artificial Intelligence 61(2), 263–289 (1993)
Muggleton, S., Firth, J.: Relational rule induction with cprogol4.4: A tutorial introduction. In: Dzeroski, S., Lavrac, N. (eds.) Relational Data Mining, September 2001, pp. 160–188. Springer, Heidelberg (2001)
Camacho, R.: Inducing Models of Human Control Skills using Machine Learning Algorithms. PhD thesis, Department of Electrical Engineering and Computation, Universidade do Porto (2000)
Fonseca, N., Camacho, R., Silva, F., Costa, V.S.: Induction with April: A preliminary report. Technical Report DCC-2003-02, DCC-FC, Universidade do Porto (2003)
Muggleton, S., Feng, C.: Efficient induction in logic programs. In: Muggleton, S. (ed.) Inductive Logic Programming, pp. 281–298. Academic Press, London (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fonseca, N., Costa, V.S., Silva, F., Camacho, R. (2004). On Avoiding Redundancy in Inductive Logic Programming. In: Camacho, R., King, R., Srinivasan, A. (eds) Inductive Logic Programming. ILP 2004. Lecture Notes in Computer Science(), vol 3194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30109-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-30109-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22941-4
Online ISBN: 978-3-540-30109-7
eBook Packages: Springer Book Archive