Random projection, margins, kernels, and feature-selection

author: Avrim Blum, School of Computer Science, Carnegie Mellon University
published: Feb. 25, 2007,   recorded: February 2005,   views: 7667
Categories

Slides

Related Open Educational Resources

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.
  Bibliography

Description

Random projection is a simple technique that can often provide insight into questions such as "why is it good to have a large margin?" or "what are kernels really doing and how are they similar to feature selection?" In this talk I will describe some simple learning algorithms using random projection. I will then discuss how, given a kernel as a black-box function, we can use various forms of random projection to extract an explicit small feature space that captures much of the power of the given kernel function.

See Also:

Download slides icon Download slides: slsfs05_blum_rpmkf_01.ppt (249.5┬áKB)


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 ml student, October 30, 2009 at 2:54 a.m.:

NOOOOOOOO IT STOPS IN THE MIDDLE OF THE LECTURE !!!!


Comment2 Tom Diethe, April 1, 2010 at 3:35 p.m.:

Real shame it stops in the middle - interesting stuff

Write your own review or comment:

make sure you have javascript enabled or clear this field: