Comment on: Decomposition of structural learning about directed acyclic graphs [1]
Artificial Intelligence
2018-07-02 v1
Abstract
We propose an alternative proof concerning necessary and sufficient conditions to split the problem of searching for d-separators and building the skeleton of a DAG into small problems for every node of a separation tree T. The proof is simpler than the original [1]. The same proof structure has been used in [2] for learning the structure of multivariate regression chain graphs (MVR CGs).
Keywords
Cite
@article{arxiv.1806.11103,
title = {Comment on: Decomposition of structural learning about directed acyclic graphs [1]},
author = {Mohammad Ali Javidian and Marco Valtorta},
journal= {arXiv preprint arXiv:1806.11103},
year = {2018}
}
Comments
5 pages, 2 figures