Sciweavers

2988 search results - page 19 / 598
» Experiments with a New Boosting Algorithm
Sort
View
PAMI
2011
14 years 4 months ago
Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
Ke Chen, Shihai Wang
ECCV
2010
Springer
15 years 3 months ago
Robust Multi-View Boosting with Priors
Many learning tasks for computer vision problems can be described by multiple views or multiple features. These views can be exploited in order to learn from unlabeled data, a.k.a....
NIPS
2003
14 years 11 months ago
Boosting versus Covering
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...
Kohei Hatano, Manfred K. Warmuth
TREC
2003
14 years 11 months ago
Report on the TREC 2003 Experiments Using Web Topic-Centric Link Analysis
In TREC 2003, our experiments have been concentrated only on the topic distillation task. We first simply apply the term-based technique to the .GOV web collection, and then re-r...
Paricha Ingongngam, Arnon Rungsawang
ICMCS
2006
IEEE
145views Multimedia» more  ICMCS 2006»
15 years 3 months ago
A New Study on Distance Metrics as Similarity Measurement
Distance metric is widely used in similarity estimation. In this paper we find that the most popular Euclidean and Manhattan distance may not be suitable for all data distribution...
Jie Yu, Jaume Amores, Nicu Sebe, Qi Tian