Efficient computations for large least square support vector machine classifiers

Chua, KS

doi:10.1016/S0167-8655(02)00190-3

Return

Efficient computations for large least square support vector machine classifiers

2003-01-01

107

PRE

Chua, KS *

DOI：10.1016/S0167-8655(02)00190-3

Original

Original request for help

Save

Abstract

En 中文

We observed that the linear system in the training of the least square support vector machine (LSSVM) proposed by Suykens and Vandewalle (Neural process. Lett. 9 (1999a) 293-300; IEEE Trans. Neural Networks 10 (4) (1999b) 907912) can be placed in a more symmetric form so that for a data set with N data points and m features, the linear system can be solved by inverting an m x m instead of an N x N matrix and storing and working with matrices of size at most m x N. This allows us to apply LSSVM to very large data set with small number of features. Our computations show that a data set with a million data points and 10 features can be trained in only 45 s. We also compared the effectiveness and efficiency of our method to standard LSSVM and standard SVM. An example using a quadratic kernel is also given. (C) 2002 Elsevier Science B.V. All rights reserved.

Keywords:

classification

support vector machines

least squares

Sherman-Morrison-Woodbury identity

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.