Decomposition and approximation of loopy Bayesian networks

DOI10.3233/FI-2013-856MaRDI QIDQ2843820zbMATH OpenOpenAlexFDO

Authors Jianwu Dong, Feng Chen, Yanyan Huo, Hong Liu

Publication date 26 August 2013

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2013-856

zbMATH Keywords

Bayesian networkconditional probability tabledecompositioninference

Mathematics Subject Classification ID

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

Recommendations

• Approximate inference in Bayesian networks using binary probability trees
• Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
• scientific article; zbMATH DE number 5547949
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• A decomposition algorithm for learning Bayesian networks based on scoring function

Cited in

(1)

• An approximate tensor-based inference method applied to the game of Minesweeper

This page was built for publication: Decomposition and approximation of loopy Bayesian networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843820)