Sciweavers

Share
FLAIRS
2004

Computing Marginals with Hierarchical Acyclic Hypergraphs

8 years 6 months ago
Computing Marginals with Hierarchical Acyclic Hypergraphs
How to compute marginals efficiently is one of major concerned problems in probabilistic reasoning systems. Traditional graphical models do not preserve all conditional independencies while computing the marginals. That is, the Bayesian DAGs have to be transformed into a secondary computational structure, normally, acyclic hypergraphs, in order to compute marginals. It is well-known that some conditional independencies will be lost in such a transformation. In this paper, we suggest a new graphical model which not only equivalents to a Bayesian DAG, but also takes advantages of all conditional independencies to compute marginals. The input to our model is a set of conditional probability tables as in the traditional approach.
S. K. Michael Wong, Tao Lin
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2004
Where FLAIRS
Authors S. K. Michael Wong, Tao Lin
Comments (0)
books