D-Separation describes conditional independence in Directed Graphical Models. We can use this in order to determine relationships between random variables if only a subset of the model is observable. Here are the notes: [ Ссылка ]

The crucial point in conditional independence is the location of observable nodes in the Directed Graphical Model. Based on triplets, we can define three simple rules that allow us to check for conditional independence in arbitrarily structured graphs.

-------

📝 : Check out the GitHub Repository of the channel, where I upload all the handwritten notes and source-code files (contributions are very welcome): [ Ссылка ]

📢 : Follow me on LinkedIn or Twitter for updates on the channel and other cool Machine Learning & Simulation stuff: [ Ссылка ] and [ Ссылка ]

💸 : If you want to support my work on the channel, you can become a Patreon here: [ Ссылка ]

-------

Timestamps:
00:00 Opening
00:23 Introduction
03:42 1st Example
07:21 2nd Example
09:27 3rd Example
11:48 Three basic rules
14:45 Algorithm with Example
17:31 Summary

свернуть