A new algorithm for training SVMs using approximate minimal enclosing balls

Authors:
Emanuele Frandi;Maria Grazia Gasparo;Stefano Lodi;Ricardo Ñanculef;Claudio Sartori
Affiliations:
Dept. of Mathematics, University of Florence, Italy;Dept. of Energetics Sergio Stecco, University of Florence, Italy;Dept. of Electronics, Computer Science and Systems, University of Bologna, Italy;Dept. of Informatics, Federico Santa María University, Chile;Dept. of Electronics, Computer Science and Systems, University of Bologna, Italy
Venue:
CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
Year:
2010

Citing 14
Cited 1

Making large-scale support vector machine learning practical

Advances in kernel methods
Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
Pairwise classification and support vector machines

Advances in kernel methods
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond

Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Smaller core-sets for balls

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient svm training using low-rank kernel representations

The Journal of Machine Learning Research
Core Vector Machines: Fast SVM Training on Very Large Data Sets

The Journal of Machine Learning Research
Working Set Selection Using Second Order Information for Training Support Vector Machines

The Journal of Machine Learning Research
An Efficient Implementation of an Active Set Method for SVMs

The Journal of Machine Learning Research
Simpler core vector machines with enclosing balls

Proceedings of the 24th international conference on Machine learning
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Two Algorithms for the Minimum Enclosing Ball Problem

SIAM Journal on Optimization
Generalized Core Vector Machines

IEEE Transactions on Neural Networks
Reduced Support Vector Machines: A Statistical Theory

IEEE Transactions on Neural Networks

Two one-pass algorithms for data stream classification using approximate MEBs

ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been shown that many kernel methods can be equivalently formulated as minimal enclosing ball (MEB) problems in a certain feature space. Exploiting this reduction, efficient algorithms to scale up Support Vector Machines (SVMs) and other kernel methods have been introduced under the name of Core Vector Machines (CVMs). In this paper, we study a new algorithm to train SVMs based on an instance of the Frank-Wolfe optimization method recently proposed to approximate the solution of the MEB problem. We show that, specialized to SVM training, this algorithm can scale better than CVMs at the price of a slightly lower accuracy.