Propagation kernels: efficient graph kernels from propagated information
 2.5k Downloads
 11 Citations
Abstract
We introduce propagation kernels, a general graphkernel framework for efficiently measuring the similarity of structured data. Propagation kernels are based on monitoring how information spreads through a set of given graphs. They leverage earlystage distributions from propagation schemes such as random walks to capture structural information encoded in node labels, attributes, and edge information. This has two benefits. First, offtheshelf propagation schemes can be used to naturally construct kernels for many graph types, including labeled, partially labeled, unlabeled, directed, and attributed graphs. Second, by leveraging existing efficient and informative propagation schemes, propagation kernels can be considerably faster than stateoftheart approaches without sacrificing predictive performance. We will also show that if the graphs at hand have a regular structure, for instance when modeling image or video data, one can exploit this regularity to scale the kernel computation to large databases of graphs with thousands of nodes. We support our contributions by exhaustive experiments on a number of realworld graphs from a variety of application domains.
Keywords
Learning with graphs Graph kernels Random walks Locality sensitive hashing Convolutions1 Introduction
Learning from structured data is an active area of research. As domains of interest become increasingly diverse and complex, it is important to design flexible and powerful methods for analysis and learning. By structured data we refer to situations where objects of interest are structured and hence can naturally be represented using graphs. Realworld examples are molecules or proteins, images annotated with semantic information, text documents reflecting complex content dependencies, and manifold data modeling objects and scenes in robotics. The goal of learning with graphs is to exploit the rich information contained in graphs representing structured data. The main challenge is to efficiently exploit the graph structure for machinelearning tasks such as classification or retrieval. A popular approach to learning from structured data is to design graph kernels measuring the similarity between graphs. For classification or regression problems, the graph kernel can then be plugged into a kernel machine, such as a support vector machine or a Gaussian process, for efficient learning and prediction.

missing information leading to partially labeled graphs,

uncertain information arising from aggregating information from multiple sources, and

