Methods for constructing balanced elimination trees and other recursive decompositions

DOI10.1016/J.IJAR.2009.04.010zbMATH Open1191.68677OpenAlexW1967824220MaRDI QIDQ962958FDOQ962958

Authors: Kevin Grant, Michael C. Horsch 

Publication date: 7 April 2010

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2009.04.010

Recommendations

• scientific article; zbMATH DE number 1844471
• Binary Probability Trees for Bayesian Networks Inference
• Recursive conditioning
• Bayesian network inference using marginal trees
• Approximate inference in Bayesian networks using binary probability trees

zbMATH Keywords

Bayesian networkscompilation of graphical modelsrecursive factorizations

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Bucket elimination: A unifying framework for reasoning
• Recursive conditioning
• Title not available (Why is that?)
• Inference in belief networks: A procedural guide
• Anytime anyspace probabilistic inference
• Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
• Title not available (Why is that?)
• AI 2005: Advances in Artificial Intelligence

Cited In (5)

• Learning tractable Bayesian networks in the space of elimination orders
• Title not available (Why is that?)
• On constructing the elimination tree
• Balanced trees with removals: An exercise in rewriting and proof
• The role of graph structures in the theory of local elimination algorithms

This page was built for publication: Methods for constructing balanced elimination trees and other recursive decompositions

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