This work was partially supported by the National Science Foundation Grant #IRI-8821444.
Identifying independence in bayesian networks†
Article first published online: 11 OCT 2006
Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
Volume 20, Issue 5, pages 507–534, August 1990
How to Cite
Geiger, D., Verma, T. and Pearl, J. (1990), Identifying independence in bayesian networks. Networks, 20: 507–534. doi: 10.1002/net.3230200504
- Issue published online: 11 OCT 2006
- Article first published online: 11 OCT 2006
An important feature of Bayesian networks is that they facilitate explicit encoding of information about independencies in the domain, information that is indispensable for efficient inferencing. This article characterizes all independence assertions that logically follow from the topology of a network and develops a linear time algorithm that identifies these assertions. The algorithm's correctness is based on the soundness of a graphical criterion, called d-separation, and its optimality stems from the completeness of d-separation. An enhanced version of d-separation, called D-separation, is defined, extending the algorithm to networks that encode functional dependencies. Finally, the algorithm is shown to work for a broad class of nonprobabilistic independencies.