Single directional SMO algorithm for least squares support vector machines

9Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Working set selection is a major step in decomposition methods for training least squares support vector machines (LS-SVMs). In this paper, a new technique for the selection of working set in sequential minimal optimization- (SMO-) type decomposition methods is proposed. By the new method, we can select a single direction to achieve the convergence of the optimality condition. A simple asymptotic convergence proof for the new algorithm is given. Experimental comparisons demonstrate that the classification accuracy of the new method is not largely different from the existing methods, but the training speed is faster than existing ones. © 2013 Xigao Shao et al.

Cite

CITATION STYLE

APA

Shao, X., Wu, K., & Liao, B. (2013). Single directional SMO algorithm for least squares support vector machines. Computational Intelligence and Neuroscience, 2013. https://doi.org/10.1155/2013/968438

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free