Sciweavers

12 search results - page 2 / 3
» A New Algorithm for Training SVMs Using Approximate Minimal ...
Sort
View
SADM
2010
128views more  SADM 2010»
13 years 3 months ago
Online training on a budget of support vector machines using twin prototypes
: This paper proposes twin prototype support vector machine (TVM), a constant space and sublinear time support vector machine (SVM) algorithm for online learning. TVM achieves its ...
Zhuang Wang, Slobodan Vucetic
COCOA
2008
Springer
13 years 7 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
JMLR
2010
192views more  JMLR 2010»
13 years 3 days ago
Efficient Learning of Deep Boltzmann Machines
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
Ruslan Salakhutdinov, Hugo Larochelle
ICANN
2007
Springer
13 years 11 months ago
MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
Leonardo Franco, José Luis Subirats, Jos&ea...
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
14 years 2 months ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic