Distributional equivalence and structure learning for bow-free acyclic path diagrams
We consider the problem of structure learning for bow-free acyclic path diagrams (BAPs). BAPs can be viewed as a generalization of linear Gaussian DAG models that allow for certain hidden variables. We present a first method for this problem using a greedy score-based search algorithm. We also prove...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Published: |
Institute of Mathematical Statistics
2017
|