Limitations of kernel and multiple kernel learning
published: Oct. 17, 2011, recorded: September 2011, views: 488
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.
Many low Vapnik-Chervonenkis (and hence statistically learnable) classes cannot be represented as linear classes in such a way that they can be learnt with large margin approaches. We review these results and then consider recent bounds for multiple kernel learning that suggest large margin methods may be more general applicable.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !