3050 search results - page 289 / 610 » On-line Algorithms in Machine Learning |
130
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficientl...
137
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
137
click to vote
ICMLA
2009
15 years 2 months ago
2009
For many ranking applications we would like to understand not only which items are top-ranked, but also why they are top-ranked. However, many of the best ranking algorithms (e.g....
156
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
132
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...