Towards characterizing Markov equivalence classes for directed acyclic graphs with latent variables

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 10-17

  Ali, R Ayesha ^a   Richardson, Thomas S ^b   Spirtes, Peter ^c   Zhang, Jiji ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF WASHINGTON   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

DAG; Markov equivalence; Maximal ancestral graph

Indexed keywords

ARTIFICIAL INTELLIGENCE; DIRECTED GRAPHS; GRAPHIC METHODS;

ANCESTRAL GRAPHS; CAUSAL EXPLANATIONS; CONDITIONAL INDEPENDENCES; DIRECTED ACYCLIC GRAPH (DAG); MARKOV EQUIVALENCE CLASS; MARKOV EQUIVALENCES; MAXIMAL ANCESTRAL GRAPHS; SOUND AND COMPLETE;

EQUIVALENCE CLASSES;

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

References (15)

1. Ali, R. A. and T. Richardson (2002). Markov equivalence classes for maximal ancestral graphs. In A. Darwiche and N. Friedman (Eds.), Uncertainty in Artificial Intelligence: Proceedings of the 18th Conference, San Francisco, pp. 1-8. Morgan Kaufmann.
2. Ali, R. A. and T. Richardson (2004). Searching across markov equivalence classes of maximal ancestral graphs. In 2004 Proceedings of the American Statistical Association, Statistical Computing Section [CD-ROM], Toronto, ON, pp. 2383-2391. American Statistical Association.
3. Ali, R. A., T. Richardson, and P. Spirtes (2004). Markov equivalence for ancestral graphs. Technical Report 466, Department of Statistics, University of Washington.
4. Ali, R. A., T. Richardson, P. Spirtes, and J. Zhang (2005). Orientation rules for constructing markov equivalence classes for maximal ancestral graphs. Technical Report 476, Department of Statistics, University of Washington.
5. Andersson, S. A., D. Madigan, and M. D. Perlman (1997). A characterization of Markov equivalence classes for acyclic digraphs. Ann. Statist. 25, 505-541.
6. Chickering, D. (1995). A transformational characterization of equivalent Bayesian networks. In P. Besnard and S. Hanks (Eds.), Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence, San Mateo, CA, pp. 87-98. Morgan Kaufmann.
7. Drton, M. and T. Richardson (2004). Iterative conditional fitting for gaussian ancestral graph models. In Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI-04), Arlington, Virginia, pp. 130-137. AUAI Press.
8. Frydenberg, M. (1990). The chain graph Markov property. Scand. J. Statist. 17, 333-353.
9. McDonald, R. (2002). What can we learn from the path equations?: identifiability, constraints, equivalence. Psychometrika 67 (2), 225-249.
10. Meek, C. (1995). Causal inference and causal explanation with background knowledge. In P. Besnard and S. Hanks (Eds.), Uncertainty in Artificial Intelligence: Proceedings of the 11th Conference, San Francisco, pp. 403-410. Morgan Kaufmann.
11. Richardson, T. and P. Spirtes (2003). Causal inference via ancestral graph models. In P. Green, N. Hjort, and S. Richardson (Eds.), Highly Structured Stochastic Systems. Oxford: Oxford University Press.
12. Richardson, T. S. and P. Spirtes (2002). Ancestral graph Markov models. Annals of Statistics 30 (4), 962-1030. (Pubitemid 37095336)
13. Spirtes, P., C. Glymour, and R. Scheines (1993). Causation, Prediction and Search. Number 81 in Lecture Notes in Statistics. Springer-Verlag.
14. Spirtes, P., C. Meek, and T. S. Richardson (1999). Causal inference in the presence of latent variables and selection bias. In C. Glymour and G. F. Cooper (Eds.), Computation, Causality and Discovery, pp. 211-252. Cambridge, Mass.: MIT Press.
15. Verma, T. and J. Pearl (1991). Equivalence and synthesis of causal models. Technical Report R-150, Cognitive Systems Laboratory, UCLA.