Title of article
An alternative characterization of a Bayesian network Original Research Article
Author/Authors
S.K.M. Wong، نويسنده , , T. Lin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
14
From page
221
To page
234
Abstract
To build a Bayesian network (BN), one may directly construct a directed acyclic graph (DAG) based on the causal relationships of the domain variables. However, it may be necessary in many applications to construct a DAG from the conditional independencies (CIs) supplied by different sources or experts. In this paper we provide an alternative characterization of the graphical structure of a BN. Based on this characterization, one can easily test whether an arbitrary set of CIs can be faithfully represented by a DAG.
Keywords
Directed acyclic graphs , Acyclic hypergraphs , Hierarchical conditional independencies , Bayesian networks
Journal title
International Journal of Approximate Reasoning
Serial Year
2003
Journal title
International Journal of Approximate Reasoning
Record number
1181884
Link To Document