Distributional equivalence and structure learning for bow-free acyclic path diagrams
From MaRDI portal
Publication:1689000
DOI10.1214/17-EJS1372zbMATH Open1384.62209arXiv1508.01717OpenAlexW2964161256MaRDI QIDQ1689000FDOQ1689000
Authors: Peng Zhang
Publication date: 12 January 2018
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Abstract: 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 some necessary and some sufficient conditions for distributional equivalence of BAPs which are used in an algorithmic ap- proach to compute (nearly) equivalent model structures. This allows us to infer lower bounds of causal effects. We also present applications to real and simulated datasets using our publicly available R-package.
Full work available at URL: https://arxiv.org/abs/1508.01717
Recommendations
- Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
- Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
- Robust Causal Structure Learning with Some Hidden Variables
- 10.1162/153244302760200696
- scientific article
causal inferencelatent variablesstructure learningstructural equation modelshidden variablesgreedy searchdistributional equivalencepath diagrams
Cited In (4)
Uses Software
This page was built for publication: Distributional equivalence and structure learning for bow-free acyclic path diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689000)