3050 search results - page 464 / 610 » On-line Algorithms in Machine Learning |
120
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
148
Voted
AIA
2007
15 years 6 months ago
2007
A fundamental assumption often made in supervised classification is that the problem is static, i.e. the description of the classes does not change with time. However many practi...
185
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
163
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Many modern visual recognition algorithms incorporate a step of spatial `pooling', where the outputs of several nearby feature detectors are combined into a local or global `...
158
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...