Tools and algorithms for causally interpreting directed edges in maximal ancestral graphs

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

Volumn , Issue , 2012, Pages 35-42

  Borboudakis, Giorgos ^b   Triantafillou, Sofia ^a   Tsamardinos, Ioannis ^a  

^a UNIVERSITY OF CRETE   (Greece)

^b INSTITUTE OF COMPUTER SCIENCE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

DENSE NETWORK; DIRECTED EDGES; EDGE DENSITIES; MAXIMAL ANCESTRAL GRAPHS; POLYNOMIAL-TIME ALGORITHMS; SIMULATED EXPERIMENTS;

ALGORITHMS; BAYESIAN NETWORKS;

DIRECTED GRAPHS;

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

References (6)

1. Z. Cai, M. Kuroki, J. Pearl, and J. Tian. 2008. Bounds on Direct Effects in the Presence of Confounded Intermediate Variables. Biometrics, 64:695-701.
2. J. Pearl. 2000. Causality, Models, Reasoning, and Inference. Cambridge University Press, Cambridge, U.K.
3. J. Peters, J. M. Mooij, D. Janzing, and B. Schölkopf. 2012. Identifiability of causal graphs using functional models. CoRR, abs/1202.3757.
4. Th. Richardson and P. Spirtes. 2002. Ancestral graph Markov models. Annals of Statistics, 30(4):962-1030.
5. P. Spirtes, C. Glymour, and R. Schemes. 2000. Causation, Prediction, and Search. MIT Press, Cambridge, MA, 2nd edition.
6. J. Zhang. 2008. Causal reasoning with ancestral graphs. J. Mach. Learn. Res., 9:1437-1474.