105 search results - page 20 / 21 » The generalized Bayesian committee machine |
TKDE
2010
13 years 3 months ago
2010
—Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not complet...
CIVR
2008
Springer
13 years 7 months ago
2008
Springer
We present a probabilistic ranking-driven classifier for the detection of video semantic concept, such as airplane, building, etc. Most existing concept detection systems utilize ...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
COLT
1997
Springer
13 years 9 months ago
1997
Springer
: In this paper we prove sanity-check bounds for the error of the leave-one-out cross-validation estimate of the generalization error: that is, bounds showing that the worst-case e...
JMLR
2010
13 years 1 days ago
2010
Model selection strategies for machine learning algorithms typically involve the numerical optimisation of an appropriate model selection criterion, often based on an estimator of...