Kernels and regularization on graphs

513Citations
Citations of this article
395Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Smola, A. J., & Kondor, R. (2003). Kernels and regularization on graphs. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2777, pp. 144–158). Springer Verlag. https://doi.org/10.1007/978-3-540-45167-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free