Bayes Nets 10-701 recitation 04-02-2013 Bayes Nets Represent - - PowerPoint PPT Presentation

bayes nets
SMART_READER_LITE
LIVE PREVIEW

Bayes Nets 10-701 recitation 04-02-2013 Bayes Nets Represent - - PowerPoint PPT Presentation

Bayes Nets 10-701 recitation 04-02-2013 Bayes Nets Represent dependencies between variables Compact representation of probability distribution Allergy Flu Encodes causal relationships Sinus Nose Headache Conditional


slide-1
SLIDE 1

Bayes Nets

10-701 recitation 04-02-2013

slide-2
SLIDE 2

Bayes Nets

  • Represent dependencies between variables
  • Compact representation of probability

distribution

Flu Allergy Sinus

Headache

Nose

  • Encodes causal

relationships

slide-3
SLIDE 3

Conditional independence

  • P(X,Y|Z) = P(X|Z) x P(Y|Z)

Flu Sinus

Nose

Nose Sinus

Headache

F not⊥N F⊥N | S N not⊥H N⊥H | S

slide-4
SLIDE 4

Conditional independence

Flu Sinus

Allergy

F⊥A F not⊥A | S

  • Explaining away:

– P(F = t | S = t) is high – But P(F = t | S = t , A = t) is lower

slide-5
SLIDE 5

Joint probability distribution

  • Chain rule of probability:

P(X1, X2, …, Xn) = P( X1) P( X2|X1) … P(Xn|X1,X2…Xn-

1)

slide-6
SLIDE 6

Joint probability distribution

Flu Allergy Sinus

Headache

Nose

  • Chain rule of probability:

P(F,A,S,H,N) = P(F) P(A|F) P(S|A,F) P(H|F,A,S) P(N|F,A,S,H)

Table with 25 entries!

slide-7
SLIDE 7

Joint probability distribution

Flu Allergy Sinus

Headache

Nose

P(F) P(A) P(S|F,A) P(H|S) P(N|S)

  • Local markov assumption:

A variable X is independent

  • f it’s non-descendants

given it’s parents P(F,A,S,H,N) = P(F) P(A) P(S|A,F) P(H|S) P(N|S)

F = t, A = t F = t, A = f F = f, A = t F = f, A = f S = t 0.9 0.8 0.7 0.1 S = f 0.1 0.2 0.3 0.9

slide-8
SLIDE 8

Queries, Inference

Flu Allergy Sinus

Headache

Nose=t

P(F) P(A) P(S|F,A) P(H|S) P(N|S)

  • P(F = t | N = t) ?
  • P(F=t|N=t) = P(F=t,N=t)/P(N=t)

P(F,N=t) = ΣA,S,H P(F,A,S,H,N=t) = ΣA,S,H P(F) P(A) P(S|A,F) P(H|S) P(N=t|S)

slide-9
SLIDE 9

Moralizing the graph

Flu Allergy Sinus Nose=t

  • Eliminating A will create a

factor with F and S

  • To assess complexity we can

moralize the graph: connect parents

Headache

slide-10
SLIDE 10

Chose an optimal order

Flu Allergy Sinus Nose=t

If we start with H: P(F,N=t) = ΣA,S P(F) P(A) P(S|A,F) P(N=t |S) ΣH P(H|S) = ΣA,S P(F) P(A) P(S|A,F) P(N=t |S)

=1

slide-11
SLIDE 11

Flu Allergy Sinus Nose=t

Removing S P(F,N=t)= ΣA,S P(F) P(A) P(S|A,F) P(N=t |S) = ΣA P(F) P(A) Σs P(S|A,F) P(N=t |S) = ΣA P(F) P(A) g1(F,A)

slide-12
SLIDE 12

Flu Allergy Nose=t

Removing A P(F,N=t)= P(F) ΣA P(A) g1(F,A) = P(F) g2(F) P(F=t|N=t) = P(F=t,N=t)/P(N=t) P(N=t) = ΣF P(F,N=t)

=P(N=t|F)

slide-13
SLIDE 13

Independencies and active trails

Is A⊥H? When is it not? A is not⊥H when given C and F or F’ or F’’ and not {B,D,E,G}

slide-14
SLIDE 14

Independencies and active trails

  • Active trail between variables X1,X2…Xn-1

when:

– Xi-1 -> Xi -> Xi+1 and Xi not observed – Xi-1 <- Xi <- Xi+1 and Xi not observed – Xi-1 <- Xi -> Xi+1 and Xi not observed – Xi-1 -> Xi <- Xi+1 and Xi or one of its descendants is

  • bserved
slide-15
SLIDE 15

Independencies and active trails

A⊥B ?

slide-16
SLIDE 16

Independencies and active trails

B⊥G |E ?

slide-17
SLIDE 17

Independencies and active trails

I⊥J |K ?

slide-18
SLIDE 18

Independencies and active trails

E⊥F |K ?

slide-19
SLIDE 19

Independencies and active trails

F⊥K |I ?

slide-20
SLIDE 20

Independencies and active trails

E⊥F |I,K ?

slide-21
SLIDE 21

Independencies and active trails

F⊥G |H ?

slide-22
SLIDE 22

Independencies and active trails

F⊥G |H ,A ?