Slides Set 6: Building Bayesian Networks Rina Dechter Darwiche - - PowerPoint PPT Presentation

slides set 6
SMART_READER_LITE
LIVE PREVIEW

Slides Set 6: Building Bayesian Networks Rina Dechter Darwiche - - PowerPoint PPT Presentation

Algorithms for Reasoning with graphical models Slides Set 6: Building Bayesian Networks Rina Dechter Darwiche chapters 5, slides6 828X 2019 Queries: Different queries may be relevant for different scenarios http://reasoning.cs.ucla.edu/samiam


slide-1
SLIDE 1

Algorithms for Reasoning with graphical models

Slides Set 6:

Rina Dechter

slides6 828X 2019

Darwiche chapters 5,

Building Bayesian Networks

slide-2
SLIDE 2
slide-3
SLIDE 3

Queries: Different queries may be relevant for different scenarios

slide-4
SLIDE 4

For other tools see class page http://reasoning.cs.ucla.edu/samiam

slide-5
SLIDE 5

Other type of evidence: We may want to know the probability that the patient has either a positive X-ray or dyspnoea, X =yes or D=yes.

slide-6
SLIDE 6
slide-7
SLIDE 7
slide-8
SLIDE 8

C= lung cancer

slide-9
SLIDE 9
slide-10
SLIDE 10

P(V=yes|E=yes) P(V=yes|E=no) =2 Define a CPT for V that satisfies this constraint

Soft evidence of Positive x-ray or Dyspnoea (X=yes or D = yes) with odds

  • f 2 to 1.

Modelling: Add E variable and Add V to model soft evidence.

slide-11
SLIDE 11

MPE is also called MAP

slide-12
SLIDE 12

MPE is also called MAP

slide-13
SLIDE 13
slide-14
SLIDE 14

MAP is also called Marginal Map (MMAP)

slide-15
SLIDE 15

Is it correct?

slide-16
SLIDE 16
slide-17
SLIDE 17
slide-18
SLIDE 18

What about the boundary strata?

slide-19
SLIDE 19

Constructing a Bayesian Network for any Distribution P

Intuition: The causes of X can serve as the parents

slide-20
SLIDE 20
slide-21
SLIDE 21

Variables? Arcs? Try it.

slide-22
SLIDE 22

What about?

A naive Bayes structure has the following edges C -> A1, . . . , C -> Am, where C is called the class variable and A1; : : : ;Am are called the attributes.

slide-23
SLIDE 23
slide-24
SLIDE 24
slide-25
SLIDE 25

Learn the model from data

slide-26
SLIDE 26

Learning the model

slide-27
SLIDE 27

Try it: Variables and values? Structure? CPTs?

slide-28
SLIDE 28
slide-29
SLIDE 29
slide-30
SLIDE 30

Read in the book. We will not cover this.

slide-31
SLIDE 31

Try it: Variables? Values? Structure?

slide-32
SLIDE 32
slide-33
SLIDE 33
slide-34
SLIDE 34
slide-35
SLIDE 35
slide-36
SLIDE 36
slide-37
SLIDE 37
slide-38
SLIDE 38
slide-39
SLIDE 39
slide-40
SLIDE 40
slide-41
SLIDE 41
slide-42
SLIDE 42
slide-43
SLIDE 43
slide-44
SLIDE 44
slide-45
SLIDE 45

Variables? Values? Structure?

slide-46
SLIDE 46
slide-47
SLIDE 47
slide-48
SLIDE 48
slide-49
SLIDE 49
slide-50
SLIDE 50
slide-51
SLIDE 51

Try it: Variables, values, structure?

slide-52
SLIDE 52
slide-53
SLIDE 53
slide-54
SLIDE 54
slide-55
SLIDE 55
slide-56
SLIDE 56
slide-57
SLIDE 57
slide-58
SLIDE 58
slide-59
SLIDE 59

What queries should we use here? P(Y not equal U) = 0.01

slide-60
SLIDE 60
slide-61
SLIDE 61

WER (word error rate), BER (bit error rate) MAP (MPE) minimizes WER, PM minimize BER… What do you think?

slide-62
SLIDE 62

Notice: Odds: o(x) = P(x)\P(bar(x)) K =Bayes factor = o’(x)\o(x) … the posterior odds after observing divided by prior odds For Gausian x: evidence on Y=y can be emulated with soft evidence on x with K =f(y|x) \f(y|bar(x)) = the expression above.

slide-63
SLIDE 63
slide-64
SLIDE 64
slide-65
SLIDE 65
slide-66
SLIDE 66
slide-67
SLIDE 67
slide-68
SLIDE 68
slide-69
SLIDE 69
slide-70
SLIDE 70
slide-71
SLIDE 71
slide-72
SLIDE 72
slide-73
SLIDE 73
slide-74
SLIDE 74
slide-75
SLIDE 75
slide-76
SLIDE 76
slide-77
SLIDE 77
slide-78
SLIDE 78
slide-79
SLIDE 79
slide-80
SLIDE 80
slide-81
SLIDE 81
slide-82
SLIDE 82
slide-83
SLIDE 83
slide-84
SLIDE 84
slide-85
SLIDE 85
slide-86
SLIDE 86
slide-87
SLIDE 87
slide-88
SLIDE 88
slide-89
SLIDE 89
slide-90
SLIDE 90

152

Two Loci Inheritance

Recombinant 2 1 A A B B a a b b A a B b 3 4 a a b b A a b b 5 6 A a B b

slide-91
SLIDE 91

153

Bayesian Network for Recombination

S23m L21f L21m L23m X21 S23f L22f L22m L23f X22 X23 S13m L11f L11m L13m X11 S13f L12f L12m L13f X12 X13 y3 y2 y1

{m,f} t s s P

t t

       − − = where 1 1 ) , | (

13 23

    

Locus 1 Locus 2

P(e|Θ) ?

Deterministic relationships Probabilistic relationships

slide-92
SLIDE 92

154

L11m L11f X11 L12m L12f X12 L13m L13f X13 L14m L14f X14 L15m L15f X15 L16m L16f X16 S13m S15m S16m S15m S15m S15m L21m L21f X21 L22m L22f X22 L23m L23f X23 L24m L24f X24 L25m L25f X25 L26m L26f X26 S23m S25m S26m S25m S25m S25m L31m L31f X31 L32m L32f X32 L33m L33f X33 L34m L34f X34 L35m L35f X35 L36m L36f X36 S33m S35m S36m S35m S35m S35m

Linkage analysis: 6 people, 3 markers

slide-93
SLIDE 93

Outline

  • Bayesian networks and queries
  • Building Bayesian Networks
  • Special representations of CPTs
  • Causal Independence (e.g., Noisy OR)
  • Context Specific Independence
  • Determinism
  • Mixed Networks