945 search results - page 16 / 189 » Improved Boosting Algorithms using Confidence-Rated Predicti... |
107
Voted
ICPR
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
IJCAI
2003
15 years 2 months ago
2003
In this paper we propose the framework of Monte Carlo algorithms as a useful one to analyze ensemble learning. In particular, this framework allows one to guess when bagging will ...
131
Voted
WWW
2011
ACM
14 years 7 months ago
2011
ACM
Our objective is to improve the performance of keyword based image search engines by re-ranking their baseline results. To this end, we address three limitations of existing searc...
81
Voted
KDD
2005
ACM
16 years 1 months ago
2005
ACM
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
101
click to vote
FSKD
2009
Springer
15 years 5 months ago
2009
Springer
—This paper presents some preliminary experimental results on RegionBoost, which is a typical example of a class of Boosting algorithms based on dynamic weighting schemes. It is ...