Incremental Junction Tree Inference

DOI10.1007/978-3-319-40596-4_28zbMATH Open1452.68197OpenAlexW2486290061MaRDI QIDQ5115741FDOQ5115741

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

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

Cites Work

• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• The computational complexity of probabilistic inference using Bayesian belief networks
• Speeding-up structured probabilistic inference using pattern mining
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Lifted Dynamic Junction Tree Algorithm

   Recommendations

• Improvement of the junction tree algorithm for exact inference in dynamic Bayesian networks 👍 👎
• Title not available (Why is that?) 👍 👎
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation 👍 👎
• Lifted Dynamic Junction Tree Algorithm 👍 👎
• Incremental and Efficient Computation of Families of Component Trees 👍 👎
• A Junction Tree Framework for Undirected Graphical Model Selection 👍 👎
• Title not available (Why is that?) 👍 👎
• Sequential sampling of junction trees for decomposable graphs 👍 👎

This page was built for publication: Incremental Junction Tree Inference

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