continuous information derived from complex and possibly noisy sensor measurements.
Surprisingly, existing work on graph kernels does not broadly account for these challenges. Most of the existing graph kernels (Shervashidze et al. 2009, 2011; Hido and Kashima 2009; Kashima et al. 2003; Gärtner et al. 2003) are designed for unlabeled graphs or graphs with a complete set of discrete node labels. Kernels for graphs with continuous node attributes have only recently gained greater interest (Borgwardt and Kriegel 2005; Kriege and Mutzel 2012; Feragen et al. 2013). These graph kernels have two major drawbacks: they can only handle graphs with complete label or attribute information in a principled manner and they are either efficient, but limited to specific graph types, or they are flexible, but their computation is memory and/or time consuming. To overcome these problems, we introduce propagation kernels. Their design is motivated by the observation that iterative information propagation schemes originally developed for withinnetwork relational and semisupervised learning have two desirable properties: they capture structural information and they can often adapt to the aforementioned issues of realworld data. In particular, propagation schemes such as diffusion or label propagation can be computed efficiently and they can be initialized with uncertain and partial information.
A highlevel overview of the propagation kernel algorithm is as follows. We begin by initializing label and/or attribute distributions for every node in the graphs at hand. We then iteratively propagate this information along edges using an appropriate propagation scheme. By maintaining entire distributions of labels and attributes, we can accommodate uncertain information in a natural way. After each iteration, we compare the similarity of the induced node distributions between each pair of graphs. Structural similarities between graphs will tend to induce similar local distributions during the propagation process, and our kernel will be based on approximate counts of the number of induced similar distributions throughout the information propagation.
To achieve competitive running times and to avoid having to compare the distributions of all pairs of nodes between two given graphs, we will exploit locality sensitive hashing (lsh) to bin the label/attribute distributions into efficiently computable graph feature vectors in time linear in the total number of nodes. These new graph features will then be fed into a base kernel, a common scheme for constructing graph kernels. Whereas lsh is usually used to preserve the \(\ell ^1\) or \(\ell ^2\) distance, we are able to show that the hash values can preserve both the total variation and the Hellinger probability metrics. Exploiting explicit feature computation and efficient information propagation, propagation kernels allow for using graph kernels to tackle novel applications beyond the classical benchmark problems on datasets of chemical compounds and small to mediumsized image or pointcloud graphs.
The present paper is a significant extension of a previously published conference paper (Neumann et al. 2012) and presents and extends a novel graphkernel application already published as a workshop contribution (Neumann et al. 2013). Propagation kernels were originally defined and applied for graphs with discrete node labels (Neumann et al. 2012, 2013); here we extend their definition to a more general and flexible framework that is able to handle continuous node attributes. In addition to this expanded view of propagation kernels, we also introduce and discuss efficient propagation schemes for numerous classes of graphs. A central message of this paper is:
A suitable propagation scheme is the key to designing fast and powerful propagation kernels.
In particular, we will discuss propagation schemes applicable to huge graphs with regular structure, for example grid graphs representing images or videos. Thus, implemented with care, propagation kernels can easily scale to large image databases. The design of kernels for grids allows us to perform graphbased image analysis not only on the scene level (Neumann et al. 2012; Harchaoui and Bach 2007) but also on the pixel level opening up novel application domains for graph kernels.
We proceed as follows. We begin by touching upon related work on kernels and graphs. After introducing information propagation on graphs via random walks, we introduce the family of propagation kernels (Sect. 4). The following two sections discuss specific examples of the two main components of propagation kernels: node kernels for comparing propagated information (Sect. 5) and propagation schemes for various kinds of information (Sect. 6). We will then analyze the sensitivity of propagation kernels with respect to noisy and missing information, as well as with respect to the choice of their parameters. Finally, to demonstrate the feasibility and power of propagation kernels for large realworld graph databases, we provide experimental results on several challenging classification problems, including commonly used bioinformatics benchmark problems, as well as realworld applications such as imagebased plantdisease classification and 3d object category prediction in the context of robotic grasping.
2 Kernels and graphs
Propagation kernels are related to three lines of research on kernels: kernels between graphs (graph kernels) developed within the graph mining community, kernels between nodes (kernels on graphs) established in the withinnetwork relational learning and semisupervised learning communities, and kernels between probability distributions.
2.1 Graph kernels
Propagation kernels are deeply connected to several graph kernels developed within the graphmining community. Categorizing graph kernels with respect to how the graph structure is captured, we can distinguish four classes: kernels based on walks (Gärtner et al. 2003; Kashima et al. 2003; Vishwanathan et al. 2010; Harchaoui and Bach 2007) and paths (Borgwardt and Kriegel 2005; Feragen et al. 2013), kernels based on limitedsize subgraphs (Horváth et al. 2004; Shervashidze et al. 2009; Kriege and Mutzel 2012), kernels based on subtree patterns (Mahé and Vert 2009; Ramon and Gärtner 2003), and kernels based on structure propagation (Shervashidze et al. 2011). However, there are two major problems with most existing graph kernels: they are often slow or overly specialized. There are efficient graph kernels specifically designed for unlabeled and fully labeled graphs (Shervashidze et al. 2009, 2011), attributed graphs (Feragen et al. 2013), or planar labeled graphs (Harchaoui and Bach 2007), but these are constrained by design. There are also more flexible but slower graph kernels such as the shortest path kernel (Borgwardt and Kriegel 2005) or the common subgraph matching kernel (Kriege and Mutzel 2012).
The Weisfeiler–Lehman (wl) subtree kernel, one instance of the recently introduced family of wlkernels (Shervashidze et al. 2011), computes count features for each graph based on signatures arising from iterative multiset label determination and compression steps. In each kernel iteration, these features are then fed into a base kernel. The wlkernel is finally the sum of those base kernels over the iterations.
Although wlkernels are usually competitive in terms of performance and runtime, they are designed for fully labeled graphs. The challenge of comparing large, partially labeled graphs—which can easily be considered by propagation kernels introduced in the present paper—remains to a large extent unsolved. A straightforward way to compute graph kernels between partially labeled graphs is to mark unlabeled nodes with a unique symbol or their degree as suggested in Shervashidze et al. (2011) for the case of unlabeled graphs. However, both solutions neglect any notion of uncertainty in the labels. Another option is to propagate labels across the graph and then run a graph kernel on the imputed labels (Neumann et al. 2012). Unfortunately, this also ignores the uncertainty induced by the inference procedure, as hard labels have to be assigned after convergence. A key observation motivating propagation kernels is that intermediate label distributions induced will, before convergence, carry information about the structure of the graph. Propagation kernels interleave label inference and kernel computation steps, avoiding the requirement of running inference to termination prior to the kernel computation.
2.2 Kernels on graphs and withinnetwork relational learning
Measuring the structural similarity of local node neighborhoods has recently become popular for inference in networked data (Kondor and Lafferty 2002; Desrosiers and Karypis 2009; Neumann et al. 2013) where this idea has been used for designing kernels on graphs (kernels between the nodes of a graph) and for withinnetwork relational learning approaches. An example of the former are coinciding walk kernels (Neumann et al. 2013) which are defined in terms of the probability that the labels encountered during parallel random walks starting from the respective nodes of a graph coincide. Desrosiers and Karypis (2009) use a similarity measure based on parallel random walks with constant termination probability in a relaxationlabeling algorithm. Another approach exploiting random walks and the structure of subnetworks for nodelabel prediction is heterogeneous label propagation (Hwang and Kuang 2010). Random walks with restart are used as proximity weights for socalled “ghost edges” in Gallagher et al. (2008), but then the features considered by a bag of logistic regression classifiers are only based on a onestep neighborhood. These approaches, as well as propagation kernels, use random walks to measure structure similarity. Therefore, propagation kernels establish an important connection of graphbased machine learning for inference about node and graphlevel properties.
2.3 Kernels between probability distributions and kernels between sets
Finally, propagation kernels mark another connection, namely between graph kernels and kernels between probability distributions (Jaakkola and Haussler 1998; Lafferty and Lebanon 2002; Moreno et al. 2003; Jebara et al. 2004) and between sets (Kondor and Jebara 2003; Shi et al. 2009). However, whereas the former essentially build kernels based on the outcome of probabilistic inference after convergence, propagation kernels intuitively count common subdistributions induced after each iteration of running inference in two graphs.
Kernels between sets and more specifically between structured sets, also called hash kernels (Shi et al. 2009), have been successfully applied to strings, data streams, and unlabeled graphs. While propagation kernels hash probability distributions and derive count features from them, hash kernels directly approximate the kernel values \(k(x,x')\), where x and \(x'\) are (structured) sets. Propagation kernels iteratively approximate node kernels k(u, v) comparing nodes u in graph \(G^{(i)}\) with nodes v in graph \(G^{(j)}\). Counts summarizing these approximations are then fed into a base kernel that is computed exactly. Before we give a detailed definition of propagation kernels, we introduce the basic concept of information propagation on graphs, and exemplify important propagation schemes and concepts when utilizing random walks for learning with graphs.
3 Information propagation on graphs
Information propagation or diffusion on a graph is most commonly modeled via Markov random walks (rws). Propagation kernels measure the similarity of two graphs by comparing node label or attribute distributions after each step of an appropriate random walk. In the following, we review label diffusion and label propagation via rws—two techniques commonly used for learning on the node level (Zhu et al. 2003; Szummer and Jaakkola 2001). Based on these ideas, we will then develop propagation kernels in the subsequent sections.
3.1 Basic notation
Throughout, we consider graphs whose nodes are endowed with (possibly partially observed) label and/or attribute information. That is, a graph \(G=(V,E,\ell , a)\) is represented by a set of \(V=n\) vertices, a set of edges E specified by a weighted adjacency matrix \(A \in \mathbb {R}^{n \times n}\), a label function \(\ell :V \rightarrow [k]\), where k is the number of available node labels, and an attribute function with \(a:V \rightarrow \mathbb {R}^D\), where D is the dimension of the continuous attributes. Given \(V = \{v_1,v_2,...,v_n\}\), node labels \(\ell (v_i)\) are represented by nominal values and attributes \(a(v_i)=\mathbf {x}_i \in \mathbb {R}^D\) are represented by continuous vectors.
3.2 Markov random walks
Consider a graph \(G = (V,E)\). A random walk on G is a Markov process \(X = \{X_t : t\ge 0 \}\) with a given initial state \(X_0 = v_i\). We will also write \(X_{t\mid i}\) to indicate that the walk began at \(v_i\). The transition probability \(T_{ij} = P(X_{t+1}=v_j \mid X_{t}=v_i)\) only depends on the current state \(X_t=v_i\) and the onestep transition probabilities for all nodes in V can be easily represented by the rownormalized adjacency or transition matrix \(T = D^{1}A\), where \(D = {{\mathrm{diag}}}(\sum _j A_{ij})\).
3.3 Information propagation via random walks
In the case of partially labeled graphs we can now initialize the label distributions for the unlabeled nodes \(V_U\) with some prior, for example a uniform distribution.^{1} If we define the absorbing states to be the labeled nodes, \(S = V_L\), then the label propagation algorithm introduced in Zhu et al. (2003) can be cast in terms of simulating labelabsorbing rws with transition probabilities given in Eq. (2) until convergence, then assigning the most probable absorbing label to the nodes in \(V_U\).
The schemes discussed so far are two extreme cases of absorbing rws: one with no absorbing states, the diffusion process, and one which absorbs at all labeled nodes, label propagation. One useful extension of absorbing rws is to soften the definition of absorbing states. This can be naturally achieved by employing partially absorbing random walks (Wu et al. 2012). As the propagation kernel framework does not require a specific propagation scheme, we are free to choose any rwbased information propagation scheme suitable for the given graph types. Based on the basic techniques introduced in this section, we will suggest specific propagation schemes for (un)labeled, partially labeled, directed, and attributed graphs as well as for graphs with regular structure in Sect. 6.
3.4 Steadystate distributions versus early stopping
Assuming nonbipartite graphs, all rws, absorbing or not, converge to a steadystate distribution \(P_\infty \) (Lovász 1996; Wu et al. 2012). Most existing rwbased approaches only analyze the walks’ steadystate distributions to make nodelabel predictions (Kondor and Lafferty 2002; Zhu et al. 2003; Wu et al. 2012). However, rws without absorbing states converge to a constant steadystate distribution, which is clearly uninteresting. To address this, the idea of early stopping was successfully introduced into poweriteration methods for node clustering (Lin and Cohen 2010), nodelabel prediction (Szummer and Jaakkola 2001), as well as for the construction of a kernel for nodelabel prediction (Neumann et al. 2013). The insight here is that the intermediate distributions obtained by the rws during the convergence process provide useful insights about their structure. In this paper, we adopt this idea for the construction of graph kernels. That is, we use the entire evolution of distributions encountered during rws up to a given length to represent graph structure. This is accomplished by summing contributions computed from the intermediate distributions of each iteration, rather then only using the limiting distribution.
4 Propagation kernel framework
In this section, we introduce the general family of propagation kernels (pks).
4.1 General definition
Here we will define a kernel \(K:\mathcal {X} \times \mathcal {X} \rightarrow \mathbb {R}\) among graph instances \(G^{(i)} \in \mathcal {X} \). The input space \(\mathcal {X}\) comprises graphs \(G^{(i)} = (V^{(i)},E^{(i)},\ell ,a)\), where \(V^{(i)}\) is the set of \(V^{(i)} = n_i\) nodes and \(E^{(i)}\) is the set of edges in graph \(G^{(i)}\). Edge weights are represented by weighted adjacency matrices \(A^{(i)} \in \mathbb {R}^{n_i \times n_i}\) and the label and attribute functions \(\ell \) and a endow nodes with label and attribute information^{2} as defined in the previous section.
Lemma 1
Given that \(k_\ell (u,v)\) and \(k_a(u,v)\) are positive semidefinite node kernels, the propagation kernel \(K_{t_{\textsc {max}}}\) is a positive semidefinite kernel.
Proof
As \(k_\ell (u,v)\) and \(k_a(u,v)\) are assumed to be valid node kernels, k(u, v) is a valid node kernel as the product of positive semidefinite kernels is again positive semidefinite. As for a given graph \(G^{(i)}\) the number of nodes is finite, \(K(G^{(i)}_t, G^{(j)}_t)\) is a convolution kernel (Haussler 1999). As sums of positive semidefinite matrices are again positive semidefinite, the propagation kernel as defined in Eq. (6) is positive semidefinite. \(\square \)

the node kernel k(u, v) comparing propagated information, and

the propagation scheme \(P^{(i)}_{t+1} \leftarrow P^{(i)}_{t}\) propagating the information within the graphs.
4.2 Complexity analysis
The total runtime complexity of propagation kernels for a set of n graphs with a total number of N nodes and M edges is \(\mathcal {O}\bigl ((t_{\textsc {max}}1) M + t_{\textsc {max}} \,n^2\,n^{\star }\bigr )\), where \(n^{\star } := \max _i(n_i)\). For a pair of graphs the runtime complexity of computing the count features, that is, binning the node information and counting the bin strengths is \(\mathcal {O}(n_i + n_j)\). Computing and adding the kernel contribution is \(\mathcal {O}(\text {bins})\), where \(\text {bins}\) is bounded by \(n_i + n_j\). So, one iteration of the kernel computation for all graphs is \(\mathcal {O}(n^2\,n^{\star })\). Note that in practice \(\text {bins} \ll 2 n^{\star }\) as we aim to bin together similar nodes to derive a meaningful feature representation.
Feature computation basically depends on propagating node information along the edges of all graphs. This operation depends on the number of edges and the information propagated, so it is \(\mathcal {O}((k+D)M) = \mathcal {O}(M)\), where k is the number of node labels and D is the attribute dimensionality. This operation has to be performed \(t_{\textsc {max}}1\) times. Note that the number of edges is usually much lower than \(N^2\).
5 Propagation kernel component 1: node kernel
In this section, we define node kernels comparing propagated information appropriate for the use in propagation kernels. Moreover, we introduce locality sensitive hashing, which is used to discretize the distributions arsing from rwbased information propagation as well as the continuous attributes directly.
5.1 Definitions
5.2 Locality sensitive hashing
We now describe our quantization approach for implementing propagation kernels for graphs with nodelabel distributions and continuous attributes. The idea is inspired by locality sensitive hashing (Datar and Indyk 2004) which seeks quantization functions on metric spaces where points “close enough” to each other in that space are “probably” assigned to the same bin. In the case of distributions, we will consider each nodelabel vector as being an element of the space of discrete probability distributions on k items equipped with an appropriate probability metric. If we want to hash attributes directly, we simply consider metrics for continuous values.
Definition 1

if \(d(x, x') < \theta \), then \(\Pr (h(x) = h(x')) > p_1\), and

