Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks

DOI10.1142/S0218488512500110MaRDI QIDQ2886937zbMATH OpenFDO

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)

zbMATH Keywords

Bayesian networksprobabilistic inferenceprobability treesfactorisation

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

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

• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 2036245 (Why is no real title available?)
• scientific article; zbMATH DE number 1553119 (Why is no real title available?)
• An Accurate Approximation to the Sampling Distribution of the Studentized Extreme Value Statistic
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• Dynamic importance sampling in Bayesian networks based on probability trees
• Importance sampling in Bayesian networks using probability trees.
• Lazy evaluation in penniless propagation over join trees
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• SampleSearch: importance sampling in presence of determinism
• The computational complexity of probabilistic inference using Bayesian belief networks

Cited in

(8)

• Operating with potentials of discrete variables
• 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

Describes a project that uses

Uses Software

• Beanplot

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)