Bayesian Network Fundamentals
A Bayesian network is:
- A directed acyclic graph (DAG)
G
whose nodes represent the random variables
X1,X2,...,Xn - For each node Xi a CPD P(Xi|ParG(Xi))
- A directed acyclic graph (DAG)
G
whose nodes represent the random variables
The BN represents a joint distribution via the chain rule for Bayesian Networks
P(X1,X2,...,Xn)=∏iP(Xi|ParG(Xi))BN is a legal distribution:
P(X1,X2,...,Xn)≥0
∑iP(X1,X2,...,Xn)=1P factorized over
G - Let
G
be a graph over
X1,X2,...,Xn -
P
factorized over
G if
P(X1,X2,...,Xn)=∏iP(Xi|ParG(Xi))
- Let
G
be a graph over
Reasoning patterns:
- Causal reasoning
- Evidential reasoning
- Intercausal reasoning
Active Trail
- A trail X1−X2−...−Xk is active if it has no v-structures Xi−1→Xi←Xi+1
- A trail
X1−X2−...−Xk
is active given
Z
if:
- for any v-structure
Xi−1→Xi←Xi+1 , we have that Xi or one of its descendants ∈Z - no other Xi is in Z <script type="math/tex" id="MathJax-Element-23">Z</script>
- for any v-structure