A Walk-Based Semantically Enriched Tree Kernel Over Distributed Word Representations

A Feature-Enriched Tree Kernel for Relation Extraction

Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited

Random walk kernels have been introduced in seminal work on graph learning and were later largely superseded by kernels based on the Weisfeiler-Leman test for graph isomorphism. We give a unified view on both classes of …

Convergence of random walks to Brownian motion on cubical complexes

Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove t…

QESK: Quantum-based Entropic Subtree Kernels for Graph Classification

In this paper, we propose a novel graph kernel, namely the Quantum-based Entropic Subtree Kernel (QESK), for Graph Classification. To this end, we commence by computing the Average Mixing Matrix (AMM) of the Continuous-t…

Random walk kernels and learning curves for Gaussian process regression on random graphs

We consider learning on graphs, guided by kernels that encode similarity between vertices. Our focus is on random walk kernels, the analogues of squared exponential kernels in Euclidean spaces. We show that on large, loc…