Abstract
We introduce a family of kernels on graphs based on the notion of regularization operators. This generalizes in a natural way the notion of regularization and Greens functions, as commonly used for real valued functions, to graphs. It turns out that diffusion kernels can be found as a special case of our reasoning. We show that the class of positive, monotonically decreasing functions on the unit interval leads to kernels and corresponding regularization operators.
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
Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Technical Report TR-2002-01, The University of Chichago (January 2002)
Chung-Graham, F.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, vol. 92. AMS (1997)
Chung-Graham, F., Yau, S.T.: Discrete green’s functions. Journal of Combinatorial Theory 91, 191–214 (2000)
Dunford, N., Schwartz, J.: Linear operators. Pure and applied mathematics, vol. 7. Interscience Publishers, New York (1958)
Ellis, R.: Discrete green’s functions for products of regular graphs. Technical report, University of California at San Diego (2002) (Preliminary Report)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42(6), 1115–1145 (1995)
Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)
Kondor, R.S., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: Proceedings of the ICML (2002)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, Stanford University, Stanford, CA, USA (November 1998)
Shi, J., Malik, J.: Normalized cuts and image segmentation. In: IEEE Conf. Computer Vision and Pattern Recognition (June 1997)
Smola, A., Schölkopf, B., Müller, K.-R.: The connection between regularization operators and support vector kernels. Neural Networks 11, 637–649 (1998)
Torr, P.H.S.: Solving Markov random fields using semidefinite programming. In: Artificial Intelligence and Statistics AISTATS (2003)
Weiss, Y.: Segmentation using eigenvectors: A unifying view. In: International Conference on Computer Vision ICCV, pp. 975–982 (1999)
Williams, C.K.I.: Prediction with Gaussian processes: From linear regression to linear prediction and beyond. In: Jordan, M. (ed.) Learning and Inference in Graphical Models, pp. 599–621. MIT Press, Cambridge (1999)
Zheng, A., Ng, A., Jordan, M.: Stable eigenvector algorithms for link analysis. In: Croft, W., Harper, D., Kraft, D., Zobel, J. (eds.) Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, pp. 258–266. ACM Press, New York (2001)
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
Smola, A.J., Kondor, R. (2003). Kernels and Regularization on Graphs. In: Schölkopf, B., Warmuth, M.K. (eds) Learning Theory and Kernel Machines. Lecture Notes in Computer Science(), vol 2777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45167-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-45167-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40720-1
Online ISBN: 978-3-540-45167-9
eBook Packages: Springer Book Archive