1222 search results - page 184 / 245 » Machine Learning of Temporal Relations |
140
Voted
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
154
Voted
COLT
2000
Springer
15 years 10 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
142
Voted
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
215
click to vote
EUROCOLT
1999
Springer
15 years 9 months ago
1999
Springer
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...
155
click to vote
COLT
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...