Classification of biological sequences with kernel methods Kernels and kernel methods Kernels for biological sequences Summary Outline 1 Kernels and kernel methods Kernels Kernel Methods 2 Kernels for biological sequences Motivations Feature space approach Using generative models Derive from a similarity measure Application: remote homology detection Jean-Philippe Vert Classification of biologi...

In this paper we show how the generation of documents can be thought of as a k-stage Markov process, which leads to a Fisher kernel from which the n-gram and string kernels can be reconstructed. The Fisher kernel view gives a more exible insight into the string kernel and suggests how it can be parametrised in a way that re-ects the statistics of the training corpus. Furthermore, the prob-abili...

Super-resolution (SR) is a technique that produces a high resolution (HR) image via employing a number of low resolution (LR) images from the same scene. One of the degradations that attenuates performance of the SR is the blurriness of the input LR images. In many previous works in the SR, the blurriness of the LR images is assumed to be due to the integral effect of the image sensor of the im...

In this paper, we present classes of kernels for machine learning from a statistics perspective. Indeed, kernels are positive definite functions and thus also covariances. After discussing key properties of kernels, as well as a new formula to construct kernels, we present several important classes of kernels: anisotropic stationary kernels, isotropic stationary kernels, compactly supported ker...

The paper presents a novel type of fuzzy sets, called time-Varying Fuzzy Sets (VFS). These fuzzy sets are based on the Gaussian membership functions, they are depended on the error and they are characterized by the displacement of the kernels to both right and left side of the universe of discourse, the two extremes kernels of the universe are fixed for all time. In this work we focus only on t...

a kernel $j$ of a digraph $d$ is an independent set of vertices of $d$ such that for every vertex $w,in,v(d),setminus,j$ there exists an arc from $w$ to a vertex in $j.$in this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. this characterization is a partial solution to the following problem: characterize circulant digraphs which hav...