Decomposition of search for v-structures in DAGs

Authors:
Zhi Geng;Chi Wang;Qiang Zhao
Affiliations:
School of Mathematical Sciences, Peking University, Beijing 100871, China;School of Mathematical Sciences, Peking University, Beijing 100871, China;School of Mathematical Sciences, Peking University, Beijing 100871, China
Venue:
Journal of Multivariate Analysis
Year:
2005

Citing 3
Cited 6

A tutorial on learning with Bayesian networks

Learning in graphical models
Equivalence and synthesis of causal models

UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
An algorithm for finding minimum d-separating sets in belief networks

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

Decomposition of structural learning about directed acyclic graphs

Artificial Intelligence
A Recursive Method for Structural Learning of Directed Acyclic Graphs

The Journal of Machine Learning Research
Decomposition of structural learning about directed acyclic graphs

Artificial Intelligence
A note on minimal d-separation trees for structural learning

Artificial Intelligence
Combination of network construction and cluster analysis and its application to traditional chinese medicine

ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part III
Structural learning of graphical models and its applications to traditional chinese medicine

FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.