Cart (Loading....) | Create Account
Close category search window
 

BCP and ZQP Strategies to Reduce the SVM Training Time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ibarra-Orozco, R. ; Univ. Politec. de Chiapas, Tuxtla Gutiérez, Mexico ; Lopez-Pimentel, J.C. ; Gonzalez-Mendoza, M. ; Hernandez-Gress, N.

The Support Vector Machine (SVM) is awell known method used for classification, regression and density estimation. Training a SVM consists in solving a Quadratic Programming (QP) problem. The QP problemis very resource consuming (both computational time and computational memory), because the quadratic form is dense and the memory requirements grow square the number ofdata points.In order to increase the training speed of SVM's, this paperproposes a combination of two methods, the BCP algorithm(Barycentric Correction Procedure), [15], to find, heuristically,training points with a high probability to be Support Vectors,and the ZQP algorithm, [10], to solve the reduced problem.

Published in:

Artificial Intelligence (MICAI), 2012 11th Mexican International Conference on

Date of Conference:

Oct. 27 2012-Nov. 4 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.