Sciweavers

13414 search results - page 2 / 2683
» The distributed boosting algorithm
Sort
View
ALT
2008
Springer
14 years 1 months ago
Smooth Boosting for Margin-Based Ranking
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masa...
NIPS
2007
13 years 6 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
ICS
2010
Tsinghua U.
14 years 2 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
COCO
2009
Springer
99views Algorithms» more  COCO 2009»
13 years 8 months ago
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan
ICPR
2008
IEEE
14 years 6 months ago
Collaborative learning by boosting in distributed environments
In this paper we propose a new distributed learning method called distributed network boosting (DNB) algorithm for distributed applications. The learned hypotheses are exchanged b...
Shijun Wang, Changshui Zhang