A reconstruction algorithm for the essential graph

International Journal of Approximate Reasoning

Volumn 50, Issue 2, 2009, Pages 385-413

  Studený, Milan ^a   Vomlel, Jiří ^a  

^a INSTITUTE OF MATHEMATICS   (Czech Republic)

Author keywords

Bayesian network structure; Chain graph; Essential graph; Standard imset

Indexed keywords

DISTRIBUTED PARAMETER NETWORKS; INFERENCE ENGINES; INTELLIGENT NETWORKS; SPEECH ANALYSIS; STANDARDS;

ALGEBRAIC APPROACHES; BAYESIAN NETWORK STRUCTURE; CHAIN GRAPH; ESSENTIAL GRAPH; MATHEMATICAL DESCRIPTIONS; RECONSTRUCTION ALGORITHMS; STANDARD IMSET; STATISTICAL MODELS; TWO-STAGE ALGORITHMS;

BAYESIAN NETWORKS;

EID: 59749104414     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2008.09.001     Document Type: Article

References (25)

1. Andersson S.A., Madigan D., and Perlman M.D. A characterization of Markov equivalence classes for acyclic digraphs. Annals of Statistics 25 (1997) 505-541
2. Andersson S.A., Madigan D., and Perlman M.D. On the Markov equivalence of chain graphs, undirected graphs and acyclic digraphs. Scandinavian Journal of Statistics 24 (1997) 81-102
3. Auvrey V., and Wehenkel L. On the construction of the inclusion boundary neighbourhood for Markov equivalence classes of Bayesian network structures. In: Darwiche A., and Friedman N. (Eds). Uncertainty in Artificial Intelligence vol. 18 (2002), Morgan Kaufmann 26-35
4. R.R. Bouckaert, Bayesian belief networks: from construction to inference, PhD thesis, University of Utrecht, 1995.
5. Bouckaert R.R., and Studený M. Racing algorithms for conditional independence inference. International Journal of Approximate Reasoning 45 (2007) 386-401
6. R. Castelo, The discrete acyclic digraph Markov model in data mining, PhD thesis, University of Utrecht, 2002.
7. Chickering D.M. Optimal structure identification with greedy search. Journal of Machine Learning Research 3 (2002) 507-554
8. Cowell R.G., Dawid A.P., Lauritzen S.L., and Spiegelhalter D.J. Probabilistic Networks and Expert Systems (1999), Springer-Verlag
9. Frydenberg M. The chain graph Markov property. Scandinavian Journal of Statistics 17 (1990) 333-353
10. Kočka T., and Castelo R. Improved learning of Bayesian networks. In: Breese J., and Koller D. (Eds). Uncertainty in Artificial Intelligence vol. 17 (2001), Morgan Kaufmann 269-276
11. Lauritzen S.L. Graphical Models (1996), Clarendon Press
12. Meek C. Causal inference and causal explanation with background knowledge. In: Besnard P., and Hanks S. (Eds). Uncertainty in Artificial Intelligence vol. 11 (1995), Morgan Kaufmann 403-410
13. C. Meek, Graphical models, selecting causal and statistical models, PhD thesis, Carnegie Melon University, 1977.
14. Puch R.O., Smith J.Q., Bielza C., and trees H.j. conditional independence preservation and forecasting in dynamic Bayesian networks with heterogeneous evolution. In: Gámez J.A., Moral S., and Salmerón A. (Eds). Advances in Bayesian Networks (2004), Springer-Verlag 57-75
15. Roverato A. A unified approach to the characterization of equivalence classes for DAGs, chain graphs with no flags and chain graphs. Scandinavian Journal of Statistics 32 (2005) 295-312
16. Silander T., and Myllymäki P. A simple approach for finding the globally optimal Bayesian network structure. In: Dechter R., and Richardson T. (Eds). Uncertainty in Artificial Intelligence vol. 22 (2006), AUAI Press 445-452
17. Studený M. A recovery algorithm for chain graphs. International Journal of Approximate Reasoning 17 (1997) 265-293
18. Studený M. Characterization of essential graphs by means of the operation of legal merging of components. International Journal of Uncertainty, Fuzziness and Knowledge-based Systems 12 (2004) 43-62
19. Studený M. Probabilistic Conditional Independence Structures (2005), Springer-Verlag
20. Studený M. Characterization of inclusion neighbourhood in terms of the essential graph. International Journal of Approximate Reasoning 38 (2005) 283-309
21. M. Studený, J. Vomlel, A geometric approach to learning BN structures, in: M. Jaeger, T.D. Nielsen (Eds.), Proceedings of the Fourth European Workshop on Probabilistic Graphical Models, Hirtshals, Denmark, September 2008, pp. 281-288.
22. M. Studený, A. Roverato, Š. Štěpánová, Two operations of merging and splitting components in a chain graph, Kybernetika 45 (2009), in press.
23. Vomlel J., and Studený M. Graphical and algebraic representatives of conditional independence models. In: Lucas P., Gámez J.A., and Salmerón A. (Eds). Advances in Bayesian Networks (2007), Springer, Verlag 55-80
24. J. Vomlel, M. Studený, Using imsets for learning Bayesian networks, in: Proceedings of the 10th Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty, Liblice, Czech Republic, September 2007, pp. 178-189.
25. Verma T., and Pearl J. Equivalence and synthesis of causal models. In: Bonissone P.P., Henrion M., Kanal L.N., and Lemmer J.F. (Eds). Uncertainty in Artificial Intelligence vol. 6 (1991), Elsevier 220-227