Kernel Learning for Novelty Detection
published: Dec. 20, 2008, recorded: December 2008, views: 664
Report a problem or upload filesIf 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.
We consider kernel learning for one-class Support Vector Machines. We consider a mix of 2- and 1-norms of the individual weight vector norms allowing control of the sparsity of the resulting kernel combination. The resulting optimisation can be solved eﬃciently using a coordinate gradient method. We consider an application to automatically detecting the appropriate metric for a guided image search task.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !