Timezone: »

 
Poster
The Multiscale Laplacian Graph Kernel
Risi Kondor · Horace Pan

Wed Dec 07 09:00 AM -- 12:30 PM (PST) @ Area 5+6+7+8 #186
in Wednesday Posters »

Many real world graphs, such as the graphs of molecules, exhibit structure at multiple different scales, but most existing kernels between graphs are either purely local or purely global in character. In contrast, by building a hierarchy of nested subgraphs, the Multiscale Laplacian Graph kernels (MLG kernels) that we define in this paper can account for structure at a range of different scales. At the heart of the MLG construction is another new graph kernel, called the Feature Space Laplacian Graph kernel (FLG kernel), which has the property that it can lift a base kernel defined on the vertices of two graphs to a kernel between the graphs. The MLG kernel applies such FLG kernels to subgraphs recursively. To make the MLG kernel computationally feasible, we also introduce a randomized projection procedure, similar to the Nystro ̈m method, but for RKHS operators.

Keywords: Kernel Methods · Graph-based Learning
[ PDF] 

Author Information

Risi Kondor (The University of Chicago)
Horace Pan (UChicago)

More from the Same Authors