next up previous contents
Next: B.5 Examples Up: B.4 Learners Previous: B.4.7 super   Contents


B.4.8 svm

This is an implementation of a support vector machine (SVM) classifier. We didn't actually implement our own SVM, but embedded SVM$ ^{\mbox{\emph{light}}}$ [18] in the software. SVM is a novel type of learning machine which tries to find the largest margin linear classifier. Vapnik [42] shows how training a support vector machine leads to the following quadratic optimization problem:

\begin{displaymath}\begin{array}{rcl r@{}c@{}l} {\bf W}(\alpha) & = & \multicolu...
...rk>932 \alpha_i & \leq & C, & i & = & 1 \ldots \ell \end{array}\end{displaymath} (B.10)

The number of training examples is denoted by $ \ell$. $ \alpha$ is a vector of $ \ell$ variables, where each component $ \alpha_i$ corresponds to a training example $ (x_i, y_i)$. The solution of Problem [*] is the vector $ \alpha^*$ for which $ {\bf W}(\alpha)$ is minimized and the constraints are satisfied. Defining the matrix Q as $ Q_{ij} = {y_i}{y_j}k(x_i,x_j)$, this can equivalently be written as

\begin{displaymath}\begin{array}{l rcl r@{}c@{}l} \mbox{minimize} & {\bf W}(\alp...
...935 & \alpha_i & \leq & C1, & i & = & 1 \ldots \ell \end{array}\end{displaymath} (B.11)

Two good tutorials for SVM are [29] and [3].

Keyword Arg Type Arg Vals Default
Common
capacity float [1e-10, $ \infty$) 10.0
cost float [1e-10, 1e+10] 1.0
gamma float (0, $ \infty$) 0.002
kernel int 0, 2 0
svmdir path   ./
usedefcapacity none    
usedefgamma none    
Rare
learn filename   svm_learn
classify filename   svm_classify
example filename   svm_example
model filename   svm_model
result filename   svm_result
     



Common keywords and arguments:

Rare keywords and arguments:


next up previous contents
Next: B.5 Examples Up: B.4 Learners Previous: B.4.7 super   Contents
Copyright 2004 Paul Komarek, komarek@cmu.edu