Sciweavers

27 search results - page 4 / 6
» Multi-Class Learning by Smoothed Boosting
Sort
View
ISVC
2007
Springer
14 years 1 months ago
Boosting with Temporal Consistent Learners: An Application to Human Activity Recognition
We present a novel boosting algorithm where temporal consistency is addressed in a short-term way. Although temporal correlation of observed data may be an important cue for classi...
Pedro Canotilho Ribeiro, Plinio Moreno, José...
ICCV
2007
IEEE
14 years 9 months ago
Locally Smooth Metric Learning with Application to Image Retrieval
In this paper, we propose a novel metric learning method based on regularized moving least squares. Unlike most previous metric learning methods which learn a global Mahalanobis d...
Dit-Yan Yeung, Hong Chang
PAMI
2011
13 years 1 months ago
Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
Ke Chen, Shihai Wang
COLT
2005
Springer
14 years 14 days ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...
CORR
2011
Springer
127views Education» more  CORR 2011»
12 years 10 months ago
Generalized Boosting Algorithms for Convex Optimization
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
Alexander Grubb, J. Andrew Bagnell