Relating Directed and Undirected Graphs | PRML 8.3.4

In this video, we examine the relationship between directed and undirected graph representations of probability distributions. We show how to convert directed graphs to undirected graphs by "marrying the parents," which can come at the cost of losing some of the conditional independence properties of the graph. We also give examples of directed graphs whose conditional independencies can't be expressed by any undirected graph, and vise versa. Reference: Bishop, C. M. (2006). Pattern Recognition and Machine Learning. Section 8.3.4 Relation to directed graphs. This video is part of my series reading through Christopher Bishop's PRML. Check out my channel for other chapters in this series.