Sciweavers

701 search results - page 74 / 141
» Self Bounding Learning Algorithms
Sort
View
CVPR
2000
IEEE
14 years 3 days ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
EUROCOLT
1999
Springer
13 years 12 months ago
Averaging Expert Predictions
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...
Jyrki Kivinen, Manfred K. Warmuth
ML
2007
ACM
153views Machine Learning» more  ML 2007»
13 years 7 months ago
Multi-Class Learning by Smoothed Boosting
AdaBoost.OC has been shown to be an effective method in boosting “weak” binary classifiers for multi-class learning. It employs the Error-Correcting Output Code (ECOC) method ...
Rong Jin, Jian Zhang 0003
SIGECOM
2010
ACM
149views ECommerce» more  SIGECOM 2010»
14 years 15 days ago
A new understanding of prediction markets via no-regret learning
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
Yiling Chen, Jennifer Wortman Vaughan
DATAMINE
2006
166views more  DATAMINE 2006»
13 years 7 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis