Pascal Challenge: Linear Support Vector Machines
published: Sept. 1, 2008, recorded: July 2008, views: 4363
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 participate in the linear SVM Track of the Pascal Large Scale Learning Challenge at ICML 2008. We consider the LIBLINEAR package, which can handle L1- and L2-loss linear SVMs. The L1-SVM solver implemented in LIBLINEAR employes a coordinate descent method to solve the dual problem. This method is very useful for large sparse data with a huge number of instances and features. However, most data sets of this challenges have a quite small number of features. To work on the competition data, we slightly modify LIBLINEAR.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !