CS 331: Artificial Intelligence Bayesian Networks (Inference) Inference

Transcription

1 S 331: rtificil Intllignc ysin Ntworks Infrnc 1 Infrnc Suppos you r givn ysin ntwork with th grph structur n th prmtrs ll figur out Now you woul lik to us it to o infrnc You n infrnc to mk prictions or clssifictions with ys nt 2 1

2 Infrnc xmpl Suppos you r using movi rcommntion srvic which looks t th following ttriuts of movi: Gnr: ction omy or Romnc Rting: G G-13 or R HsRootsTkingOvrWorl: or fls Th clss ll is Rcommntion which vlus or fls. N to prict: Rcommntion = Gnr = ction Rting = R HsRootsTkingOvrWorl = 3 nothr xmpl You r vry sick n you visit your octor. Th octor is l to gt th following informtion from you: HsFvr = Hsough = Hsrthingrolms = tconrcntly = Wht s th proility you hv SwinFlu givn th ov? 4 2

3 nothr xmpl N to comput SwinFlu = HsFvr = Hsough = Hsrthingrolms = tconrcntly = Suppos you pss out for you sy wor to th octor. Th octor is only l to trmin you hv fvr. Wht is SwinFlu = HsFvr =? 5 Quris Rcommntion= Gnr=ction Rting = R HsRootsTkingOvrWorl= SwinFlu = HsFvr = Hsough = Hsrthingrolms = tconrcntly = SwinFlu = HsFvr = Ths r ll cll quris 6 3

4 Qury xmpl SwinFlu = HsFvr = Qury Vril vinc Vril Unosrv vrils: Hsough Hsrthingrolms tconrcntly 7 Quris Formliz W will us th following nottion: X = qury vril = { 1 m } is th st of vinc vrils = osrv vnt Y = {Y 1 Y l r th non-vinc or hin vrils Th complt st of vrils X = {X} Y N to clcult th qury X 8 4

5 Infrnc y numrtion Rcll tht: X X X y n x1... xn xi prnts X i i1 This mns you cn nswr quris y computing sums of proucts of conitionl proilitis from th ntwork y 9 xmpl #1 Qury: = = How o you solv this? 2 stps: 1. xprss it in trms of th joint proility istriution 2. xprss th joint proility istriution in trms of th ntris in th Ts of th ys nt 10 5

6 xmpl #1 Whnvr you s conitionl lik = = us th hin Rul: = / 11 xmpl #1 Whnvr you n to gt sust of th vrils.g. from th full joint istriution us mrginliztion: X X Y y y 12 6

7 7 13 xmpl #1 To xprss th joint proility istriution s th ntris in th Ts us: N i i i N X rnts X X X xmpl #1 Tk th proilitis tht on t pn on th trms in th summtion n mov thm outsi th summtion

8 8 xmpl #1 Tk th proilitis tht on t pn on th trms in th summtion n mov thm outsi th summtion Sums to 1 Sums to 1 xmpl #1 Tk th proilitis tht on t pn on th trms in th summtion n mov thm outsi th summtion Sums to 1 osn t pn on. n mov to th lft

9 9 17 xmpl #2 18 omplxity of xct Infrnc Th urglry/rthquk ysin ntwork is n xmpl of polytr Singly connct ntworks k polytrs hv t most on unirct pth twn ny two nos in th ntwork urglry rthquk lrm ohnlls rylls

10 omplxity of xct Infrnc olytrs hv nic proprty: Th tim n spc complxity of xct infrnc in polytrs is linr in th numr of vrils Wht out multiply connct ntworks? louy Sprinklr Rin Wt Grss omplxity of xct Infrnc Wht out for multiply connct ntworks? xponntil tim n spc complxity in th numr of vrils in th worst cs nws: Infrnc in ysin ntworks is N-hr vn wors nws: infrnc is #-hr strictly hrr thn N-complt prolms 20 10

11 Th Goo Nws lthough xct infrnc is N-hr pproximt infrnc is trctl Lots of promising mthos lik smpling vritionl mthos tc. pproximt infrnc is currnt rsrch topic in chin Lrning 21 Wht You Shoul Know How to o xct infrnc in proilistic quris of ys nts Th complxity of infrnc for polytrs n multiply connct ntworks 22 11

12 In-lss xrcis Writ out th qutions for th following proilitis using proilitis you cn otin from th ysin ntwork. You will hv to lv it in symolic form cus th Ts r not shown. 1. = = = = = 23 In-lss xrcis 2. = = 24 12

13 In-lss xrcis 2. = = = = = 25 In-lss xrcis fls fls fls fls fls 0.1 fls fls 0.9 fls fls 0.2 fls 0.8 fls fls 0.3 fls 0.7 fls n you com up with nothr ys nt structur using only th 3 nos ov tht rprsnts th sm joint proility istriution? 26 13

14 In-lss xrcis fls fls fls fls fls 0.1 fls fls 0.9 fls fls 0.2 fls 0.8 fls fls 0.3 fls 0.7 fls Wht is =fls=fls? n you think of quick wy to clcult this? 27 14