if \(d(x, x') > c\theta \), then \(\Pr (h(x) = h(x')) < p_2\).
It is known that we can construct lsh families for \(\ell ^p\) spaces with \(p \in (0, 2]\) (Datar and Indyk 2004). Let V be a realvalued random variable. V is called pstable if for any \(\lbrace x_1, x_2,\, \cdots , x_d \rbrace , x_i \in {\mathbb {R}}\) and independently sampled \(v_1, v_2, \cdots , v_d\), we have \(\sum x_i v_i \sim \mathbf {x} _p V\).
6 Propagation kernel component 2: propagation scheme
As pointed out in the introduction, the input graphs for graph kernels may vary considerably. One key to design efficient and powerful propagation kernels is the choice of a propagation scheme appropriate for the graph dataset at hand. By utilizing random walks (rws) we are able to use efficient offtheshelf algorithms, such as label diffusion or label propagation (Szummer and Jaakkola 2001; Zhu et al. 2003; Wu et al. 2012), to implement information propagation within the input graphs. In this section, we explicitly define propagation kernels for fully labeled, unlabeled, partially labeled, directed, and attributed graphs as well as for graphs with a regular grid structure using appropriate rws. In each particular algorithm, the specific parts changing compared to the general propagation kernel computation (Algorithm 1) will be marked in color.
6.1 Labeled and unlabeled graphs
6.2 Partially labeled and directed graphs
To implement propagation kernels between directed graphs, we can proceed as above after simply deriving transition matrices computed from the potentially nonsymmetric adjacency matrices. That is, for the propagation kernel computation only the input changes (marked in green in Algorithm 3). The same idea allows weighted edges to be accommodated; again, only the transition matrix has to be adapted. Obviously, we can also combine partially labeled graphs with directed or weighted edges by changing both the blue and green marked parts accordingly.
6.3 Graphs with continuous node attributes
The computational details of p2k are given in Algorithm 4, where the additional parts compared to Algorithm 1 are marked in blue (computation) and green (input). An extension to Algorithm 4 would be to refit the gms after a couple of propagation iterations. We did not consider refitting in our experiments as the number of kernel iterations \(t_{\textsc {max}}\) was set to 10 or 15 for all datasets—following the descriptions in existing work on iterative graph kernels (Shervashidze et al. 2011; Neumann et al. 2012).
6.4 Grid graphs
One of our goals in this paper is to compute propagation kernels for pixel grid graphs. A graph kernel between grid graphs can be defined such that two grids should have a high kernel value if they have similarly arranged node information. This can be naturally captured by propagation kernels as they monitor information spread on the grids. Naïvely, one could think that we can simply apply Algorithm 3 to achieve this goal. However, given that the space complexity of this algorithm scales with the number of edges and even medium sized images such as texture patches will easily contain thousands of nodes, this is not feasible. For example considering \(100 \times 100\)pixel image patches with an 8neighborhood graph structure, the space complexity required would be 2.4 million units^{3} (floating point numbers) per graph. Fortunately, we can exploit the flexibility of propagation kernels by exchanging the propagation scheme. Rather than label diffusion as used earlier, we employ discrete convolution; this idea was introduced for efficient clustering on discrete lattices (Bauckhage and Kersting 2013). In fact, isotropic diffusion for denoising or sharpening is a highly developed technique in image processing (Jähne 2005). In each iteration, the diffused image is derived as the convolution of the previous image and an isotropic (linear and spaceinvariant) filter. In the following, we derive a space and timeefficient way of computing propagation kernels for grid graphs by means of convolutions.
6.4.1 Basic Definitions
6.4.2 Discrete Convolution
6.4.3 Efficient Propagation Kernel Computation
7 Experimental evaluation
 (Q1)

