Sciweavers

2177 search results - page 21 / 436
» Relative Margin Machines
Sort
View
JMLR
2012
11 years 10 months ago
Maximum Margin Temporal Clustering
Temporal Clustering (TC) refers to the factorization of multiple time series into a set of non-overlapping segments that belong to k temporal clusters. Existing methods based on e...
Minh Hoai Nguyen, Fernando De la Torre
ICML
2005
IEEE
14 years 8 months ago
Unifying the error-correcting and output-code AdaBoost within the margin framework
In this paper, we present a new interpretation of AdaBoost.ECC and AdaBoost.OC. We show that AdaBoost.ECC performs stage-wise functional gradient descent on a cost function, defin...
Yijun Sun, Sinisa Todorovic, Jian Li, Dapeng Wu
ICML
2004
IEEE
14 years 8 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer
COLT
2000
Springer
13 years 12 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
ICML
2008
IEEE
14 years 8 months ago
Laplace maximum margin Markov networks
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
Jun Zhu, Eric P. Xing, Bo Zhang