Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
d-Separation: From Theorems to Algorithms
Dan Geiger, Tom Verma, Judea Pearl
An efficient algorithm is developed that identifies all independencies implied by the topology of a Bayesian network. Its correctness and maximality stems from the soundness and completeness of d-separation with respect to probability theory. The algorithm runs in time O ( l E l ) where E is the number of edges in the network.
Pages: 118-125
PS Link:
PDF Link: /papers/89/p118-geiger.pdf
AUTHOR = "Dan Geiger and Tom Verma and Judea Pearl",
TITLE = "d-Separation: From Theorems to Algorithms",
BOOKTITLE = "Proceedings of the Fifth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-89)",
ADDRESS = "Corvallis, Oregon",
YEAR = "1989",
PAGES = "118--125"

hosted by DSL   •   site info   •   help