Graphical and algebraic representatives of conditional independence models

Studies in Fuzziness and Soft Computing

Volumn 213, Issue , 2007, Pages 55-80

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

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34250378666     PISSN: 14349922     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-68996-6_3     Document Type: Review

References (16)

1. Andersson SA, Madigan D, and Perlman MD. A characterization of Markov equivalence classes for acyclic digraphs. Annals of Statistics, 25:pP. 505-541 (1997).
2. Andersson SA, Madigan D, and Perlman MD. On the Markov equivalence of chain graphs, undirected graphs and acyclic digraphs. Scandinavian Journal of Statistics, 24:pP. 81-102 (1997).
3. Chickering DM. Optimal structure identification with greedy search. Journal of Machine Learning Research, 3:pP. 507-554 (2002).
4. Jensen FV. Bayesian Networks and Decision Graphs. Springer Verlag (2001).
5. Kočka T and Castelo R. Improved learning of Bayesian networks. In J Breese and D Koller, eds., Uncertainty in Artificial Intelligence 17, pp. 269-276. Morgan Kaufmann (2001).
6. Lauritzen SL. Graphical Models. Clarendon Press (1996).
7. Lauritzen SL and Wermuth N. Graphical models for associations between variables some of which are qulitative and some quantitative. Annals of Statistics, 17:pP. 31-57 (1989).
8. Pearl J. Probabilistic Reasoning in Intelligent Systems - Networks of Plausible Inference. Morgan Kaufmann (1988).
9. Puch RO, Smith JQ, and Bielza C. Hierarchical junction trees: conditional independence preservation and forecasting in dynamic Bayesian networks with heterogeneous evolution. In JA Gámez, S Moral, and A Salmerón, eds., Advances in Bayesian Networks, pp. 57-75. Springer-Verlag (2004).
10. R Development Core Team. R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria (2004). ISBN 3-900051-00-3.
11. 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:pP. 43-62 (2004).
12. Studený M. Characterization of inclusion neighbourhood in terms of the essential graph. International Journal of Approximate Reasoning 38: Pp. 283-309 (2005).
13. Studený M. On Probabilistic Conditional Independence Structures Springer-Verlag (2005).
14. Studený M, Roverato A, and Štěpánová Š. Two operations of merging components in a chain graph. Scandinavian Journal of Statistics (2005). Submitted.
15. Studený M and Vomlel J. A reconstruction algorithm for the essential graph. Tech. rep., ÚTIA AV ČR (2005). http://staff.utia.cz/vomlel/ sv.ps.
16. Verma T and Pearl J. Equivalence and synthesis of causal models. In PP Bonissone, M Henrion, LN Kanal, and JF Lemmer, eds., Uncertainty in Artificial Intelligence 6, pp. 220-227. Elsevier (1991).