Sciweavers

49 search results - page 4 / 10
» A decision-theoretic generalization of on-line learning and ...
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
COLT
2001
Springer
13 years 12 months ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
ICML
1998
IEEE
14 years 8 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
ICRA
2005
IEEE
122views Robotics» more  ICRA 2005»
14 years 1 months ago
Supervised Learning of Places from Range Data using AdaBoost
— This paper addresses the problem of classifying places in the environment of a mobile robot into semantic categories. We believe that semantic information about the type of pla...
Óscar Martínez Mozos, Cyrill Stachni...
CVPR
2009
IEEE
15 years 2 months ago
Regularized Multi-Class Semi-Supervised Boosting
Many semi-supervised learning algorithms only deal with binary classification. Their extension to the multi-class problem is usually obtained by repeatedly solving a set of bina...
Amir Saffari, Christian Leistner, Horst Bischof