Kernel methods

Jean-Philippe Vert, Ecole des Mines de Paris

MSc Mathematics, Vision, Learning (ENS Cachan), Spring 2007

MSc Probability and Applications (Paris 6), Spring 2007
M2 Random Modelling (Paris 7), Spring 2007

Slides (Last update: Mar 9, 2007)

Outline

Many problems in computational biology and chemistry can be formalized as classical statistical problems, e.g., pattern recognition, regression or dimension reduction, with the caveat that the data are often not vectors. Indeed objects such as gene sequences, small molecules, protein 3D structures or phylogenetic trees, to name just a few, have particular structures which contain relevant information for the statistical problem but can hardly be encoded into finite-dimensional vector representations.

Kernel methods are a class of algorithms well suited for such problems. Indeed they extend the applicability of many statistical methods initially designed for vectors to virtually any type of data, without the need for explicit vectorization of the data. The price to pay for this extension to non-vectors is the need to define a positive definite kernel between the objects, formally equivalent to an implicit vectorization of the data. The "art" of kernel design for various objects have witnessed important advances in recent years, resulting in many state-of-the-art algorithms in computational biology and chemistry, as well as many other fields.

The goal of this course is to present the mathematical foundations of kernel methods, as well as the main approaches that have emerged so far in kernel design. The relevance of these methods will be illustrated by several examples in computational biology and chemistry.

Results ENS Cachan

Schedule and Homework ENS Cachan

Lecture take place in room 103, 2pm-5pm.

Homeworks are due at the begining of the following lecture, by hard copy at or (better) e-mail to Jean-Philippe.Vert@ensmp.fr. Implementations can be done in the programming language of your choice, e.g., the free R language, or Matlab and its free clone Octave

DateTopicHomeworkSolution
Jan 30, 2007Kernels and RKHSNone!
Mar 7, 2007Kernel methodshomework 1, xtrain.txt, ytrain.txt, xtest.txt, ytest.txt, data.matrbf.m , centering.m , kernelPCA.m , krr.m , hw1.m
Mar 14, 2007Pattern recognitionhomework 2, data.txt, labels.txthw2.R
Mar 21, 2007Kernel examplesHomework 3
Mar 28, 2007Kernel for stringsHomework 4 (updated Mar 30)
Apr 2, 2007Kernels for strings and graphs

Schedule and Homework Paris 6/7

Lectures take place in room 0D1, 9am-12pm.

Homeworks are due at the begining of the following lecture, by hard copy at or (better) e-mail to Jean-Philippe.Vert@ensmp.fr. Implementations can be done in the programming language of your choice, e.g., the free R language, or Matlab and its free clone Octave

DateTopicHomework
Mar 9, 2007Kernels and RKHSNone!
Mar 16, 2007Kernel methodshomework 1, xtrain.txt, ytrain.txt, xtest.txt, ytest.txt, data.mat
Mar 23, 2007Pattern recognitionhomework 2, data.txt, labels.txt
Mar 30, 2007Canceled

Internships, PhD, job proposals


Vert Jean-Philippe
Last modified: Mon Apr 2 10:30:34 CEST 2007