Incremental Junction Tree Inference
From MaRDI portal
Publication:5115741
Recommendations
- Improvement of the junction tree algorithm for exact inference in dynamic Bayesian networks
- scientific article; zbMATH DE number 1222281
- 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
- scientific article; zbMATH DE number 1735976
- Sequential sampling of junction trees for decomposable graphs
Cites work
- scientific article; zbMATH DE number 4178809 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Lazy propagation: A junction tree inference algorithm based on lazy evaluation
- Probabilistic graphical models.
- Speeding-up structured probabilistic inference using pattern mining
- The computational complexity of probabilistic inference using Bayesian belief networks
Cited in
(4)
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)