Markov equivalence in Bayesian networks

Ildikó Flesch*, Peter J.F. Lucas

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

10 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAdvances in Probabilistic Graphical Models
EditorsPeter Lucas, Jose Gamez, Antionio Salmero
Pages3-38
Number of pages36
DOIs
Publication statusPublished - 2007
Externally publishedYes

Publication series

NameStudies in Fuzziness and Soft Computing
Volume213
ISSN (Print)1434-9922

Keywords

  • n/a OA procedure

Fingerprint

Dive into the research topics of 'Markov equivalence in Bayesian networks'. Together they form a unique fingerprint.

Cite this