Sciweavers

105 search results - page 10 / 21
» Latent Tree Models and Approximate Inference in Bayesian Net...
Sort
View
JMLR
2010
192views more  JMLR 2010»
13 years 2 months ago
Efficient Learning of Deep Boltzmann Machines
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
Ruslan Salakhutdinov, Hugo Larochelle
ECSQARU
2005
Springer
14 years 28 days ago
Nonlinear Deterministic Relationships in Bayesian Networks
In a Bayesian network with continuous variables containing a variable(s) that is a conditionally deterministic function of its continuous parents, the joint density function for t...
Barry R. Cobb, Prakash P. Shenoy
NN
1997
Springer
174views Neural Networks» more  NN 1997»
13 years 11 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
IJAR
2008
167views more  IJAR 2008»
13 years 7 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
ICIP
2008
IEEE
14 years 1 months ago
Total variation super resolution using a variational approach
In this paper we propose a novel algorithm for super resolution based on total variation prior and variational distribution approximations. We formulate the problem using a hierar...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...