BayesianMachineLearningMachineLearningProbabilityTheoryStatistics
Given a Bayesian Network over , the edges of specify the dependencies between the ‘s explicitly. The edges also implicitly define indirect dependencies via Conditional Independence relations.
A subset of nodes D-separates from if for every (undirected) path from to there exists a node such that either:
- are not observed and is Head-Head
- is observed and is Tail-Tail or Tail-Head
Below shows the (length two) configurations that lead to various conditional independence relations:
- Tail-Tail - have a common cause
Active path:
Which shows that i.e. and are not (marginally) independent in general via the calculation