Abstract
In this paper we explain the fundamental idea of designing a class of kernel functions, called the intentional kernel, for structured data. The intentional kernel is designed with the property that every structured data is defined by derivation. Derivation means transforming a data or an expression into another. Typical derivation can be found in the field of formal language theory: A grammar defines a language in the sense that a sequence belongs to a language if it is transformed from a starting symbol by repeated application of the production rules in the grammar. Another example is in mathematical logic: A formula is proved if it is obtained from axioms by repeated application of inference rules. Combining derivation with the kernel-based learning mechanism derives the class of the intentional kernel.
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)
Doi, K., Yamashita, T., Yamamoto, A.: An Efficient Algorithm for Computing Kernel Function Defined with Anti-unification. In: Muggleton, S., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol. 4455, pp. 139–153. Springer, Heidelberg (2007)
Gärtner, T.: A Survey of Kernel for Structured Data. SIGKDD Explorations 5(1), 268–275 (2003)
Haussler, D.: Convolution Kernels on Discrete Structures, Technical Report UCS-CRL-99-10, University of California - Santa Cruz (1999)
Khardon, R., Roth, D., Servedio, R.: Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms. Journal of Artificial Intelligence Research 24, 341–356 (2005)
Laird, P.D.: Learning from Good and Bad Data. Kluwer Academic Publishers, Dordrecht (1988)
Lassez, J.-L., Maher, M.J., Marriott, K.: Unification Revisited. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 587–626. Morgan-Kaufman, San Francisco (1988)
Muggleton, S., Lodhi, H., Amini, A., Sternberg, M.J.E.: Support Vector Inductive Logic Programming. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds.) DS 2005. LNCS (LNAI), vol. 3735, pp. 163–175. Springer, Heidelberg (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: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol. 2225, pp. 106–118. Springer, Heidelberg (2001)
Sadohara, K.: On a Capacity Control Using Boolean Kernels for the Learning of Boolean Functions. In: Proceedings of the IEEE International Conference on Data Mining, pp. 410–417 (2002)
Sankoh, H., Doi, K., Yamamoto, A.: An Intentional Kernel Function for RNA Classification. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) DS 2007. LNCS (LNAI), vol. 4755, pp. 281–285. Springer, Heidelberg (2007)
Scholkopf, B., Smola, A.J.: Learning With Kernels: Support Vector Machines, Regularization, Optimization and Beyond. MIT Press, Cambridge (2001)
Shapiro, E.Y.: Inductive Inference of Theories From Facts, Technical Report 192, Department of Computer Science, Yale University (1981); also in: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic, pp. 199–254.The MIT Press, Cambridge (1991)
Yamamoto, A.: Inductive Logic Programming: Yet Another Application of Logic. In: Umeda, M., Wolf, A., Bartenstein, O., Geske, U., Seipel, D., Takata, O. (eds.) INAP 2005. LNCS (LNAI), vol. 4369, pp. 102–116. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doi, K., Yamamoto, A. (2009). Kernel Functions Based on Derivation. In: Chawla, S., et al. New Frontiers in Applied Data Mining. PAKDD 2008. Lecture Notes in Computer Science(), vol 5433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00399-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-00399-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00398-1
Online ISBN: 978-3-642-00399-8
eBook Packages: Computer ScienceComputer Science (R0)