Introduction to Kernel Methods

author: Liva Ralaivola, Aix-Marseille Université
published: Aug. 5, 2010,   recorded: July 2010,   views: 3048
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 1:50:49
!NOW PLAYING
Watch Part 2
Part 2 1:31:57
!NOW PLAYING

Description

In this talk, we are going to see the basics of kernels methods. After a brief presentation of a very simple kernel classifier, we'll give the definition of a postive definite kernel and explain Support vector machine learning. Then, a few kernels for structured data, namely sequences and graphs, will be described. The representer theorem is presented, which explains the rationale for the usual kernel expansion encountered when working with kernel methods. Finally, a few elements from statistical learning theory are given.

See Also:

Download slides icon Download slides: bootcamp2010_ralaivola_ikm_01.pdf (1.2¬†MB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Alex, May 18, 2011 at 1:39 p.m.:

Brilliant explanation!

Write your own review or comment:

make sure you have javascript enabled or clear this field: