DocumentCode
3493143
Title
Parallel Semiparametric Support Vector Machines
Author
Díaz-Morales, Roberto ; Molina-Bulla, Harold Y. ; Navia-Vázquez, Ángel
fYear
2011
fDate
July 31 2011-Aug. 5 2011
Firstpage
475
Lastpage
481
Abstract
In recent years the number of cores in computers has increased considerably, opening new lines of research to adapt classical techniques of machine learning to a parallel scenario. In this paper, we have developed and implemented with the multi-platform application programming interface OpenMP a method to train Semiparametric Support Vector Machines relying on Sparse Greedy Matrix Approximation (SGMA) and Iterated Re-Weighted Least Squares algorithm (IRWLS). We take advantage of the matrix formulation of SGMA and IRWLS. We recursively apply the partitioned matrix inversion lemma and other matrix decompositions to obtain a simple procedure to parallelize SVMS with good performance and computational efficiency.
Keywords
application program interfaces; greedy algorithms; learning (artificial intelligence); least squares approximations; matrix decomposition; matrix inversion; sparse matrices; support vector machines; iterated reweighted least square algorithm; machine learning; matrix decompositions; matrix inversion lemma; multiplatform application programming interface OpenMP; parallel semiparametric support vector machines; sparse greedy matrix approximation; Accuracy; Computational efficiency; Kernel; Matrix decomposition; Program processors; Support vector machines; Training;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks (IJCNN), The 2011 International Joint Conference on
Conference_Location
San Jose, CA
ISSN
2161-4393
Print_ISBN
978-1-4244-9635-8
Type
conf
DOI
10.1109/IJCNN.2011.6033259
Filename
6033259
Link To Document