How sensitive are propagation kernels with respect to their parameters, and how should propagation kernels be used for graph classification?
 (Q2)

How sensitive are propagation kernels to missing and noisy information?
 (Q3)

Are propagation kernels more flexible than stateoftheart graph kernels?
 (Q4)

Can propagation kernels be computed faster than stateoftheart graph kernels while achieving comparable classification performance?
7.1 Datasets
Dataset statistics and properties
Dataset  Properties  

# Graphs  Median # nodes  Max # nodes  Total # nodes  # Node labels  # Graph labels  Attr. dim.  
mutag  188  17.5  28  3371  7  2  \(\) 
nci1  4110  27  111  122,747  37  2  \(\) 
nci109  4127  26  111  122,494  38  2  \(\) 
d&d  1178  241  5748  334,925  82  2  \(\) 
msrc9  221  40  55  8968  10  8  \(\) 
msrc21  563  76  141  43,644  24  20  \(\) 
db  41  964  5037  56,468  5  11  1 
synthetic  300  100  100  30,000  \(\)  2  1 
enzymes  600  32  126  19,580  3  6  18 
proteins  1113  26  620  43,471  3  2  1 
profull  1113  26  620  43,471  3  2  29 
bzr  405  35  57  14,479  10  2  3 
cox2  467  41  56  19,252  8  2  3 
dhfr  756  42  71  32,075  9  2  3 
brodatz  2048  4096  4096  8,388,608  3  32  \(\) 
plants  2957  4725  5625  13,587,375  5  6  \(\) 
7.1.1 Labeled Graphs
For labeled graphs, we consider the following benchmark datasets from bioinformatics: mutag, nci1, nci109, and d&d. mutag contains 188 sets of mutagenic aromatic and heteroaromatic nitro compounds, and the label refers to their mutagenic effect on the Gramnegative bacterium Salmonella typhimurium (Debnath et al. 1991). nci1 and nci109 are anticancer screens, in particular for cell lung cancer and ovarian cancer cell lines, respectively (Wale and Karypis 2006). d&d consists of 1178 protein structures (Dobson and Doig 2003), where the nodes in each graph represent amino acids and two nodes are connected by an edge if they are less than 6 Ångstroms apart. The graph classes are enzymes and nonenzymes.
7.1.2 Partially Labeled Graphs
7.1.3 Attributed Graphs
To evaluate the ability of pks to incorporate continuous node attributes, we consider the attributed graphs used in Feragen et al. (2013), Kriege and Mutzel (2012). Apart from one synthetic dataset (synthetic), the graphs are all chemical compounds (enzymes, proteins, profull, bzr, cox2, and dhfr). synthetic comprises 300 graphs with 100 nodes, each endowed with a onedimensional normally distributed attribute and 196 edges each. Each graph class, A and B, has 150 examples, where in A, 10 node attributes were flipped randomly and in B, 5 were flipped randomly. Further, noise drawn from \(\mathcal {N}(0,0.45^2)\) was added to the attributes in B. proteins is a dataset of chemical compounds with two classes (enzyme and nonenzyme) introduced in Dobson and Doig (2003). enzymes is a dataset of protein tertiary structures belonging to 600 enzymes from the brenda database (Schomburg et al. 2004). The graph classes are their ec (enzyme commission) numbers which are based on the chemical reactions they catalyze. In both datasets, nodes are secondary structure elements (sse), which are connected whenever they are neighbors either in the amino acid sequence or in 3d space. Node attributes contain physical and chemical measurements including length of the sse in Ångstrom, its hydrophobicity, its van der Waals volume, its polarity, and its polarizability. For bzr, cox2, and dhfr—originally used in Mahé and Vert (2009)—we use the 3d coordinates of the structures as attributes.
7.1.4 Point Cloud Graphs
In addition, we consider the object database db,^{7} introduced in Neumann et al. (2013). db is a collection of 41 simulated 3d point clouds of household objects. Each object is represented by a labeled graph where nodes represent points, labels are semantic parts (top, middle, bottom, handle, and usablearea), and the graph structure is given by a knearest neighbor (knn) graph w.r.t. Euclidean distance of the points in 3d space, cf. Fig. 4c. We further endowed each node with a continuous curvature attribute approximated by its derivative, that is, by the tangent plane orientations of its incident nodes. The attribute of node u is given by \(x_{u} = \sum _{v \in \mathcal {N}(u)} 1\mathbf {n}_u \cdot \mathbf {n}_v\), where \(\mathbf {n}_u\) is the normal of point u and \(\mathcal {N}(u)\) are the neighbors of node u. The classification task here is to predict the category of each object. Examples of the 11 categories are glass, cup, pot, pan, bottle, knife, hammer, and screwdriver.
7.1.5 Grid Graphs
We consider a classical benchmark dataset for texture classification (brodatz) and a dataset for plant disease classification (plants). All graphs in these datasets are grid graphs derived from pixel images. That is, the nodes are image pixels connected according to circular symmetric neighbor sets \(N_{r,p}\) as exemplified in Eq. (16). Node labels are computed from the rgb color values by quantization.
The images in plants, introduced in Neumann et al. (2014), are regions showing disease symptoms extracted from a database of 495 rgb images of beet leaves. The dataset has six classes: five disease symptoms cercospora, ramularia, pseudomonas, rust, and phoma, and one class for extracted regions not showing a disease symptom. Figure 5c, d illustrates two regions and their quantized versions (g) and (h). We follow the experimental protocol in Neumann et al. (2014) and use 10 % of the full data covering a balanced number of classes (296 regions) for parameter learning and the full dataset for evaluation. Note that this dataset is highly imbalanced, with two infrequent classes accounting for only 2 % of the examples and two frequent classes covering 35 % of the examples.
7.2 Experimental protocol
We implemented propagation kernels in Matlab^{10} and classification performance on all datasets except for db is evaluated by running csvm classifications using libSVM.^{11} For the parameter analysis (Sect. 7.3), the cost parameter c was learned on the full dataset (\(c \in \{10^{3}, 10^{1}, 10^{1}, 10^{3}\}\) for normalized kernels and \(c \in \{10^{3}, 10^{2}, 10^{1},10^{0}\}\) for unnormalized kernels), for the sensitivity analysis (Sect. 7.4), it was set to its default value of 1 for all datasets, and for the experimental comparison with existing graph kernels (Sect. 7.5), we learned it via 5fold crossvalidation on the training set for all methods (\(c \in \{10^{7}, 10^{5}, \dots , 10^{5},10^{7} \}\) for normalized kernels and \(c \in \{10^{7}, 10^{5}, 10^{3},10^{1} \}\) for unnormalized kernels). The number of kernel iterations \(t_{\textsc {max}}\) was learned on the training splits (\(t_{\textsc {max}} \in \{0,1,\dots , 10\}\) unless stated otherwise). Reported accuracies are an average of 10 reruns of a stratified 10fold crossvalidation.
For db, we follow the protocol introduced in Neumann et al. (2013). We perform a leaveoneout (loo) cross validation on the 41 objects in db, where the kernel parameter \(t_{\textsc {max}}\) is learned on each training set again via loo. We further enhanced the nodes by a standardized continuous curvature attribute, which was only encoded in the edge weights in previous work (Neumann et al. 2013).
For all pks, the lsh binwidth parameters were set to \(w_l = 10^{5}\) for labels and to \(w_a = 1\) for the normalized attributes, and as lsh metrics we chose \(\textsc {m}_l = \textsc {tv}\) and \(\textsc {m}_a = \textsc {l1}\) in all experiments. Before we evaluate classification performance and runtimes of the proposed propagation kernels, we analyze their sensitivity towards the choice of kernel parameters and with respect to missing and noisy observations.
7.3 Parameter analysis
In general, we see that the pk performance is relatively smooth, especially if \(w < 10^{3}\) and \(t_{\textsc {max}} > 4\). Specifically, the number of iterations leading to the best results are in the range from \(\{4,\dots ,10\}\) meaning that we do not have to use a larger number of iterations in the pk computations, helping to keep a low computation time. This is especially important for parameter learning. Comparing the heatmaps of the normalized pk to the unnormalized pk leads to the conclusion that normalizing the kernel matrix can actually hurt performance. This seems to be the case for the molecular datasets mutag and nci1. For mutag, Fig. 6a, b, the performance drops from 88.2 to 82.9 %, indicating that for this dataset the size of the graphs, or more specifically the amount of labels from the different kind of node classes, are a strong class indicator for the graph label. Nevertheless, incorporating the graph structure, i.e., comparing \(t_{\textsc {max}}=0\) to \(t_{\textsc {max}}=10\), can still improve classification performance by 1.5 %. For other prediction scenarios such as the object category prediction on the db dataset, Fig. 6g, h, we actually want to normalize the kernel matrix to make the prediction independent of the object scale. That is, a cup scanned from a larger distance being represented by a smaller graph is still a cup and should be similar to a larger cup scanned from a closer view. So, for our experiments on object category prediction we will use normalized graph kernels whereas for the chemical compounds we will use unnormalized kernels unless stated otherwise.
Recall that our propagation kernel schemes are randomized algorithms, as there is randomization inherent in the choice of hyperplanes used during the lsh computation. We ran a simple experiment to test the sensitivity of the resulting graph kernels with respect to the hyperplane used. We computed the pk between all graphs in the datasets mutag, enzymes, msrc9, and msrc21 with \(t_{\textsc {max}} = 10\) 100 times, differing only in the random selection of the lsh hyperplanes. To make comparisons easier, we normalized each of these kernel matrices. We then measured the standard deviation of each kernel entry across these repetitions to gain insight into the stability of the pk to changes in the lsh hyperplanes. The median standard deviations were: mutag: \(5.5 \times 10^{5}\), enzymes: \(1.1 \times 10^{3}\), msrc9: \(2.2 \times 10^{4}\), and msrc21: \(1.1 \times 10^{4}\). The maximum standard deviations over all pairs of graphs were: mutag: \(6.7 \times 10^{3}\), enzymes: \(1.4 \times 10^{2}\), msrc9: \(1.4 \times 10^{2}\), and msrc21: \(1.1 \times 10^{2}\). Clearly the pk values are not overly sensitive to random variation due to differing random lsh hyperplanes.
In summary, we can answer (Q1) by concluding that pks are not overly sensitive to the random selection of the hyperplane as well as to the choice of parameters and we propose to learn \(t_{\textsc {max}} \in \{0,1,\dots ,10\}\) and fix \(w \le 10^{3}\). Further, we recommend to decide on using the normalized version of pks only when graph size invariance is deemed important for the classification task.
7.4 Sensitivity to missing and noisy information
This section analyzes the performance of propagation kernels in the presence of missing and noisy information.
Summing up these experimental results we answer (Q2) by concluding that propagation kernels behave well in the presence of missing and noisy information.
7.5 Comparison to existing graph kernels
Graph kernels and their intended use
Kernel  Information type  

