Incremental Junction Tree Inference

DOI10.1007/978-3-319-40596-4_28zbMath1452.68197OpenAlexW2486290061MaRDI QIDQ5115741

Christophe Gonzales, Philippe Bonnard, Pierre-Henri Wuillemin, Hamza Agli

Publication date: 18 August 2020

Published in: Information Processing and Management of Uncertainty in Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: https://hal.sorbonne-universite.fr/hal-01345418/file/article.pdf

zbMATH Keywords

Bayesian networksjunction treeincremental inference

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Probabilistic graphical models (62H22)

Cites Work

• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• Speeding-up structured probabilistic inference using pattern mining
• The computational complexity of probabilistic inference using Bayesian belief networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Incremental Junction Tree Inference