Decomposition of search for v-structures in DAGs
We show that the problem of searching for v-structures in a directed acyclic graph can be decomposed into searches in its decomposed subgraphs. This result simplifies the search for v-structures and the recovery of local causal relationships.
Year of publication: |
2005
|
---|---|
Authors: | Geng, Zhi ; Wang, Chi ; Zhao, Qiang |
Published in: |
Journal of Multivariate Analysis. - Elsevier, ISSN 0047-259X. - Vol. 96.2005, 2, p. 282-294
|
Publisher: |
Elsevier |
Keywords: | Decomposition Directed acyclic graph Moral graph v-structure |
Saved in:
Saved in favorites
Similar items by person
-
Wang, Changzhang, (2014)
-
Bayesian method for learning graphical models with incompletely categorical data
Geng, Zhi, (2003)
-
Wang, Chi, (1961)
- More ...