Research Repository

Fast linear stationary methods for Automatically Biased Support Vector Machines

Lai, Daniel ORCID: 0000-0003-3459-7709, Palaniswami, M and Mani, N (2003) Fast linear stationary methods for Automatically Biased Support Vector Machines. In: Proceedings of the International Joint Conference on Neural Networks 2003. IEEE, ‬Piscataway, pp. 2060-2065.

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


We present a new training algorithm, which is capable of providing Fast training for a new automatically biased SVM. We compare our agorithm to the well-known Sequential Minimal Optimization (SMO) algorithm. We then show that this method allows for the application of acceleration methods which further increases the rates of convergence.

Item Type: Book Section
ISBN: ‬9780780378988
Additional Information:

Doubletree Hotel - Jantzen Beach, Portland, Oregon, July 20-24, 2003

Uncontrolled Keywords: ResPubID19082, machine learning, matrix representation, optimization, pattern recognition, non-linear mapping, hyperplane, extrapolation method, convergence, acceleration
Subjects: Current > FOR Classification > 0102 Applied Mathematics
Current > FOR Classification > 0801 Artificial Intelligence and Image Processing
Current > FOR Classification > 1702 Cognitive Science
Historical > Faculty/School/Research Centre/Department > Centre for Ageing, Rehabilitation, Exercise & Sport Science (CARES)
Depositing User: VUIR
Date Deposited: 18 Jun 2013 03:40
Last Modified: 01 Aug 2019 07:43
ePrint Statistics: View download statistics for this item
Citations in Scopus: 5 - View on Scopus

Repository staff only

View Item View Item

Search Google Scholar