1. Support Vector Machine (SVM).

SVM l mt phng php phn lp xut pht t l thuyt hc thng k.

* tng ca thut ton
tng ca n l nh x (tuyn tnh hoc phi tuyn) d liu vo khng gian cc
vector c trng (space of feature vectors) m mt siu phng ti u c tm ra
tch d liu thuc hai lp khc nhau.
Cho trc mt tp hun luyn c biu din trong khng gian vector trong
mi ti liu l mt im, phng php ny tm ra mt siu mt phng h quyt nh tt
nht c th chia cc im trn khng gian ny thnh hai lp ring bit tng ng lp + v
lp . Cht lng ca siu mt phng ny c quyt nh bi khong cch (gi l bin)
ca im d liu gn nht ca mi lp n mt phng ny. Khong cch bin cng ln th
mt phng quyt nh cng tt ng thi vic phn loi cng chnh xc. Mc ch thut
ton SVM tm c khong cch bin ln nht.


Hnh Support vector machine

M hnh gii thut
- Tnh cht ni tri ca SVM l ng thi cc tiu li phn lp v
cc i khong cch l gia cc lp
+ Gi s c 1 s im d liu thuc mt trong hai lp,v mc
tiu ca ta l xc nh xem d liu mi thm vo s thuc lp no.Ta coi mi im d
liu nh mt vector p chiu v chng ta mun bit l liu c tch c nhng im
bng mt siu phng p-1 chiu hay khng( c gi l phn loi tuyn tnh)
+ Xem d liu u vo nh 2 tp vector n chiu,mt SVM s xy dng mt siu
phng ring bit trong khng gian sao cho n ti a ha bin l gia hai tp d liu.
+ tnh l,hai siu phng song song c xy dng,mi ci nm mt
pha ca siu phng phn bit v chng c y v pha hai tp d liu.
+ Mt cch trc quan,mt phn bit tt s thu c bi siu phng c
khong cch ln nht n cc im ln cn ca hai lp,v l cng ln th sai s tng qut
ha ca b phn lp cng tt hn.
Trnh by vi b phn lp nh phn
- ho tp d liu hc gm n d liu gn nhn D={(x1, y1), (x1,
y1),..., (xn, yn)} vi yi - l mt s nguyn xc nh lp ca xi. Mi xi l mt vn
bn c biu din di dng mt vector thc d chiu. phn lp tuyn tnh (m hnh
phn lp c xc nh thng qua mt siu phng c dng
f(x) = w.x b = 0
trong w l vector php tuyn ca siu phng v b ng vai tr l
tham s m hnh
- B phn lp nh phn c xc nh thng qua
du ca f(x):


2. Support Vector Machines Nearest Neighbor (SVM-NN)
Support Vector Machines Nearest Neighbor (SVM-NN) (Blanzieri & Melgani
2006) l mt thut ton phn lp ci tin gn y nht ca phng php phn lp SVM.
SVM-NN l mt k thut phn loi vn bn my hc s dng kt hp cch tip cn K-
lng ging gn nht (K-NN) vi nhng lut ra quyt nh da trn SVM (SVM-based
decision rule).
tng ca thut ton SVM-NN
Thut ton phn lp SVM-NN kt hp cc tng ca thut ton phn lp SVM
v thut ton phn lp K-NN.
N hot ng theo cch sau:
- Cho mt mu phn loi, thut ton xc nh k mu gn nht trong cc mu d
liu ca tp d liu hun luyn.
- Mt phn loi SVM c hun luyn trn nhng mu ny.
- Sau , cc b phn loi SVM c hun luyn s c s dng phn loi cc
mu cha bit.
I. Phn a lp (Multi class)
Cc thut ton trn thng p dng cho phn lp hai lp, tc l xc nh mt
vn bn c hay khng thuc mt lp cho trc . Vic p dng trong bi ton phn lp a
lp cn kt hp vi cc chin lc phn lp khc. .
tng ca bi ton phn lp a lp l chuyn v bi ton phn lp hai lp bng
cch xy dng nhiu b phn lp hai lp gii quyt. Cc chin lc phn lp a lp
ph bin ny l One-against-One (OAO) v One-against-Rest (OAR).

V d phn lp s dng chin lc OAR v OAO
Trong hnh ta thy chin lc OAR (hnh bn tri)- OAO (hnh bn phi) phi xy dng
siu phng tch lp nh du o ra khi tt c cc lp khc.

1. Chin lc One-against-One (OAO).
Trong chin lc ny ta s dng (n-1) b phn lp i vi n lp. Bi ton phn lp n lp
c chuyn thnh n bi ton phn lp hai lp.
Nhc im ca chin lc OAR l ta phi xy dng mt siu phng tch mt lp ra
khi cc lp cn li, vic ny i hi s phc tp v c th khng chnh xc

2. Chin lc One-against-Rest (OAR).
Trong chin lc ny ta s dng n(n-1)/2 b phn lp hai lp c xy dng bng cch
bt cp tng hai lp mt nn chin lc ny cn c gi l pairwise v s dng phng
php la chn theo a s kt hp cc b phn lp ny xc nh c kt qu phn
lp cui cng. S lng cc b phn lp khng bao gi vt qu n(n-1)/2.