Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!
Add to Chrome
Add to Firefox
Add to Edged-Separation: From Theorems to Algorithms
Paper and Code
Mar 27, 2013
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.
* Appears in Proceedings of the Fifth Conference on Uncertainty in
Artificial Intelligence (UAI1989)
View paper on