Probabilistic graphical models, such as Bayesian networks, allow representing conditional independence information of random variables. These relations are graphically represented by the presence and absence of arcs and edges between vertices. Probabilistic graphical models are nonunique representations of the independence information of a joint probability distribution. However, the concept of Markov equivalence of probabilistic graphical models is able to offer unique representations, called essential graphs. In this survey paper the theory underlying these concepts is reviewed. © 2007 Springer.
CITATION STYLE
Flesch, I., & Lucas, P. J. F. (2007). Markov equivalence in Bayesian networks. Studies in Fuzziness and Soft Computing, 213, 3–38. https://doi.org/10.1007/978-3-540-68996-6_1
Mendeley helps you to discover research relevant for your work.