Article thumbnail

Parallel Support Vector Machines

By Dominik Brugger, Dominik Brugger, Arbeitsbereich Technische Informatik, Dominik Brugger, Arbeitsbereich Technische Informatik and Eberhard-karls Universität Tübingen

Abstract

The Support Vector Machine (SVM) is a supervised algorithm for the solution of classification and regression problems. SVMs have gained widespread use in recent years because of successful applications like character recognition and the profound theoretical underpinnings concerning generalization performance. Yet, one of the remaining drawbacks of the SVM algorithm is its high computational demands during the training and testing phase. This article describes how to efficiently parallelize SVM training in order to cut down execution times. The parallelization technique employed is based on a decomposition approach, where the inner quadratic program (QP) is solved using Sequential Minimal Optimization (SMO). Thus all types of SVM formulations can be solved in parallel, including C-SVC and ν-SVC for classification as well as ε-SVR and ν-SVR for regression. Practical results show, that on most problems linear or even superlinear speedups can be attained.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.333.3078
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://tobias-lib.uni-tuebinge... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.