Sciweavers

24 search results - page 4 / 5
» Decomposition Algorithms for Training Large-Scale Semiparame...
Sort
View
JMLR
2006
89views more  JMLR 2006»
13 years 5 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
ICML
2006
IEEE
14 years 5 months ago
The support vector decomposition machine
In machine learning problems with tens of thousands of features and only dozens or hundreds of independent training examples, dimensionality reduction is essential for good learni...
Francisco Pereira, Geoffrey J. Gordon
BMCBI
2006
158views more  BMCBI 2006»
13 years 5 months ago
Parallelization of multicategory support vector machines (PMC-SVM) for classifying microarray data
Background: Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of data classification problems. Since the p...
Chaoyang Zhang, Peng Li, Arun Rajendran, Youping D...
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 5 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
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
14 years 5 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...