... command1
On some systems, you may be required to specifiy the path with for instance ./trainmsvm .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... parameter2
Note that MSVMpack implements the original formulation of each M-SVM, in which the complexity of the machine is tuned through a soft-margin parameter $ C$ instead of a regularization constant $ \lambda$ as described in [7].
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... updates3
A different setting is used for the CS model type as the dedicated working set selection method leads to a better use of the kernel cache. Thus, much less kernel evaluations are required and more threads can be used for gradient updates.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... gradient4
See the function switch_thread() in libtrainMSVM.c for the parameters of these thread switches.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... by5
The change in notation compared to [2] is due to the fact that MSVMpack solves the dual problem with respect to the variables $ \alpha_{ik}$ instead of $ \tau_{ik}= C\delta_{ik} - \alpha_{ik}$.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... CLASS="sans">Spider6
http://people.kyb.tuebingen.mpg.de/spider/
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... CLASS="sans">BSVM7
http://www.csie.ntu.edu.tw/~cjlin/bsvm/
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... CLASS="sans">MCSVM8
http://www.cis.upenn.edu/~crammer/code-index.html
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... CLASS="sans">SMSVM9
http://www.stat.osu.edu/~ yklee/software.html
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... repository10
http://archive.ics.uci.edu/ml/datasets/Image+Segmentation
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... data11
MNIST data sets are available at http://yann.lecun.com/exdb/mnist/. The data are originally stored as bytes, but the current implementation of the RBF kernel function in MSVMpack is faster with short integers than with bytes, so short integers are used in this experiment.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... homepage12
http://www.csie.ntu.edu.tw/~cjlin/libsvmtools/datasets/
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... repository13
http://archive.ics.uci.edu/ml/datasets/Letter+Recognition
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...lp_solve14
lp_solve is freely available under the terms of the GNU lesser general public license at http://lpsolve.sourceforge.net/.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...mongoose15
mongoose is freely available under the terms of the GPL at http://code.google.com/p/mongoose/.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.