Sciweavers

1014 search results - page 110 / 203
» A Spectral Algorithm for Learning Hidden Markov Models
Sort
View
ICML
2009
IEEE
14 years 2 months ago
Using fast weights to improve persistent contrastive divergence
The most commonly used learning algorithm for restricted Boltzmann machines is contrastive divergence which starts a Markov chain at a data point and runs the chain for only a few...
Tijmen Tieleman, Geoffrey E. Hinton
MACE
2009
Springer
230views Communications» more  MACE 2009»
14 years 2 months ago
Combining Learned and Highly-Reactive Management
Learned models of behavior have the disadvantage that they must be retrained after any change in system configuration. Autonomic management methods based upon learned models lose ...
Alva L. Couch, Marc Chiarini
PDCN
2004
13 years 9 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
HPCS
2005
IEEE
14 years 1 months ago
Parallel Lattice Implementation for Option Pricing under Mixed State-Dependent Volatility Models
— With the principal goal of developing an alternative, relatively simple and tractable pricing framework for accurately reproducing a market implied volatility surface, this pap...
Giuseppe Campolieti, Roman Makarov
UAI
2004
13 years 9 months ago
Iterative Conditional Fitting for Gaussian Ancestral Graph Models
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
Mathias Drton, Thomas S. Richardson