## Support Vector Machine algorithms : analysis and applications

##### Author(s)

Wen, Tong, 1970-
DownloadFull printable version (6.393Mb)

##### Alternative title

SVM algorithms : analysis and applications

##### Other Contributors

Massachusetts Institute of Technology. Dept. of Mathematics.

##### Advisor

Alan Edelman.

##### Terms of use

##### Metadata

Show full item record##### Abstract

Support Vector Machines (SVMs) have attracted recent attention as a learning technique to attack classification problems. The goal of my thesis work is to improve computational algorithms as well as the mathematical understanding of SVMs, so that they can be easily applied to real problems. SVMs solve classification problems by learning from training examples. From the geometry, it is easy to formulate the finding of SVM classifiers as a linearly constrained Quadratic Programming (QP) problem. However, in practice its dual problem is actually computed. An important property of the dual QP problem is that its solution is sparse. The training examples that determine the SVM classifier are known as support vectors (SVs). Motivated by the geometric derivation of the primal QP problem, we investigate how the dual problem is related to the geometry of SVs. This investigation leads to a geometric interpretation of the scaling property of SVMs and an algorithm to further compress the SVs. A random model for the training examples connects the Hessian matrix of the dual QP problem to Wishart matrices. After deriving the distributions of the elements of the inverse Wishart matrix Wn-1(n, nI), we give a conjecture about the summation of the elements of Wn-1(n, nI). It becomes challenging to solve the dual QP problem when the training set is large. We develop a fast algorithm for solving this problem. Numerical experiments show that the MATLAB implementation of this projected Conjugate Gradient algorithm is competitive with benchmark C/C++ codes such as SVMlight and SvmFu. Furthermore, we apply SVMs to time series data. (cont.) In this application, SVMs are used to predict the movement of the stock market. Our results show that using SVMs has the potential to outperform the solution based on the most widely used geometric Brownian motion model of stock prices.

##### Description

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2002. Includes bibliographical references (p. 89-97).

##### Date issued

2002##### Department

Massachusetts Institute of Technology. Dept. of Mathematics.##### Publisher

Massachusetts Institute of Technology

##### Keywords

Mathematics.