Sciweavers

2988 search results - page 17 / 598
» Experiments with a New Boosting Algorithm
Sort
View
COLT
2005
Springer
15 years 5 months ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...
PAMI
2006
128views more  PAMI 2006»
14 years 11 months ago
On Weighting Clustering
Recent papers and patents in iterative unsupervised learning have emphasized a new trend in clustering. It basically consists of penalizing solutions via weights on the instance po...
Richard Nock, Frank Nielsen
FOCS
1999
IEEE
15 years 4 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
ICPR
2004
IEEE
16 years 26 days ago
Resolution Enhancement by AdaBoost
This paper proposes a learning scheme based still image super-resolution reconstruction algorithm. Superresolution reconstruction is proposed as a binary classification problem an...
Bhaskar D. Rao, Junwen Wu, Mohan M. Trivedi
ICML
2004
IEEE
16 years 17 days ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer