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
published: Feb. 25, 2007, recorded: February 2005, views: 7667
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.
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.
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:
NOOOOOOOO IT STOPS IN THE MIDDLE OF THE LECTURE !!!!
Real shame it stops in the middle - interesting stuff
Write your own review or comment: