Distance Metric Learning for Kernel Machines

author: Kilian Q. Weinberger, Department of Computer Science, Cornell University
published: Jan. 12, 2011,   recorded: December 2010,   views: 1260
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

Description

Recent work in metric learning has significantly improved the state-of-the-art in k-nearest neighbor classification. However, Support vector machines (with RBF kernels) are arguably the most popular class of classification algorithms that uses distance metrics to compare examples. In this talk I will introduce support vector metric learning (SVML), an algorithm that seamlessly combines both by learning a Mahalanobis metric at the same time as the RBF-SVM decision boundary. SVML is an effective tool for automatically pre-processing data sets for classification, as well as visualizing the structure of SVM decision boundaries. We demonstrate the capabilities (and shortcomings) of our algorithm on 10 benchmark data sets of varying sizes and difficulties.

See Also:

Download slides icon Download slides: nipsworkshops2010_weinberger_dml_01.pdf (14.6┬á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 !

Write your own review or comment:

make sure you have javascript enabled or clear this field: