Two optimal strategies for active learning of causal models from interventions

Proceedings of the 6th European Workshop on Probabilistic Graphical Models, PGM 2012

Volumn , Issue , 2012, Pages 123-130

  Hauser, Alain ^a   Bühlmann, Peter ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE LEARNING; ACTIVE LEARNING STRATEGIES; CAUSAL MODEL; GREEDY APPROACHES; IDENTIFIABILITY; INTERVENTIONAL; LEARNING GOALS; MARKOV EQUIVALENCES; OBSERVATIONAL DATA; OPTIMAL INTERVENTION; OPTIMAL STRATEGIES; POLYNOMIAL-TIME; SIMULATION STUDIES;

GRAPHIC METHODS; SOFTWARE ENGINEERING;

POLYNOMIAL APPROXIMATION;

EID: 84874748569     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. S.A. Andersson, D. Madigan, and M.D. Perlman. 1997. A characterization of Markov equivalence classes for acyclic digraphs. Ann. Stat., 25(2):505-541.
2. M.-C. Cai. 1984. On separating systems of graphs. Disc. Math., 49:15-20.
3. V. Chvâtal. 1984. Perfectly ordered graphs. Ann. Disc. Math., 21:63-68.
4. F. Eberhardt. 2007. Causation and Intervention. Ph.D. thesis, Carnegie Mellon University.
5. F. Eberhardt. 2008. Almost optimal intervention sets for causal discovery. In UAI, pp. 161-168.
6. A. Häuser and P. Bühlmann. 2012. Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs. To appear in JMLR; arxiv preprint arXiv: 1104-2808.
7. Y.-B. He and Z. Geng. 2008. Active learning of causal networks with intervention experiments and optimal designs. JMLR, 9:2523-2547.
8. E.L. Kaplan and P. Meier. 1958. Nonparametric estimation from incomplete observations. JASA, pp. 457-481.
9. K.B. Korb, L.R. Hope, A.E. Nicholson, and K. Axnick. 2004. Varieties of causal intervention. In PRICAI, pp. 322-331.
10. J. Pearl. 1995. Causal diagrams for empirical research. Biometrika, 82:669-688.
11. J. Peters, J.M. Mooij, D. Janzing, and B. Schölkopf. 2011. Identifiability of causal graphs using functional models. In UAI, pp. 589-598.
12. D.J. Rose, R.E. Tarjan, and G.S. Lueker. 1976. Algorithmic aspects of vertex elimination on graphs. SI AM Journal on Computing, 5(2):266-283.
13. D.J. Rose. 1970. Triangulated graphs and the elimination process. Journal of Mathematical Analysis and Applications, 32(3):597-609.
14. P. Spirtes, C.N. Glymour, and R. Schemes. 2000. Causation, Prediction, and Search.
15. S. Tong and D. Koller. 2001. Active learning for structure in Bayesian networks. In IJCAI, vol 17, pp. 863-869.
16. T. Verma and J. Pearl. 1990. On the equivalence of causal models. In UAI, pp. 220-227.