Node labels  Partial labels  Edge weights  Edge labels  Node attributes  Huge grids (fast scaling)  
pk  Yes  Yes  Yes  –  Yes  Yes 
wl  Yes  –  –  –  –  – 
sp  Yes  –  Yes  Yes  Yes  – 
gh  Yes  –  Yes  –  Yes  – 
csm  Yes  –  Yes  Yes  Yes  – 
7.5.1 Graph classification on benchmark data
In this section, we consider graph classification for fully labeled, partially labeled, and attributed graphs.
Labeled graphs
Method  Dataset  

mutag  nci1  nci109  dd  
pk  \(84.5\, \pm 0.6\, (0.2'')\)  \(84.5\, \pm 0.1\, (4.5')\)  \(83.5\, \pm 0.1\, (4.4')\)  \(78.8\, \pm 0.2\, (3.6')\) 
wl  \(84.0\, \pm 0.4\, (0.2'')\)  \(\mathbf {85.9}\, \pm 0.1\, (5.6')\)  \(\mathbf {85.9}\, \pm 0.1\, (7.4')\)  \(79.0\, \pm 0.2\, (6.7')\) 
sp  \(85.8\, \pm 0.2\, (0.2'')\)  \(74.4\, \pm 0.1\, (21.3'')\)  \(73.7\, \pm 0.0\, (19.3'')\)  out of time 
gh  \(85.4\, \pm 0.5\, (1.0')\)  \(73.2\, \pm 0.1\, (13.0\)h)  \(72.6\, \pm 0.1\, (22.1\)h)  \(68.9\, \pm 0.2\) (69.1h) 
labels  \(85.8\, \pm 0.2\, (0.0'')\)  \(64.6\, \pm 0.0\, (0.8'')\)  \(63.6\, \pm 0.0\, (0.7'')\)  \(78.4\, \pm 0.1\, (0.3'')\) 
Partially labeled graphs To assess the predictive performance of propagation kernels on partially labeled graphs, we ran the following experiments 10 times. We randomly removed 20–80 % of the node labels in all graphs in msrc9 and msrc21 and computed crossvalidation accuracies and standard errors. Because the wlsubtree kernel was not designed for partially labeled graphs, we compare pk to two variants: one where we treat unlabeled nodes as an additional label “u” (wl) and another where we use hard labels derived from running label propagation (lp) until convergence (lp \(+\) wl). For this experiment we did not learn the number of kernel iterations, but selected the best performing \(t_{\textsc {max}}\) resp. \(h_{\textsc {max}}\).
Partially labeled graphs
Dataset  Method  Labels missing  

20 %  40 %  60 %  80 %  
msrc9  pk  \(90.0\, \pm 0.4\)  \(88.7\, \pm 0.3\)  \(86.6\, \pm 0.4\)  \(80.4\, \pm 0.6\) 
lp \(+\) wl  \(90.0 \pm 0.2\)  \(87.9\, \pm 0.6\)  \(83.2\, \pm 0.6\)  \(77.9\, \pm 1.0\)  
wl  \(89.2\, \pm 0.5\)  \(88.1\, \pm 0.5\)  \(85.7\, \pm 0.6\)  \(78.5\, \pm 0.9\)  
msrc21  pk  \(\mathbf {86.9}\, \pm 0.3\)  \(\mathbf {84.7}\, \pm 0.3\)  \(\mathbf {79.5}\, \pm 0.3\)  \(\mathbf {69.3}\, \pm 0.3\) 
lp \(+\) wl  \(85.8 \pm 0.2\)  \(81.5\, \pm 0.3\)  \(74.5\, \pm 0.3\)  \(64.0\, \pm 0.4\)  
wl  \(85.4\, \pm 0.4\)  \(81.9\, \pm 0.4\)  \(76.0\, \pm 0.3\)  \(63.7\, \pm 0.4\) 
7.5.2 Graph classification on novel applications
The flexibility of propagation kernels arising from easily interchangeable propagation schemes and their efficient computation via lsh allows us to apply graph kernels to novel domains. First, we are able to compare larger graphs with reasonable time expended, opening up the use of graph kernels for object category prediction of 3d point clouds in the context of robotic grasping (Neumann et al. 2013). Depending on their size and the perception distance, point clouds of household objects can easily consist of several thousands of nodes. Traditional graph kernels suffer from enormous computation times or memory problems even on datasets like db, which can still be regarded medium sized. These issues aggravate even more when considering image data. So far, graph kernels have been used for image classification on the scene level where the nodes comprise segments of similar pixels and one image is then represented by less than 100 socalled superpixels. Utilizing offtheshelf techniques for efficient diffusion on grid graphs allows the use of propagation kernels to analyze images on the pixel level and thus opens up a whole area of interesting problems in the intersection of graphbased machine learning and computer vision. As a first step, we apply graph kernels, more precisely propagation kernels, to texture classification, where we consider datasets with thousands of graphs containing a total of several millions of nodes.
Point cloud graphs
labels  labels & attr  attr  

pk  wl  pk  p2k  a  
acc\( \pm \)stderr  \(75.6 \pm 0.6\)  \(70.7 \pm 0.0\)  \(76.8 \pm 1.3\)  \(\mathbf {82.9} \pm 0.0\)  \(36.4 \pm 0.0\) 
runtime  \(0.2''\)  \(0.4''\)  \(0.3''\)  \(34.8''\)  \(40.0''\) 
Grid graphs
Method  Dataset  

brodatzor  brodatzorsrs  plants  
pk  \(\mathbf {89.6} \, \pm 0.0 \,(3.5')\)  \(\mathbf {85.7} \, \pm 0.0\, (7.1')\)  \(\mathbf {82.5} \, \pm 0.1\, (3.0')\) 
labels  \(5.0 \, \pm 0.0\, (1.1')\)  \(4.9 \, \pm 0.0\) (\(2.2')\)  \(59.5 \, \pm 0.0 \,(11.5'')\) 
glcmgray  \(87.2 \, \pm 0.0\, (29.5'')\)  \(79.4 \, \pm 0.0 \,(44.8'')\)  \(76.6 \, \pm 0.0\, (1.4')\) 
glcmquant  \(78.6 \, \pm 0.0\, (24.9'')\)  \(68.6 \, \pm 0.0 \,(44.8'')\)  \(37.5 \, \pm 0.0\, (1.1')\) 
Summarizing all experimental results, the capabilities claimed in Table 2 are supported. Propagation kernels have proven extremely flexible and efficient and thus question (Q3) can ultimately be answered affirmatively.
8 Conclusion
Random walkbased models provide a principled way of spreading information and even handling missing and uncertain information within graphs. Known labels are, for example, propagated through the graph in order to label all unlabeled nodes. In this paper, we showed how to use random walks to discover structural similarities shared between graphs for the construction of a graph kernel, namely the propagation kernel. Intuitively, propagation kernels count common subdistributions induced in each iteration of running inference in two graphs leading to the insight that graph kernels are much closer to graphbased learning than assumed before.
As our experimental results demonstrate, propagation kernels are competitive in terms of accuracy with stateoftheart kernels on several classification benchmark datasets of labeled and attributed graphs. In terms of runtime, propagation kernels outperform all recently developed efficient and scalable graph kernels. Moreover, being tied to the propagation scheme, propagation kernels can be easily adapted to novel applications not having been tractable for graph kernels before.
Propagation kernels provide several interesting avenues for future work. For handling continuous attributes using mixture of different covariance matrices could improve performance. Also, the effect that adding noise to the label encoding actually improves the predictive performance should be investigated in more details. While we have used classification to guide the development of propagation kernels, the results are directly applicable to regression, clustering, and ranking, among other tasks. Employing messagebased probabilistic inference schemes such as (loopy) belief propagation directly paves the way to deriving novel graph kernels from graphical models. Exploiting that graph kernels and graphbased learning (learning on the node level) are closely related, hence, a natural extension to this work is the derivation of a unifying propagationbased framework for structure representation independent of the learning task being on the graph or node level.
Footnotes
 1.
This prior could also be the output of an external classifier built on available node attributes.
 2.
Note that not both label and attribute information have to be present and both could also be partially observed.
 3.
Using a coordinate list sparse representation, the memory usage per pixel grid graph for Algorithm 3 is \(\mathcal {O}(3m_1m_2p)\), where \(m_1 \times m_2\) are the grid dimensions and p is the size of the pixel neighborhood.
 4.
All datasets are publicly available for download from http://tiny.cc/PK_MLJ_data.
 5.
 6.
 7.
 8.
 9.
The test suites provided with the data are incorrect; we use a corrected version.
 10.
 11.
 12.
Notes
Acknowledgments
Part of this work grew out of the dfg Collaborative Research Center sfb 876 “Providing Information by ResourceConstrained Analysis” and discussions with Petra Mutzel and Christian Sohler. We thank Nino Shervashidze, Nils Kriege, Aasa Feragen, and Karsten Borgwardt for our discussions and for sharing their kernel implementations and datasets. Part of this work was supported by the German Science Foundation (dfg) under the reference number ‘GA 1615/11’.
References
 Bauckhage, C., & Kersting, K. (2013). Efficient information theoretic clustering on discrete lattices (2013). arxiv:1310.7114.
 Borgwardt, K., & Kriegel, H. P. (2005). Shortestpath kernels on graphs. In Proceedings of international conference on data mining (ICDM05), pp. 74–81.Google Scholar
 Datar, M., & Indyk, P. (2004). Localitysensitive hashing scheme based on pstable distributions. In Proceedings of the 20th annual symposium on computational geometry (SCG2004), pp. 253–262.Google Scholar
 Debnath, A., de Compadre, R. L., Debnath, G., Schusterman, A., & Hansch, C. (1991). Structureactivity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity. Journal of Medicinal Chemistry, 34(2), 786–797.CrossRefGoogle Scholar
 Desrosiers, C., & Karypis, G. (2009). Withinnetwork classification using local structure similarity. In Proceedings of the European conference on machine learning and knowledge discovery in databases (ECML/PKDD09), pp. 260–275.Google Scholar
 Dobson, P. D., & Doig, A. J. (2003). Distinguishing enzyme structures from nonenzymes without alignments. Journal of Molecular Biology, 330(4), 771–783.CrossRefGoogle Scholar
 Feragen, A., Kasenburg, N., Petersen, J., de Bruijne, M., & Borgwardt, K. M. (2013). Scalable kernels for graphs with continuous attributes. Advances in Neural Information Processing Systems, 26(NIPS–13), 216–224.Google Scholar
 Gallagher, B., Tong, H., EliassiRad, T., & Faloutsos, C. (2008). Using ghost edges for classification in sparsely labeled networks. In Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining (KDD08), pp. 256–264.Google Scholar
 Gärtner, T., Flach, P. A., & Wrobel, S. (2003). On graph kernels: Hardness results and efficient alternatives. In Proceedings of computational learning theory and kernel machines (COLT03), pp. 129–143.Google Scholar
 Gersho, A., & Gray, R. (1991). Vector quantization and signal compression. Norwell, MA: Kluwer Academic Publishers.Google Scholar
 Haralick, R. M., Shanmugam, K., & Dinstein, I. H. (1973). Textural features for image classification. IEEE Transactions on Systems, Man and Cybernetics, SMC–3(6), 610–621.CrossRefGoogle Scholar
 Harchaoui, Z., & Bach, F. (2007). Image classification with segmentation graph kernels. In CVPR. IEEE Computer Society.Google Scholar
 Haussler, D. (1999). Convolution kernels on discrete structures. Tech. rep., Department of Computer Science, University of California, Santa Cruz.Google Scholar
 Hido, S., & Kashima, H. (2009). A lineartime graph kernel. In Proceedings of the 9th IEEE international conference on data mining (ICDM09), pp. 179–188.Google Scholar
 Horváth, T., Gärtner, T., & Wrobel, S. (2004). Cyclic pattern kernels for predictive graph mining. In Proceedings of knowledge discovery in databases (KDD04), pp. 158–167.Google Scholar
 Hwang, T., & Kuang, R. (2010). A heterogeneous label propagation algorithm for disease gene discovery. In Proceedings of the SIAM international conference on data mining (SDM10), pp. 583–594.Google Scholar
 Jaakkola, T., & Haussler, D. (1998). Exploiting generative models in discriminative classifiers. Advances in Neural Information Processing Systems, 11(NIPS–98), 487–493.Google Scholar
 Jähne, B. (2005). Digital Image Processing (6th ed.). Berlin: Springer.Google Scholar
 Jebara, T., Kondor, R., & Howard, A. (2004). Probability product kernels. Journal of Machine Learning Research, 5, 819–844.MathSciNetzbMATHGoogle Scholar
 Kashima, H., Tsuda, K., & Inokuchi, A. (2003). Marginalized kernels between labeled graphs. In Proceedings of the 20th international conference on machine learning (ICML03), pp. 321–328.Google Scholar
 Kersting, K., Mladenov, M., Garnett, R., & Grohe, M. (2014). Power iterated color refinement. In Proceedings of the 28th AAAI conference on artificial intelligence (AAAI14), pp. 1904–1910.Google Scholar
 Kondor, R., & Jebara, T. (2003). A kernel between sets of vectors. In Proceedings of the twentieth international conference on machine learning (ICML03), pp. 361–368.Google Scholar
 Kondor, R. I., & Lafferty, J. D. (2002). Diffusion kernels on graphs and other discrete input spaces. In Proceedings of the nineteenth international conference on machine learning (ICML02), pp. 315–322.Google Scholar
 Kriege, N., & Mutzel, P. (2012). Subgraph matching kernels for attributed graphs. In Proceedings of the 29th international conference on machine learning (ICML12).Google Scholar
 Lafferty, J., & Lebanon, G. (2002). Information diffusion kernels. Advances in Neural Information Processing Systems, 22(NIPS–02), 375–382.Google Scholar
 Lin, F., & Cohen, W. W. (2010). Power iteration clustering. In Proceedings of the 27th international conference on machine learning (ICML10), pp. 655–662.Google Scholar
 Lovász, L. (1996). Random walks on graphs: A survey. In D. Miklós, V. T. Sós, & T. Szőnyi (Eds.), Combinatorics, Paul Erdős is Eighty (Vol. 2, pp. 353–398). Budapest: János Bolyai Mathematical Society.Google Scholar
 Mahé, P., & Vert, J. P. (2009). Graph kernels based on tree patterns for molecules. Machine Learning, 75(1), 3–35.CrossRefGoogle Scholar
 Moreno, P., Ho, P., & Vasconcelos, N. (2003). A Kullback–Leibler divergence based kernel for SVM classification in multimedia applications. Advances in Neural Information Processing Systems, it 23(NIPS03), 1385–1392.Google Scholar
 Neumann, M., Garnett, R., & Kersting, K. (2013). Coinciding walk kernels: Parallel absorbing random walks for learning with graphs and few labels. In Asian conference on machine learning (ACML13), pp. 357–372.Google Scholar
 Neumann, M., Hallau, L., Klatt, B., Kersting, K., & Bauckhage, C. (2014). Erosion band features for cell phone image based plant disease classification. In Proceedings of the 22nd international conference on pattern recognition (ICPR14), pp. 3315–3320.Google Scholar
 Neumann, M., Moreno, P., Antanas, L., Garnett, R., & Kersting, K. (2013). Graph kernels for object category prediction in taskdependent robot grasping. In Eleventh workshop on mining and learning with graphs (MLG13), Chicago, Illinois.Google Scholar
 Neumann, M., Patricia, N., Garnett, R., & Kersting, K. (2012). Efficient graph kernels by randomization. In European conference on machine learning and knowledge discovery in databases (ECML/PKDD12), pp. 378–393.Google Scholar
 Ojala, T., Pietikäinen, M., & Mäenpää, T. (2002). Multiresolution grayscale and rotation invariant texture classification with local binary patterns. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(7), 971–987.CrossRefGoogle Scholar
 Ramon, J., & Gärtner, T. (2003). Expressivity versus efficiency of graph kernels. In Proceedings of the 1st international workshop on mining graphs, trees and sequences, pp. 65–74.Google Scholar
 Schomburg, I., Chang, A., Ebeling, C., Gremse, M., Heldt, C., Huhn, G., et al. (2004). Brenda, the enzyme database: Updates and major new developments. Nucleic Acids Research, 32(Database–Issue), 431–433.CrossRefGoogle Scholar
 Shervashidze, N., Schweitzer, P., van Leeuwen, E., Mehlhorn, K., & Borgwardt, K. (2011). Weisfeiler–Lehman graph kernels. Journal of Machine Learning Research, 12, 2539–2561.zbMATHGoogle Scholar
 Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., & Borgwardt, K. (2009). Efficient graphlet kernels for large graph comparison. Journal of Machine Learning Research—Proceedings Track, 5, 488–495.Google Scholar
 Shi, Q., Petterson, J., Dror, G., Langford, J., Smola, A. J., & Vishwanathan, S. V. N. (2009). Hash kernels for structured data. Journal of Machine Learning Research, 10, 2615–2637.MathSciNetzbMATHGoogle Scholar
 Szummer, M., & Jaakkola, T. (2001). Partially labeled classification with Markov random walks. Advances in Neural Information Processing Systems, 15(NIPS–01), 945–952.Google Scholar
 Valkealahti, K., & Oja, E. (1998). Reduced multidimensional cooccurrence histograms in texture classification. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(1), 90–94.CrossRefGoogle Scholar
 Vishwanathan, S., Schraudolph, N., Kondor, R., & Borgwardt, K. (2010). Graph kernels. Journal of Machine Learning Research, 11, 1201–1242.MathSciNetzbMATHGoogle Scholar
 Wale, N., & Karypis, G. (2006). Comparison of descriptor spaces for chemical compound retrieval and classification. In Proceedings of the international conference on data mining (ICDM06) (pp. 678–689). Silver Spring, MD: IEEE Computer Society.Google Scholar
 Winn, J. M., Criminisi, A., & Minka, T. P. (2005). Object categorization by learned universal visual dictionary. In 10th IEEE international conference on computer vision (ICCV05), pp. 1800–1807.Google Scholar
 Wu, X. M., Li, Z., So, A. M. C., Wright, J., & Chang, S. F. (2012). Learning with partially absorbing random walks. Advances in Neural Information Processing Systems, 26(NIPS–12), 3086–3094.Google Scholar
 Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003). Learning with local and global consistency. Advances in Neural Information Processing Systems, 17(NIPS–03), 321–328.Google Scholar
 Zhu, X., Ghahramani, Z., & Lafferty, J. D. (2003). Semisupervised learning using Gaussian fields and harmonic functions. In Proceedings of the twentieth international conference on machine learning (ICML03), pp. 912–919.Google Scholar