Phn L Thuyt

Cu 1: Trnh by cc bc c bn ca mt h thng nhn dng i tng. M hnh ha bi ton nhn dng. Cu 2: Gi s rng cho N lp w1,, wN v mt vc t c tnh x. Hy vit lut Bayes cho s phn lp vc t c tnh x thuc v lp wi. Cu 3: nh ngha hm phn bit v cc dng ca hm phn bit. Trnh by lut ra quyt nh Bayes c chc chn nht. Cu 4: Boosting l g? Boosting thuc v phng php nhn dng no? Em c th lit k mt vi thut ton Boosting m em c bit? Cu 5: Theo em c th xy dng h thng nhn dng bin s xe lu hnh trn ng ph hay khng? H thng gm nhng giai on no? Nu nhng kh khn khi xy dng h thng ny? Cu 6: Nu s khc bit chnh gia hai phng php phn lp da vo c tnh tng t chc chn nht v s dng ng ranh gii quyt nh. Cu 7: nh ngha m hnh markov n 2 chiu v hay cho bit m hnh markov n ph hp vi lp bi ton nhn dng no? Nu u im v nhc im ca m hnh ny. Cu 8: ngha ca phng php SVM? Da vo g xc nh bin ca cc lp? Hm phn lp tuyn tnh ca SVM c nhng dng no? Em hy cho bit cc dng . Cu 9: Phn bit gia hai khi nim phn lp v phn cm d liu? Khi no th khng phn cm d liu c v khi no th khng phn lp tuyn tnh d liu c? Hy cho bit cc gii php? Cu 10: ngha ca gim s chiu trong biu din d liu? Hy c bit c nhng phng php no thng s dng gim s chiu. Trnh by cc bc c bn thut ton v ngha ca mi bc trong thut ton. Cu 10: ngha ca php bin i PCA. Hn ch ca PCA l g? Cu 11: Th no l l (margin)? cc i ha l ca cc lp d liu ta chn phng php hun luyn d liu no? V sao? Cu 12: tin hnh thc nghim v hun luyn d liu ta cn phi tin hnh nhng bc no? V s dng phng php no lng ha qu trnh hc hay hun luyn mu. Cu 13: Hy cho bit c nhng phng php hc no? Nu r u im v nhc im ca mi phng php hc. Cu 14: So snh s ging v khc nhau gia m hnh Boosting v m hnh rng ngu nhin. Nu u im v nhc im ca hai m hnh ny. i vi lp bi ton nhn dng no th s dng hai m hnh trn l ph hp.

Cu 15: V sao gi l rng ngu nhin? Tnh ngu nhin th hin u trong rng?

Phn Bi Tp
Bi 1. Cho mt khng gian biu din i tng ngu nhin:
0 1 1 1 0 0 1 0 X 1 = 0 ; X 2 = 0 ; X 3 = 0 ; X 4 = 1 X 5 = 0 ; X 6 = 1 ; X 7 = 1 ; X 8 = 1 0 1 0 0 1 0 1 1

a) Tnh ma trn tng quan R v ma trn hip bin A ca tp i tng ngu nhin. b) Thc hin mt php lc trch lc 2 c tnh. c) nh gi sai s bnh phng ti thiu nh nht gim th nguyn ca khng gian biu din i tng. d) Thc hin mt php trch lc c tnh s dng phng php phn tch thnh cc thnh phn chnh.
Cu 2. Gi s rng chng hn xy dng c thut ton A. Cho tp mu hun luyn T = {( x1 , y1 ),...., ( x2 , y 2 )} , trong xi l mu hun luyn v yi l nhn ca mu xi ,

yi {-1, +1}. Hy vit mt thut ton hun luyn mu cho php cp nht tp mu T cho vi thut ton hc A c (SVM, hoc Boosting, hoc mng N ron ).
Cu 3. nhn dng mt chui cc k t ch vit tay ri rc t A n Z ngi ta s

dng m hnh markov n hai chiu. Gi s rng mi k t vit tay c biu din bi mt m hnh markov n hai chiu c lp (, A, B) v c hun luyn. Hy vit thut ton nhn dng mt k t vit tay Y.
Cu 4. Cho mt tp cc i tng = {X i }, i = 1..K . Bit s phn lp ban u ca tp i

tng l L lp gm C1, C2,.., CL. Trong mi lp Cj, j=1,..,L bit mt s i tng nhng khng bit i tng m hnh mu. Hy xy dng hm ra quyt nh khi xut hin mt i tng mi M ta cn phi xp n vo mt trong cc lp ny. Cu 5. Xem xt mt m hnh Markov n c trng thi r w0 c mt quan st duy nht l v0 vi ma trn xc sut chuyn dch cc trng ti aij v ma trn xc sut cc quan st bjk ( ch s ca ma trn bt u bng 0) nh sau:
0 0 1 aij = 0.2 0.3 0.5 0 . 4 0 . 5 0 . 1 0 1 0 b jk = 0 0.7 0.3 0 0 . 4 0 . 6

a) Hy v th biu din ca m hnh markov n ny. b) Gi s rng trng thi n khi to ti thi im t=0 l w1. Bt u t t=1, hy cho bit xc sut quan st dy V3={v2, v1, v0}. Bi 6. a) Chng t rng hm logistic sigmoid
d ( z ) = (1 ) dz

b) Log-likelihood m i vi hun luyn hi qui logistic l

L( w) = y i log ( wT xi ) + (1 y i ) log(1 ( wT xi ))
i

Chng t rng graident ca n c dng thc n gin nh sau:

n dL = ( y i ( wT xi )) xi dw i

Bi 7. Hy chng t rng nu k1(x, x) v k2(x, x) l u l nhn hp l, th k1(x, x) + k2(x, x) cng hp l. (gi , bt u vi cc tnh cht ca Ma trn Gram Ki lin quan vi ki(x, x)).

Bi 8. Gi s c N lp C1, C2, , CN v mt vc t c tnh X, hy cho bit lut ra

quyt nh Bayes phn lp vi xc sut tin nghim (prior probability) ca cc lp v mt xc sut c iu kin (class-conditional probability densities) ca X. Bi 9. Cho mt tp hc T = {X j }, j = 1..8 c s phn lp ban u nh sau:
0 C1 : X 1 = 0 ; 0 0 C2 : X 5 = 0 ; 1 1 X 2 = 0 ; 1 0 X6 = 1 ; 1 1 X3 = 0 ; 0 0 X7 = 1 ; 0 1 X 4 = 1 0 1 X 8 = 1 1

e) Tm phng trnh phn tch tuyn tnh (nu c th) bng th tc gia tng c nh. Vit mt gii thut thc hin bi ton ny theo thut ton Perceptron v nhn xt. f) So snh kt qu tm c vi kt qu t c theo phng php thng k vi gi thuyt rng cc i tng c phn b Gauss. Bi 10. Cho mt khng gian i tng biu din bi cc vector nh phn, gi thit khng gian ny c phn chia thnh 2 lp theo qui lut ra quyt nh c dng nh sau:
x C1 nu s cc thnh phn khc 0 ca X l mt s chn x C2 nu s cc thnh phn khc 0 ca X l mt s l

Hy chng t khng gian i tng ny khng th phn tch tuyn tnh. Bi 11. Trong mt knh truyn tin nh phn thng b nhiu ph hy, gi thit c phn b xc sut Gaussian. Hy p dng qui tc ra quyt nh Bayes xy dng mt qui lut phn bit (nhn dng) tn hiu u ra ca knh l tn hiu 0 hay l 1. Bi 12. Gi s rng p(x|w1) v p(x|w2) c nh ngha nh sau:

a) Tm li phn lp ti thiu lut g(x) i vi bi ton 2 lp ny, gi s rng P(w1) = P(w2)=0.5. b) Cho xc xut tin nghim ca lp th nht, c xem nh l , sao cho P(w1)> , lut phn lp vi li ti thiu phi lun lun l w1 i vi x. Xc nh . Bi 13. Hy cc mu c rt ra mt cch lin tip, xc sut P(wi) ca cc trng thi = 1 nu trng thi t nhin ca mu th k t nhin la chn c lp l cha bit. t l wi v =0 trong trng hp ngc li. a) Chng t rng:

b) Cho cng thc trn, chng minh rng c tnh tng t chc chn nht i vi P(wi) l:

Bi 14. Tnh cc xc sut t mng Bayes di y

a) b) c) d)

P(A, B, C, D) P(A| B) P(C|B) P(B|D)

Bi 15. Cho mt tp cc i tng = {X i }, i = 1..K . Bit s phn lp ban u ca tp i tng l L lp gm C1, C2,.., CL. Hy xy dng hm ra quyt nh khi xut hin mt i tng mi M ta cn phi xp n vo mt trong cc lp ny. Bit rng a) Trong mi lp Cj, j=1,..,L bit mt s i tng nhng khng bit i tng m hnh mu. b) Bit m hnh mu ca mi lp Cj, j=1,..,L Bi 16. Phn bit tuyn tnh Fisher a) Phng php phn bit tuyn tnh Fisher l g? b) Cho d liu 2 chiu i vi cc lp C1 = [(1, 1), (1, 2), (1, 4), (2, 1), (3, 1), 3, 3)] v

C2 = [(2, 2), (3, 2), (3, 4), (5, 1), 5, 4), (5, 5)] - Xc nh ng chiu ti u trong khng gian n chiu. - Cho bit nh x ca cc im n ng thng cng nh Bayes phn bit gi nh
phn phi ph hp