.

001

Pe)
.002 P-e)
Ptabe)
R-abe) Plab,-e) P-a-e)
06
0S
P)
90 Pja))
0
P-a)
05

P(ma)
70
P(ma) P(ma)
01 70 .01

Fig. 7.3.7 The structure of the expression shown in equation 7.3.3

 Vavuable Elimunaton

The anumalion alqpithm be umpova

Subslantialluy by aliminating calulaliony
| repeated Sub eoprmion
Calulaon can bo done Once nd sawe the

|te fon daten we Ths the tom 6

dyname proguamming
wonking
*It woes by ewalalang apreuens
ught toAot onden
y Zntotmediat e h ane Shoed and
Summaluons Dven each vaniable cvo dono
for thae ponlons o an dapreion that
dapenda On tho Vaable.
Exa mple .
Fath Aualce
(AAom

(John (Many

-B
Xcqueny vauabe)
Ythidden ven) e, a
e Ceviden co Van)’J,m
Falye
PBl,m) =d<P BJj,me,a)
e a
Fon B=T9ue, Ple)
pjla)
P Plmla)pa/be)
pCb/j,m) =&& lb) e

rd plb) pre)
a

&
2 plalbye) pCjlay LO
plbjj,m) PCm/a)
f3(A,B,E)
btsA)
fhcE)
f,(8)
LFaluec1a)
(einiatCA)
£CA,B,E)= tg(A1B,E) + f4(A)4 fs (A) -
6

E)=t3 (a, B, E) +f4ca) + f5la))

fAC8. (7a) +fs(7a))
X t3C B,E)
1a, + t4
L
put aq ) )
t CB,E) )
pCB/j,m) = d t (B) ta (E)
eliminat E)
fz ( B)= ta(E) f C8,E)
(e) f C8, }) + fale) t; (e B,1e)
f CB) = fa
Subst tut 6)
pBlj.m) =d ficB)fz CB)
A B G(A. B) B C (;(B,C) A B C
T T 3 T T .2 T T T
F .7 T F .8 T T F
F T .6 T T
F F 4 T
F T T
F T F
F T
F F F

Figure 14.10 Ilustrating pointwise multiplication: (A, B) x (,(B.C) =

 A B G(A, B) B (B,C) A B C s(A, B.C)
.3 T T .2 T T 3 x.2 =.06
.7 T F .8 T F 3 x .8=.24
F T 9 F T .6 F T .7x.6=.42
F F .1 F F .4 F F .7x.4=.28
.9 x.2=.18
F T F .9 x .8= .72
F T .lx.6=,06
F F F .l x.4=.04
Figure l4.10 Illustrating pointwise multiplication: 1(4, B)x 2(B.C) = s(A, B. C).

f(B.C) = s(A, B.C) = fs(a. B,C) + s(-a, B.C)

 cau
vaable
mmes optimigod
ondung
yueloda be
a
calulalion
the beo
to vauable u
dtoent
factoy whuch
ondasung factbn
neat
wicheugh
wcheen Slect
buttoymadae
genenated
dng&
o
Vauable
OHdong
choi'algonithm
a to
the
Sige
the hawe
ao Eliminate
Evey constucted
diygorant ue Ondexui
Y Valid
4
4. Clustering
Ckaly
Algorithm
Sporinkier Chady
AS"R)

Grass SrRain )
10 40 10 40

Gruss

(a) (b)

Fgure 14.12 (a) Amukiply connccted network with conditional protbability tables (b) A
clustered equivalent of the multiply connected network.

Once the network is in polytree form, aspecial-purpose inference algorithm is required.

meganodes that share variables with
because ordinary inference methods cannot handle
each other
Complexity of Exact Inference
The burglary network of Figure 14.2 belongs to the family of networks in which
there is at most one undirected path between any two nodes in the network.
These are called singly connected networks or polytrees.
The time and space complexity of exact inference in polytrees is linear in
the size of the network. ( size refers to number of entries in CPT)
For multiply connected networksvariable elimination can have exponential
time and space complexity in the worst case, even when the number of
parents per node is bounded.