110 search results - page 15 / 22 » Boosting a Weak Learning Algorithm by Majority |
NIPS
2003
13 years 8 months ago
2003
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Gradient boosting is a flexible machine learning technique that produces accurate predictions by combining many weak learners. In this work, we investigate its use in two applica...
ETVC
2008
13 years 9 months ago
2008
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
ICML
1999
IEEE
14 years 8 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. A new approach, called Collective Shape Difference Classifier (CSDC), is proposed to improve the accuracy and computational efficiency of 3D face recognition. The CSDC le...