Kernel methods

Jean-Philippe Vert, Ecole des Mines de Paris

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

Results

Slides (Last update: March 26, 2008)

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.

Schedule and Homework

Lecture take place usually in room C103, 1pm-3:30pm.

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

DateTopicSlidesHomeworkData
Jan 16, 2008Positive definite Kernels, Mercer theorem1-32Homework 1
Feb 6, 2008RKHS33-44Homework 2
Feb 15, 2008Kernel trick, first kernel algorithms45-65No homework!
Feb 20, 2008Representer theorem, kernel PCA, kernel ridge regression66-97Homework 3xtrain.txt, ytrain.txt, xtest.txt, ytest.txt
Feb 27, 2008Pattern recognition, SVM Cancelled
Mar 5, 2008Pattern recognition, SVM98-127Homework 4data.txt,labels.txt
Mar 12, 2008SVM, Kernel examples128-170Homework 5
Mar 19, 2008Semigroup kernels171-189Homework 6
Mar 26, 2008Kernels on graphs284-331

Results

The final note will be an average of the homeworks.

Code


Vert Jean-Philippe
Last modified: Wed May 28 12:01:55 CEST 2008