Abstract
We introduce a subclass of chain event graphs that we call stratified chain event graphs, and present a dynamic programming algorithm for the optimal selection of such chain event graphs that maximizes a decomposable score derived from a complete independent sample. We apply the algorithm to such a dataset, with a view to deducing the causal structure of the variables under the hypothesis that there are no unobserved confounders. We show that the algorithm is suitable for small problems. Similarities with and differences to a dynamic programming algorithm for MAP learning of Bayesian networks are highlighted, as are the relations to causal discovery using Bayesian networks.
Citation
Robert G. Cowell. James Q. Smith. "Causal discovery through MAP selection of stratified chain event graphs." Electron. J. Statist. 8 (1) 965 - 997, 2014. https://doi.org/10.1214/14-EJS917
Information