Abstract
In Chapter 6 we introduced graphically specified models using undirected or directed graphs to describe the dependency structures of probabilistic models. We have seen that not every probabilistic model can be specified by a perfect map. Thus, in general, graphs can only be thought of as minimal independence maps (I-maps), from which every conditional independence statement (CIS) derived from the graph holds in the associated probability model, though some CISs in the probability model may not be represented by the graph. Consequently, the main limitation of graphical models is that they can only represent certain types of independence structures. The following example illustrates this limitation.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag New York, Inc
About this chapter
Cite this chapter
Castillo, E., Gutiérrez, J.M., Hadi, A.S. (1997). Extending Graphically Specified Models. In: Expert Systems and Probabilistic Network Models. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2270-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2270-5_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94858-4
Online ISBN: 978-1-4612-2270-5
eBook Packages: Springer Book Archive