Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
From MaRDI portal
Publication:2886937
DOI10.1142/S0218488512500110zbMATH Open1237.68220MaRDI QIDQ2886937FDOQ2886937
Authors: Andrés Cano, Manuel Gómez-Olmedo, Cora B. Pérez-Ariza, Antonio Salmerón 
Publication date: 14 May 2012
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Recommendations
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Approximate inference in Bayesian networks using binary probability trees
- Binary Probability Trees for Bayesian Networks Inference
- On linear potential functions for approximating Bayesian computations
- scientific article; zbMATH DE number 1553119
Cites Work
- Title not available (Why is that?)
- Importance sampling in Bayesian networks using probability trees.
- Lazy evaluation in penniless propagation over join trees
- An Accurate Approximation to the Sampling Distribution of the Studentized Extreme Value Statistic
- Title not available (Why is that?)
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Lazy propagation: A junction tree inference algorithm based on lazy evaluation
- The computational complexity of probabilistic inference using Bayesian belief networks
- SampleSearch: importance sampling in presence of determinism
- Binary join trees for computing marginals in the Shenoy-Shafer architecture
- Dynamic importance sampling in Bayesian networks based on probability trees
- Title not available (Why is that?)
Cited In (8)
- Online inference based on approximate factors for probabilistic knowledge bases
- Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
- New strategies for finding multiplicative decompositions of probability trees
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Marginalization without summation. Exploiting determinism in factor algebra
- Approximate inference in Bayesian networks using binary probability trees
- Decomposition and approximation of loopy Bayesian networks
- Operating with potentials of discrete variables
Uses Software
This page was built for publication: Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2886937)
