We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be applied to attributed graphs, our approach allows to rate mappings of subgraphs by a flexible scoring scheme comparing vertex and edge attributes by kernels. We...

We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of graph Laplacians, and combine labeled and unlabeled data in a systematic fashion. Unlike previous work using diffusion kernels and Gaussian random field kernels, a nonparametric kernel approach is presented that incorporat...

Species of Fusarium have significant agro-economical and human health-related impact by infecting diverse crop plants and synthesizing diverse mycotoxins. Here, we investigated interactions of grain-feeding Tenebrio molitor larvae with four grain-colonizing Fusarium species on wheat kernels. Since numerous metabolites produced by Fusarium spp. are toxic to insects, we tested the hypothesis that...

In this paper we introduce a class of non-linear Markov Chain Monte Carlo (MCMC) methods for simulating from a probability measure π. Non-linear Markov kernels (e.g. Del Moral (2004)) can be constructed to admit π as an invariant distribution and have typically superior mixing properties to ordinary (linear) MCMC kernels. However, such non-linear kernels often cannot be simulated exactly, so, i...

The clinical narrative contains a great deal of valuable information that is only understandable in a temporal context. Events, time expressions, and temporal relations convey information about the time course of a patient’s clinical record that must be understood for many applications of interest. In this paper, we focus on extracting information about how time expressions and events are relat...

We consider the design of kernels for time-frequency distributions through the phase, rather than amplitude, response. While phase kernels do not attenuate troublesome crosscomponents, they can translate them in the time-frequency plane. In contrast to previous work on phase kernels that concentrated on placing the cross-components on top of the auto-components, we set up a “don’t care” region ...

| We consider the design of kernels for time-frequency distributions through the phase, rather than amplitude, response. While phase kernels do not attenuate troublesome cross-components, they can translate them in the time-frequency plane. In contrast to previous work on phase kernels that concentrated on placing the cross-components on top of the auto-components, we set up a \don't care" regi...

This paper gives a survey of results in the mathematical literature on positive definite kernels and their associated structures. We concentrate on properties which seem potentially relevant for Machine Learning and try to clarify some results that have been misused in the literature. Moreover we consider different lines of generalizations of positive definite kernels. Namely we deal with opera...

Kernel methods offer a flexible toolbox for pattern analysis and machine learning. A general class of kernel functions which incorporates known pattern invariances are invariant distance substitution (IDS) kernels. Instances such as tangent distance or dynamic time-warping kernels have demonstrated the real world applicability. This motivates the demand for investigating the elementary properti...

This paper presents several novel generalization bounds for the problem of learning kernels based on the analysis of the Rademacher complexity of the corresponding hypothesis sets. Our bound for learning kernels with a convex combination of p base kernels has only a log p dependency on the number of kernels, p, which is considerably more favorable than the previous best bound given for the same...