Join-Graph Propagation Algorithms
From MaRDI portal
Publication:3563087
DOI10.1613/jair.2842zbMath1192.68649arXiv1401.3489OpenAlexW3105784841WikidataQ42175492 ScholiaQ42175492MaRDI QIDQ3563087
Vibhav Gogate, Robert Mateescu, Kalev Kask, Rina Dechter
Publication date: 31 May 2010
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3489
Related Items (9)
Improving probabilistic inference in graphical models with determinism and cycles ⋮ Improved High Dimensional Discrete Bayesian Network Inference using Triplet Region Construction ⋮ Unifying tree decompositions for reasoning in graphical models ⋮ Importance sampling-based estimation over AND/OR search spaces for graphical models ⋮ SampleSearch: importance sampling in presence of determinism ⋮ Approximate structure learning for large Bayesian networks ⋮ Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems ⋮ Solution sampling with random table constraints
This page was built for publication: Join-Graph Propagation Algorithms
