3050 search results - page 463 / 610 » On-line Algorithms in Machine Learning |
138
click to vote
COLT
2001
Springer
15 years 9 months ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
132
click to vote
COLT
2000
Springer
15 years 9 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...
180
click to vote
ALT
1999
Springer
15 years 8 months ago
1999
Springer
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
151
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
In some retrieval situations, a system must search across multiple collections. This task, referred to as federated search, occurs for example when searching a distributed index o...
145
Voted
ECML
2004
Springer
15 years 8 months ago
2004
Springer
It is well-known that naive Bayes performs surprisingly well in classification, but its probability estimation is poor. In many applications, however, a ranking based on class prob...