Computing marginals for arbitrary subsets from marginal representation in Markov trees

DOI10.1016/0004-3702(94)00059-AzbMath1013.68557MaRDI QIDQ1855211

Hong Xu

Publication date: 4 February 2003

Published in: Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30)

Related Items (3)

Partial abductive inference in Bayesian belief networks by simulated annealing ⋮ SIMPLIFYING EXPLANATIONS IN BAYESIAN BELIEF NETWORKS ⋮ Computing marginals for arbitrary subsets from marginal representation in Markov trees

Cites Work

• Unnamed Item
• Unnamed Item
• Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
• Conditional independence in valuation-based systems
• Computing marginals for arbitrary subsets from marginal representation in Markov trees
• An axiomatic framework for propagating uncertainty in directed acyclic networks
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• An algebra of bayesian belief universes for knowledge‐based systems

This page was built for publication: Computing marginals for arbitrary subsets from marginal representation in Markov trees