Abstract
In this paper, we give an algorithm for computing the value of the kernel function K TERM , which takes a pair of terms in first-order logic as its inputs, and facilitates Support Vector Machines classifying terms in a higher dimension space. The value of K TERM (s,t) is given as the total number of terms which subsume both s and t. The algorithm presented in the paper computes K TERM (s,t) without enumerating all such terms. We also implement the algorithm and present some experimental examples of classification of first-order terms with K TERM . Furthermore, we also propose the concept of intentional kernels as a generalization of K TERM .
This is a preview of subscription content, log in via an institution to check access.
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
Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and other kernel-based learning methods. Cambridge University Press, Cambridge (2000)
Gärtner, T.: A survey of kernel for structured data. SIGKDD Explorations 5(1), 268–275 (2003)
Gärtner, T., Lloyd, J.W., Flach, P.A.: Kernels and distances for structured data. Machine Learning 57(3), 205–232 (2004)
Haussler, D.: Convolution kernels on discrete structures. Technical report, University of California - Santa Cruz (1999)
Joachims, T.: Making large-scale support vector machine learning practical. In: Schölkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel Methods: Support Vector Machines, pp. 169–184. MIT Press, Cambridge (1998)
Khardon, R., Roth, D., Servedio, R.: Efficiency versus convergence of boolean kernels for on-line learning. Advances in Neural Information Processing Systems 14, 423–430 (2002)
Muggleton, S., Lodhi, H., Amini, A., Sternberg, M.J.E.: Support vector inductive logic programming. In: Proceedings of the Eighth International Conference on Discovery Science, pp. 163–175 (2005)
Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. Springer, Heidelberg (1997)
Plotkin, G.D.: A note on inductive generalization. Machine Intelligence 5, 153–163 (1970)
Sadohara, K.: Learning of boolean functions using support vector machine. In: Proceedings of the 12th International Conference on Algorithmic Learning Theory, pp. 106–118 (2001)
Sadohara, K.: On a capacity control using boolean functions. In: Proceedings of the 2002 IEEE International Conference on Data Mining, pp. 410–417 (2002)
Yamamoto, A., Tanaka, T.: Kernel functions for first-order terms based on anti-unification. SIG-FPAI-A503, JSAI, pp. 75–79 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doi, K., Yamashita, T., Yamamoto, A. (2007). An Efficient Algorithm for Computing Kernel Function Defined with Anti-unification. In: Muggleton, S., Otero, R., Tamaddoni-Nezhad, A. (eds) Inductive Logic Programming. ILP 2006. Lecture Notes in Computer Science(), vol 4455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73847-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-73847-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73846-6
Online ISBN: 978-3-540-73847-3
eBook Packages: Computer ScienceComputer Science (R0)