Abstract
The topic of this chapter is conditional independence models. We review mathematical objects that are used to generate conditional independence models in the area of probabilistic reasoning. More specifically, we mention undirected graphs, acyclic directed graphs, chain graphs, and an alternative algebraic approach that uses certain integer-valued vectors, named imsets. We compare the expressive power of these objects and discuss the problem of their uniqueness.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersson, Madigan, and Perlman]andersson-1997a Andersson SA, Madigan D, and Perlman MD. A characterization of Markov equivalence classes for acyclic digraphs. Annals of Statistics, 25:pp. 505–541 (1997).
Andersson, Madigan, and Perlman]andersson-1997b 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).
Chickering DM. Optimal structure identification with greedy search. Journal of Machine Learning Research, 3:pp. 507–554 (2002).
Jensen FV. Bayesian Networks and Decision Graphs. Springer Verlag (2001).
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).
Lauritzen SL. Graphical Models. Clarendon Press (1996).
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).
Pearl J. Probabilistic Reasoning in Intelligent Systems - Networks of Plausible Inference. Morgan Kaufmann (1988).
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).
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.
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).
Studený M. Characterization of inclusion neighbourhood in terms of the essential graph. International Journal of Approximate Reasoning, 38: pp. 283–309 (2005).
Studený M. On Probabilistic Conditional Independence Structures. Springer-Verlag (2005).
sturovste Studený M, Roverato A, and Štěpánová Š. Two operations of merging components in a chain graph. Scandinavian Journal of Statistics (2005). Submitted.
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.
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).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vomlel, J., Studený, M. (2007). Graphical and Algebraic Representatives of Conditional Independence Models. In: Lucas, P., Gámez, J.A., Salmerón, A. (eds) Advances in Probabilistic Graphical Models. Studies in Fuzziness and Soft Computing, vol 213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68996-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-68996-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68994-2
Online ISBN: 978-3-540-68996-6
eBook Packages: EngineeringEngineering (R0)