Methods for constructing balanced elimination trees and other recursive decompositions

DOI10.1016/j.ijar.2009.04.010zbMath1191.68677OpenAlexW1967824220MaRDI QIDQ962958

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

zbMATH Keywords

Bayesian networkscompilation of graphical modelsrecursive factorizations

Mathematics Subject Classification ID

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

Related Items (1)

Learning tractable Bayesian networks in the space of elimination orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anytime anyspace probabilistic inference
• Inference in belief networks: A procedural guide
• Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
• Bucket elimination: A unifying framework for reasoning
• AI 2005: Advances in Artificial Intelligence
• Recursive conditioning

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