FAST FACTORISATION OF PROBABILISTIC POTENTIALS AND ITS APPLICATION TO APPROXIMATE INFERENCE IN BAYESIAN NETWORKS

DOI10.1142/S0218488512500110zbMath1237.68220MaRDI QIDQ2886937

Manuel Gómez-Olmedo, Cora B. Pérez-Ariza, Antonio Salmerón, Andrés Cano

Publication date: 14 May 2012

Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

zbMATH Keywords

Bayesian networks; factorisation; probabilistic inference; probability trees

Mathematics Subject Classification ID

68T37: Reasoning under uncertainty in the context of artificial intelligence

Related Items

New strategies for finding multiplicative decompositions of probability trees

Uses Software

• Beanplot

Cites Work

• SampleSearch: importance sampling in presence of determinism
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Importance sampling in Bayesian networks using probability trees.
• Dynamic importance sampling in Bayesian networks based on probability trees
• Binary join trees for computing marginals in the Shenoy-Shafer architecture
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• The computational complexity of probabilistic inference using Bayesian belief networks
• Lazy evaluation in penniless propagation over join trees
• An Accurate Approximation to the Sampling Distribution of the Studentized Extreme Value Statistic
• Unnamed Item
• Unnamed Item
• Unnamed Item