Sciweavers

1683 search results - page 97 / 337
» Learning with Mixtures of Trees
Sort
View
ECML
2006
Springer
14 years 27 days ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
Sébastien Jodogne, Cyril Briquet, Justus H....
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 9 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin
ECML
2007
Springer
14 years 3 months ago
Additive Groves of Regression Trees
We present a new regression algorithm called Additive Groves and show empirically that it is superior in performance to a number of other established regression methods. A single G...
Daria Sorokina, Rich Caruana, Mirek Riedewald
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
11 years 11 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray

Publication
404views
14 years 6 months ago
Bayesian variable order Markov models.
We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism used is close to that employed in context tree wei...
Christos Dimitrakakis