Sciweavers

227 search results - page 28 / 46
» A PAC Bound for Approximate Support Vector Machines
Sort
View
EUROCOLT
1999
Springer
13 years 11 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
JMLR
2011
148views more  JMLR 2011»
13 years 2 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
ICPR
2008
IEEE
14 years 8 months ago
A discrete-time parallel update algorithm for distributed learning
We present a distributed machine learning framework based on support vector machines that allows classification problems to be solved iteratively through parallel update algorithm...
Christian Bauckhage, Tansu Alpcan
IJBRA
2010
116views more  IJBRA 2010»
13 years 5 months ago
Scaling alignment of large ontologies
: In recent years, the number of ontologies shared on the Web has increased dramatically, supporting a growing set of applications such as biological knowledge sharing, enhanced se...
Suzette Stoutenburg, Jugal Kalita, Kaily Ewing, Li...
UAI
2003
13 years 8 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...