20197 search results - page 3394 / 4040 » Comparing Computational Power |
156
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...
214
Voted
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
184
Voted
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
188
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive ...
200
Voted
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...