Sciweavers

45 search results - page 7 / 9
» Regularized Boost for Semi-Supervised Learning
Sort
View
KDD
2010
ACM
257views Data Mining» more  KDD 2010»
14 years 2 months ago
Multi-task learning for boosting with application to web search ranking
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
Olivier Chapelle, Pannagadatta K. Shivaswamy, Srin...
ECCV
2010
Springer
14 years 4 months ago
Robust Multi-View Boosting with Priors
Many learning tasks for computer vision problems can be described by multiple views or multiple features. These views can be exploited in order to learn from unlabeled data, a.k.a....
ICML
2009
IEEE
14 years 11 months ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
PAMI
2012
12 years 1 months ago
UBoost: Boosting with the Universum
—It has been shown that the Universum data, which do not belong to either class of the classification problem of interest, may contain useful prior domain knowledge for training...
Chunhua Shen, Peng Wang, Fumin Shen, Hanzi Wang
ICML
2003
IEEE
14 years 11 months ago
Boosting Lazy Decision Trees
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
Xiaoli Zhang Fern, Carla E. Brodley