Skip navigation
Skip navigation

Kernels and Regularization of Graphs

Smola, Alexander; Kondor, Risi

Description

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.

CollectionsANU Research Publications
Date published: 2003
Type: Conference paper
URI: http://hdl.handle.net/1885/88664
Source: Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington DC, USA, August 24-27, 2003

Download

File Description SizeFormat Image
01_Smola_Kernels_and_Regularization_of_2003.pdf540.12 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator