Sciweavers

Share
18 search results - page 1 / 4
» Sparse Kernel SVMs via Cutting-Plane Training
Sort
View
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
9 years 3 months ago
Sparse Kernel SVMs via Cutting-Plane Training
We explore an algorithm for training SVMs with Kernels that can represent the learned rule using arbitrary basis vectors, not just the support vectors (SVs) from the training set. ...
Thorsten Joachims, Chun-Nam John Yu
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
9 years 9 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
9 years 9 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
ICML
2010
IEEE
8 years 10 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
NIPS
1998
8 years 10 months ago
Using Analytic QP and Sparseness to Speed Training of Support Vector Machines
Training a Support Vector Machine (SVM) requires the solution of a very large quadratic programming (QP) problem. This paper proposes an algorithm for training SVMs: Sequential Mi...
John C. Platt
books