An extrapolated Sequential Minimal Optimization Algorithm for Support Vector Machines

Full text for this resource is not available from the Research Repository.

Lai, Daniel ORCID: 0000-0003-3459-7709, Palaniswami, M and Mani, N (2004) An extrapolated Sequential Minimal Optimization Algorithm for Support Vector Machines. In: Proceedings of International Conference on Intelligent Sensing and Information Processing 2004. IEEE, Piscataway, N.J, pp. 415-421.

Abstract

The sequential minimal optimization (SMO) algorithm is a popular algorithm used to solve the support vector machine problem due to its efficiency and ease of implementation. We investigate applying extrapolation methods to the SMO update method in order to increase the rate of convergence of this algorithm. We first show that the update method is Newtonian and that extrapolation ensures the update is norm reducing on the objective function. We also note that choosing the working set pair according to some partial order does result in slightly faster speedups in algorithm performance.

Dimensions Badge

Altmetric Badge

Item type Book Section
URI https://vuir.vu.edu.au/id/eprint/5700
DOI 10.1109/ICISIP.2004.1287693
Official URL http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arn...
ISBN 0780382439
Subjects Historical > FOR Classification > 0801 Artificial Intelligence and Image Processing
Historical > Faculty/School/Research Centre/Department > Centre for Ageing, Rehabilitation, Exercise & Sport Science (CARES)
Keywords ResPubID19080, standard softmargin support vector machine, SVM, Lagrange problem, extrapolation, input data space
Citations in Scopus 2 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login