Decomposition of structural learning about directed acyclic graphs

@article{Xie2006DecompositionOS,
  title={Decomposition of structural learning about directed acyclic graphs},
  author={Xianchao Xie and Zhi Geng and Qiang Zhao},
  journal={Artif. Intell.},
  year={2006},
  volume={170},
  pages={422-439}
}
In this paper, we propose that structural learning of a directed acyclic graph can be decomposed into problems related to its decomposed subgraphs. The decomposition of structural learning requires conditional independencies, but it does not require that separators are complete undirected subgraphs. Domain or prior knowledge of conditional independencies can be utilized to facilitate the decomposition of structural learning. By decomposition, search for d-separators in a large network is… CONTINUE READING