DMCA
Training Linear SVMs in Linear Time (2006)
Cached
Download Links
| Citations: | 549 - 6 self |
BibTeX
@MISC{Joachims06traininglinear,
author = {Thorsten Joachims},
title = { Training Linear SVMs in Linear Time},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for high-dimensional sparse data commonly encountered in applications like text classification, word-sense disambiguation, and drug design. These applications involve a large number of examples n as well as a large number of features N, while each example has only s << N non-zero features. This paper presents a Cutting-Plane Algorithm for training linear SVMs that provably has training time O(sn) for classification problems and O(sn log(n)) for ordinal regression problems. The algorithm is based on an alternative, but equivalent formulation of the SVM optimization problem. Empirically, the Cutting-Plane Algorithm is several orders of magnitude faster than decomposition methods like SVM-Light for large datasets.
Keyphrases
linear time abstract training linear svms large number cutting-plane algorithm several order svm optimization problem classification problem prominent machine linear support vector machine decomposition method equivalent formulation linear svms word-sense disambiguation highdimensional sparse data ordinal regression problem sn log large datasets non-zero feature text classification training time drug design
