3114 search results - page 278 / 623 » Distributed Case-Based Learning |
132
Voted
NIPS
2001
15 years 3 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
95
Voted
NIPS
2003
15 years 3 months ago
2003
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
119
Voted
ICANN
2010
Springer
15 years 3 months ago
2010
Springer
We propose a new approach for reinforcement learning in problems with continuous actions. Actions are sampled by means of a diffusion tree, which generates samples in the continuou...
102
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Knowing the largest rate at which data can be sent on an end-to-end path such that the egress rate is equal to the ingress rate with high probability can be very practical when ch...
122
click to vote
JMLR
2008
15 years 2 months ago
2008
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...