73 search results - page 2 / 15 » Thin Junction Trees |
NIPS
2008
13 years 6 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
IJCAI
2007
13 years 6 months ago
2007
In this paper we prove that the well-known correspondence between the forward-backward algorithm for hidden Markov models (HMMs) and belief propagation (BP) applied to HMMs can be...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
JMLR
2010
13 years 7 days ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
IPPS
2008
IEEE
13 years 12 months ago
2008
IEEE
We present a junction tree decomposition based algorithm for parallel exact inference. This is a novel parallel exact inference method for evidence propagation in an arbitrary jun...