## Reading Dependencies from Polytree-Like Bayesian Networks Revisited

by
Jose M. Peña

Citations: | 1 - 1 self |

### BibTeX

@MISC{Peña_readingdependencies,

author = {Jose M. Peña},

title = {Reading Dependencies from Polytree-Like Bayesian Networks Revisited},

year = {}

}

### OpenURL

### Abstract

We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p, under the assumption that G is a polytree and p satisfies weak transitivity. We prove that the criterion is sound and complete. We argue that assuming weak transitivity is not too restrictive. 1