- Extends use of kernels from real-valued data to discrete data
- Particular focus is on graphs which gets a particular type of kernel called the diffusion kernel “… which are based on the heat equation and can be regarded as the discretization of the familiar Gaussian kernel of Euclidian space.”
- Kernels allow for a mapping into Hilbert space where the kernel is an inner product. With respect to a basis a datapoint is mapped to many (potentially infinite) number of features – this expansion makes a number of operation simpler
- “… adjacency graphs are sometimes used when data is expected to be confined to a manifold of lower dimensionality that the original space.”
- Kernels must be symmetric and positive semi-definite
- “Constructing appropriate positive definite kernels is not a simple task, and this has largely been the reason why, with a few exceptions, kernel methods have mostly been confined to Euclidian spaces…”

- When working in discrete spaces, the most common approach with kernels has been to find some mapping from the discrete to continuous spaces (for example, transforming a text to a bag/count of words)
- The kernels they propose for graphs they call
*diffusion kernels* - Start out with a kernel for discrete data called exponential kernels
- In discrete case, positive semi-definiteness means:
*∑*_{x ∈ X}∑_{x’ ∈ X}f_{x}f_{x’}K(x,x’) ≥ 0

- In the discrete case, for ﬁnite
*X*, the kernel can be uniquely represented by an |*X*| × |*X*| matrix (which we shall denote by the same letter*K*) with rows and columns indexed by the elements of*X*, and related to the kernel by K_{xx’}= K(x,x’).” - Defines the exponential of a square matrix – the exponential of any symmetric matrix is symmetric positive semi-definite so it may be used as a kernel
**Tensor products and conjugacy**<that passed me by>- Onto diffusion kernels on graphs
**For a graph Γ, the heat equation***H*<is a matrix> s.t.*H*= :_{ij}- 1 if
*i*is connected by an edge to*j* - –
*d*if_{i}*i=j*, where d_{i}is the degree of vertex*i* - 0 otherwise

- 1 if
**The negative of this is the graph Laplacian of Γ***H*can be regarded as an approximator, and*H*/*h*^{2}approaches the continuous laplacian as*h*→ 0**In physics this equation is used to approximate the diffusion of heat (and other substances) through a continuous media**.

**The resulting kernels***HK*_{β}are called diffusion kernels or heat kernels- “To the best of our knowledge, diffusion kernels have not been proposed previously for direct use in kernel-based learning algorithms.”
- This extends simply to unweighted graphs as well as symmetric graphs
- <
**But what about assymetric graphs?**>

- <
- Equations for unweighted <I suppose undirected> graphs, closed chains, trees
- These can be used “… as building blocks for tensor product kernels.”
- For example, bit (or over any discrete alphabet) strings can be composed in this way to generate a Hamming distance
- Other methods of string distances for looking for contiguous substrings. The kernel used approaches a result obtained by dynamic programming

- In the first set of experiments diffusion kernels are used for classification “For such problems, it is often quite unnatural to encode the data as vectors in Euclidean space to allow the use of standard kernels. However as our experiments show, even simple diffusion kernels on the hypercube, as described in Section 4.4, can result in good performance for such data.”
- “Data sets “having a majority of categorical variables were chose; any continuous features were ignored.”
- Used “voted perceptron” for training <don’t know what that is>
- Diffusion and Hamming kernels were used. “The reduction in error rate varies, but the simple diffusion kernel generally performs well.”
- <
**I’m not sure what conclusion I’m supposed to draw from these results – where are the comparisons to other algorithms? Compares well to Hamming distance? I would have liked to see results from other more impressive approaches.**>

- “We showed how the explicit calculation of diffusion kernels is possible for specific families of graphs, and how the kernels correspond to standard Gaussian kernels in a continuous limit.”
- “While the tensor product construction allows one to incrementally build up more powerful kernels from simple components, explicit formulas will be difficult to come by in general.”

Advertisements
(function(g,$){if("undefined"!=typeof g.__ATA){
g.__ATA.initAd({collapseEmpty:'after', sectionId:26942, width:300, height:250});
g.__ATA.initAd({collapseEmpty:'after', sectionId:114160, width:300, height:250});
}})(window,jQuery);
var o = document.getElementById('crt-843620710');
if ("undefined"!=typeof Criteo) {
var p = o.parentNode;
p.style.setProperty('display', 'inline-block', 'important');
o.style.setProperty('display', 'block', 'important');
Criteo.DisplayAcceptableAdIfAdblocked({zoneid:388248,containerid:"crt-843620710",collapseContainerIfNotAdblocked:true,"callifnotadblocked": function () {var o = document.getElementById('crt-843620710'); o.style.setProperty('display','none','important');o.style.setProperty('visbility','hidden','important'); } });
} else {
o.style.setProperty('display', 'none', 'important');
o.style.setProperty('visibility', 'hidden', 'important');
}
var o = document.getElementById('crt-1501140059');
if ("undefined"!=typeof Criteo) {
var p = o.parentNode;
p.style.setProperty('display', 'inline-block', 'important');
o.style.setProperty('display', 'block', 'important');
Criteo.DisplayAcceptableAdIfAdblocked({zoneid:837497,containerid:"crt-1501140059",collapseContainerIfNotAdblocked:true,"callifnotadblocked": function () {var o = document.getElementById('crt-1501140059'); o.style.setProperty('display','none','important');o.style.setProperty('visbility','hidden','important'); } });
} else {
o.style.setProperty('display', 'none', 'important');
o.style.setProperty('visibility', 'hidden', 'important');
}