Characterization of essential graphs by means of the operation of legal merging of components

International Journal of Uncertainty, Fuzziness and Knowldege-Based Systems

Volumn 12, Issue SUPPL. 1, 2004, Pages 43-62

  Studený, Milan ^a  

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

Author keywords

Acyclic directed graph; Chain graph; Essential graph; Flag; Legal merging

Indexed keywords

ALGORITHMS; FUZZY CONTROL; OPTIMIZATION; SET THEORY;

ACYCLIC DIRECTED GRAPH; BAYESIAN NETWORKS; CHAIN GRAPH; ESSENTIAL GRAPH; FLAG; LEGAL MERGING;

GRAPH THEORY;

EID: 8444231699     PISSN: 02184885     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218488504002576     Document Type: Article

References (18)

1. S. A. Andersson, D. Madigan and M. D. Perlman, "A characterization of Markov equivalence classes for acyclic digraphs", Annals of Statistics 25 (1997) 505-541.
2. S. A. Andersson, D. Madigan and M. D. Perlman, "On the Markov equivalence of chain graphs, undirected graphs and acyclic digraphs", Scandinavian Journal of Statistics 24 (1997) 81-102.
3. S. A. Andersson, D. Madigan and M. D. Perlman, "Alternative Markov properties for chain graphs", Scandinavian Journal of Statistics 28 (2001) 33-85.
4. V. Auvray and L. Wehenkel, "On the construction of the inclusion boundary neighbourhood for Markov equivalence clases of Bayesian network structures", in Uncertainty in Artificial Intelligence 18, eds. A. Darwiche and N. Friedman (Morgan Kaufmann, San Francisco, 2002) pp. 26-35.
5. D. M. Chickering, "A tranformational characterization of equivalent Bayesian network structures", in Uncertainty in Artificial Intelligence 11, eds. P. Besnard and S. Hanks (Morgan Kaufmann, San Francisco, 1995) pp. 87-98.
6. D. M. Chickering, "Optimal structure identification with greedy search", Journal of Machine Learning Research 3 (2002) 507-554.
7. M. Frydenberg, "The chain graph Markov property", Scandinavian Journal of Statistics 17 (1990) 333-353.
8. T. Kočka and R. Castelo, "Improved learning of Bayesian networks", in Uncertainty in Artificial Intelligence 17, eds. J. Breese and D. Koller (Morgan Kaufmann, San Francisco, 2001) pp. 269-276.
9. S. L. Lauritzen, Graphical Models (Clarendon Press, 1996).
10. C. Meek, "Causal inference and causal explanation with background knowledge", in Uncertainty in Artificial Intelligence 11, eds. P. Besnard and S. Hanks (Morgan Kaufmann, San Francisco, 1995) pp. 403-410.
11. J. Pearl, Probabilistic Reasoning in Intelligent Systems (Morgan Kaufmann, San Mateo, 1988).
12. A. Roverato, "A unified approach to the characterisation of equivalence classes of DAGs, chain graphs with no flags and chain graphs", a technical report 03-1, Dipartimento di Scienze Sociali Cognitive e Quantitative, University of Modena and Reggio Emilia (2003), to be submitted to Scandinavian Journal of Statistics.
13. M. Studený, "A recovery algorithm for chain graphs", International Journal of Approximate Reasoning 17 (1997) 265-293.
14. M. Studený, On probabilistic conditional independence structures, a research monograph, to be published by (Springer 2004).
15. M. Studený, "Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours", in Symbolic and Quantitative Approaches to Reasoning with Uncertainty, eds. T. D. Nielsen, N. L. Zhang, Lecture Notes in AI 2711 (Springer 2003) 161-172.
16. M. Studený, "Characterization of inclusion neighbourhood in terms of the essential graph: lower neighbours", to appear in Proceeding of WUPES 2003.
17. T. Verma and J. Pearl "Equivalence and synthesis of causal models", in Uncertainty in Artificial Intelligence 6, eds. P. P. Bonissone, M. Henrion, L. N. Kanal and J. F. Lemmer (Elsevier, New York, 1991) pp. 220-227.
18. M. Volf and M. Studený, "A graphical characterization of the largest chain graphs", International Journal of Approximate Reasoning 20 (1999) 209-236.