Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
type: Item
instance of: scholarly article
zbMATH Open document ID: 1237.68220
DOI: 10.1142/S0218488512500110
author: Andrés Cano
author: Manuel Gómez-Olmedo
author: Cora B. Pérez-Ariza
author: Antonio Salmerón
published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
publication date: 2012-05-14T00:00:00Z
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 6035209
zbMATH Keywords: Bayesian networks
zbMATH Keywords: probability trees
zbMATH Keywords: factorisation
zbMATH Keywords: probabilistic inference
describes a project that uses: Beanplot
MaRDI profile type: Publication
cites work: Q3997653
cites work: Q4445622
cites work: Lazy propagation: A junction tree inference algorithm based on lazy evaluation
cites work: Binary join trees for computing marginals in the Shenoy-Shafer architecture
cites work: Q4525198
cites work: Lazy evaluation in penniless propagation over join trees
cites work: SampleSearch: importance sampling in presence of determinism
cites work: Dynamic importance sampling in Bayesian networks based on probability trees
cites work: Importance sampling in Bayesian networks using probability trees.
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard
cites work: An Accurate Approximation to the Sampling Distribution of the Studentized Extreme Value Statistic
title: Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
description: scientific article; zbMATH DE number 6035209