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.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.