A graphical characterization of the largest chain graphs

International Journal of Approximate Reasoning

Volumn 20, Issue 3, 1999, Pages 209-236

  Volf, Martin ^a,d   Studený, Milan ^b,c  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

^c UNIVERSITY OF ECONOMICS   (Czech Republic)

^d NONE   (Czech Republic)

Author keywords

Chain graphs; Complex arrows; Conditional independence; Graphical models; Independency models; Markov equivalence; Protected arrows; The largest chain graph

Indexed keywords

EID: 0010402046     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0888-613X(99)00003-1     Document Type: Article

References (21)

1. S.A. Andersson, D. Madigan, M.D. Perlman, On the Markov equivalence of chain graphs, undirected graphs and acyclic digraphs, Scand. J. Statist. 24 (1997) 81-102.
2. S.A. Andersson, D. Madigan, M.D. Perlman, Alternative Markov properties for chain graphs, Scand. J. Statist., submitted.
3. R.R. Bouckaert, M. Studený, Chain graphs: semantics and expressiveness, in: Ch. Froidevaux, J. Kohlas (Eds.), Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Lecture Notes in AI 946, Springer, Berlin, 1995, pp. 67-76.
4. W.L. Buntine, Chain graphs for learning, in: P. Besnard, S. Hanks (Eds.), Uncertainty in Artificial Intelligence 11, Morgan Kaufmann, San Francisco, CA, 1995, 46-54.
5. D.R. Cox, N. Wermuth, Linear dependencies represented by chain graphs (with discussion), Statist. Science 8 (1993) 204-283.
6. D.R. Cox, N. Wermuth, Multivariate Dependencies - Models Analysis and Interpretation, Chapman and Hall, London, 1996.
7. A.P. Dawid, Conditional independence in statistical theory, J. Roy. Stat. Soc. B 41 (1979) 1-31.
8. M. Frydenberg, The chain graph Markov property, Scand. J. Statist. 17 (1990) 333-353.
9. S. Højsgaard, B. Thiesson, BIFROST - Block recursive models induced from relevant knowledge, observations, and statistical techniques, Comput. Statist. Data Anal. 19 (1995) 155-175.
10. S.L. Lauritzen, N. Wermuth, Mixed interaction models, res.rep.R-84-8, Inst. Elec. Sys., University of Aalborg, Denmark, 1984.
11. S.L. Lauritzen, N. Wermuth, Graphical models for associations between variables, some of which are qualitative and some quantitative, Ann. Statist. 17 (1989) 31-57.
12. S.L. Lauritzen, Mixed graphical association models, Scand. J. Statist. 16 (1989) 273-306.
13. S.L. Lauritzen, Graphical Models, Clanderon Press, Oxford, 1996.
14. J. Pearl, Probabilistic Reasoning in Intelligent Systems - Networks of Plausible Inference, Morgan Kaufmann, San Francisco, CA, 1988.
15. T.S. Richardson, Chain graphs and symmetric associations, in: M.I. Jordan (Ed.), Learning in Graphical Models, Kluwer Academic Publishers, Dordrecht, 1998, pp. 231-260.
16. M. Studený, On separation criterion and recovery algorithm for chain graphs, in: E. Horvitz, F. Jensen (Eds.), Uncertainty in Artificial Intelligence 12, Morgan Kaufmann, San Francisco, CA, 1996, pp. 509-516.
17. M. Studený, On recovery algorithm for chain graphs, Int. J. Approx. Reasoning 17 (1997) 265-293.
18. M. Studený, R.R. Bouckaert, On chain graph models for description of conditional independence structures, Ann. Statist. 26 (1998) 1434-1495.
19. M. Volf, Conditional independence models induced by chain graphs (in Czech), Student work, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University, Prague, November 1996.
20. N. Wermuth, S.L. Lauritzen, On substantive research hypotheses, conditional independence graphs and graphical chain models, J. Roy. Stat. Soc. B 52 (1990) 21-50.
21. J. Whittaker, Graphical Models in Applied Multivariate Statistics, Wiley, New York, 1990.