Abstract
Learning from structured data is becoming increasingly important. However, most prior work on kernel methods has focused on learning from attribute-value data. Only recently have researchers started investigating kernels for structured data. This paper describes how kernel definitions can be simplified by identifying the structure of the data and how kernels can be defined on this structure. We propose a kernel for structured data, prove that it is positive definite, and show how it can be adapted in practical applications.
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
A. Ben-Hur, D. Horn, H. T. Siegelmann, and V. Vapnik. Support vector clustering. Journal of Machine Learning Research, 2:125–137, Dec. 2001.
E. Bloedorn, R. Michalski, and J. Wnek. Matching methods with problems: A comparative analysis of constructive induction approaches. Technical report, Machine Learning and Inference Laboratory, MLI 94-2, George Mason University, Fairfax, VA., 1994.
B. E. Boser, I. M. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In D. Haussler, editor, Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, pages 144–152, Pittsburgh, PA, July 1992. ACM Press.
A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.
N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines (and Other Kernel-Based Learning Methods). Cambridge University Press, 2000.
T. G. Dietterich, R. H. Lathrop, and T. Lozano-Pérez. Solving the multiple instance problem with axis-parallel rectangles. Artificial Intelligence, 89(1–2):31–71, 1997.
T. Gärtner. Kernel-based feature space transformation in inductive logic programming. Master’s thesis, University of Bristol, 2000.
T. Gärtner, P. A. Flach, A. Kowalczyk, and A. J. Smola. Multi-instance kernels. In C. Sammut and A. Hoffmann, editors, Proceedings of the 19th International Conference on Machine Learning, pages 179–186. Morgan Kaufmann, June 2002.
D. Haussler. Convolution kernels on discrete structures. Technical report, Department of Computer Science, University of California at Santa Cruz, 1999.
T. Horváth, S. Wrobel, and U. Bohnebeck. Relational instance-based learning with lists and terms. Machine Learning, 43(1/2):53–80, Apr. 2001.
S. P. Jones and J. Hughes, editors. Haskell98: A Non-Strict Purely Functional Language. Available at http://haskell.org/.
J. Lloyd. Knowledge representation, computation, and learning in higher-order logic. Available at http://csl.anu.edu.au/~jwl, 2001.
D. Michie, S. Muggleton, D. Page, and A. Srinivasan. To the international computing community: A new eastwest challenge. Technical report, Oxford University Computing laboratory, Oxford,UK, 1994.
J. Ramon and M. Bruynooghe. A polynomial time computable metric between point sets. Acta Informatica, 37(10):765–780, 2001.
B. Schölkopf and A. J. Smola. Learning with Kernels. The MIT Press, 2002.
I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques with Java implementations. Morgan Kaufmann, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gärtner, T., Lloyd, J.W., Flach, P.A. (2003). Kernels for Structured Data. In: Matwin, S., Sammut, C. (eds) Inductive Logic Programming. ILP 2002. Lecture Notes in Computer Science(), vol 2583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36468-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-36468-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00567-4
Online ISBN: 978-3-540-36468-9
eBook Packages: Springer Book Archive