A unified approach to the characterization of equivalence classes of DAGs, chain graphs with no flags and chain graphs

Scandinavian Journal of Statistics

Volumn 32, Issue 2, 2005, Pages 295-312

  Roverato, Alberto ^a  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Chain graph; Chain graph with no flags; Conditional independence; Directed acyclic graph; Essential graph; Graphical model; Markov equivalence; Markov property; Meta arrow

Indexed keywords

EID: 19744369870     PISSN: 03036898     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-9469.2005.00422.x     Document Type: Review

References (27)

1. Andersson, S. A., Madigan, D. & Perlman, M. D. (1997a). A characterization of Markov equivalence classes for acyclic digraphs. Ann. Statist. 25, 505-541.
2. Andersson, S. A., Madigan, D. & Perlman, M. D. (1997b). On the Markov equivalence of chain graphs, undirected graphs, and acyclic digraphs. Scand. J. Statist. 24, 81-102.
3. Andersson, S. A., Madigan, D. & Perlman, M. D. (2001). Alternative Markov properties for chain graphs. Scand. J. Statist. 28, 33-85.
4. Chickering, D. M. (1995). A transformation characterization of equivalent Bayesian network structures. In Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (eds P. Besnard & S. Hanks), 87-98. Morgan Kaufmann, San Francisco, CA.
5. Chickering, D. M. (2002). Learning equivalence classes of Bayesian-network structure. J. Mach. Learn. Res. 2, 445-498.
6. Cowell, R. G., Dawid, A. P., Lauritzen, S. L. & Spiegelhalter, D. J. (1999). Probabilistic networks and expert systems. Springer-Verlag, New York.
7. Cox, D. R. & Wermuth, N. (1996). Multivariate dependencies: models, analysis and interpretation. Chapman & Hall, London.
8. Edwards, D. (2000). Introduction to graphical modelling, 2nd edn. Springer, New York.
9. Frydenberg, M. (1990). The chain graph Markov property. Scand. J. Statist. 17, 333-353.
10. Heckerman, D., Geiger, D. & Chickering, D. M. (1995). Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning 20, 197-243.
11. Kiiveri, H., Speed, T. & Carlin, J. (1984). Recursive causal models. J. Aust. Math. Soc. Ser. A 36, 30-52.
12. Lauritzen, S. L. (1996). Graphical models. Oxford University Press, Oxford.
13. Lauritzen, S. L. & Richardson, T. S. (2002). Chain graphs models and their causal interpretation (with discussion). J. R. Statist. Soc. Ser. B Stat. Methodol. 64, 321-361.
14. Lauritzen, S. L. & Wermuth, N. (1989). Graphical models for association between variables, some of which are qualitative and some quantitative. Ann. Statist. 17, 31-57.
15. Madigan, D., Andersson, S. A., Perlman, M. D. & Volinsky, C. M. (1996). Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs. Comm. Statist. Theory Methods 25, 2493-2519.
16. Meek, C. (1995). Causal inference and causal explanation with background knowledge. In Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (eds P. Besnard & S. Hanks), 403-410. Morgan Kaufmann, San Francisco, CA.
17. Pearl, J. (1988). Probabilistic reasoning in intelligent systems. Morgan Kaufmann, San Mateo.
18. Pearl, J. (2000). Causality: models, reasoning and inference. Cambridge University Press, Cambridge.
19. Perlman, M. D. (2001). Graphical model search via essential graphs. Technical Report, Department of Statistics, Washington University, USA. Available at http://www.stat.washington.edu/www/research/reports/.
20. Richardson, T. (2001). Chain graphs which are maximal ancestral graphs are recursive causal graphs. Technical Report, Department of Statistics, Washington University, Washington, DC, USA. Available at http://www.stat. washington.edu/www/research/reports/.
21. Studený, M. (1996). On separation criterion and recovery algorithm for chain graphs. In Uncertainty in Artificial Intelligence: Proceedings of the Twelfth Conference (eds F. Jensen & E. Horvitz), 509-516. Morgan Kaufmann, San Francisco, CA.
22. Studený, M. (1997). On recovery algorithm for chain graphs. Internat. J. Approx. Reasoning 17, 265-293.
23. Studený, M. (2004). Characterization of essential graphs by means of an operation of legal component merging. Internat. J. Uncertain. Fuzziness Knowledge-Based Systems 12, 43-62.
24. Verma, T. & Pearl, J. (1991). Equivalence and synthesis of causal models. In Proceedings of the 6th Conference on Uncertainty in Artificial Intelligence (eds P. Bonissone, M. Henrion, L. N. Kanal & J. F. Lemmer), 220-227. North-Holland, Amsterdam.
25. Verma, T. & Pearl, J. (1992). An algorithm for deciding if a set of observed independencies has a causal explanation. In Uncertainty in Artificial Intelligence 8 (eds D. Dubois, M. P. Wellman, B. D'Ambrosio & P. Smets), 323-330. Morgan Kaufmann, SanFrancisco, CA.
26. Volf, M. & Studený, M. (1999). A graphical characterization of the largest chain graphs. Int. J. Approx. Reasoning 20, 209-236.
27. Whittaker, J. (1990). Graphical models in applied multivariate statistics. Wiley, Chichester.