Probabilistic Inference
-Probability theory
-Bayes network
-Independence
-Inference
Evidence -> Hidden -> Query
P(Q1,Q2…|E1=e1, E2=e2)
Enumeration
P(+b|+j,+m)=P(+b,+j,+m)/P(+j,+m)
P(+b,+j,+m)=ΣeΣaP(+b,+j,+m,e,a)
Pulling out terms
P(+b)ΣeΣaP(e)P(a|+b,e)P(+j|a)P(+m,a)
Maximize independence
O(n), O(2n)
Variable Elimination
R->T->L
P(+l)=ΣrΣt P(r)R(t|r)P(+l|t)
