HC VIN K THUT QUN S

KHOA CNG NGH THNG TIN

BO CO
MN: TR TU NHN TO

Trnh by v mng Hamming. p dng cho bi ton phn bit 2 nhm nh s
m t ch s 6 v 9.



GVHD: TS NG HU PHC
---o0o---
SINH VIN: Phm Quang V
Lp : TH9A













H Ni, 2014

LI M U
Nhn dng ch s l 1 vn tng i rng, trong bi bo co ti
xin trnh by phng php nhn dng mt s ch s vit tay trn nh en
trng.
Ta cn gii quyt 2 vn sau :
- Vn 1: tch k t ra khi nh gc.
- Vn 2: da vo cc thng tin c nhn dng k t .
Vn 2 c gii quyt bng cch s dng mng Noron nhn nh
k t trong nh gc, trong ti mng Noron c dng l mng
Haming.

NI DUNG
I. Gii thiu v mng Neural?
nh ngha: Mng nron nhn to, Artificial Neural Network
(ANN) gi tt l mng nron, neural network, l mt m hnh x
l thng tin phng theo cch thc x l thng tin ca cc h nron
sinh hc. N c to ln t mt s lng ln cc phn t (gi l
phn t x l hay nron) kt ni vi nhau thng qua cc lin kt
(gi l trng s lin kt) lm vic nh mt th thng nht gii
quyt mt vn c th no .
Mt mng nron nhn to c cu hnh cho mt ng dng c th
(nhn dng mu, phn loi d liu, ...) thng qua mt qu trnh hc
t tp cc mu hun luyn. V bn cht hc chnh l qu trnh hiu
chnh trng s lin kt gia cc nron.

II. Hun luyn mng Neural: bng lut hc khng gim st
1) Khi nim hc:
Khi nim: Hc l qu trnh thay i hnh vi ca cc vt theo mt
cch no lm cho chng c th thc hin tt hn trong tng
lai.
Mt mng nron c huyn luyn sao cho vi mt tp cc vector
u vo X, mng c kh nng to ra tp cc vector u ra mong
mun Y ca n. Tp X c s dng cho hun luyn mng c
gi l tp hun luyn (training set). Cc phn t x thuc X c
gi l cc mu hun luyn (training example). Qu trnh hun
luyn bn cht l s thay i cc trng s lin kt ca mng. Trong
qu trnh ny, cc trng s ca mng s hi t dn ti cc gi tr
sao cho vi mi vector u vo x t tp hun luyn, mng s cho
ra vector u ra y nh mong mun
C ba phng php hc ph bin l hc c gim st (supervised
learning), hc khng gim st (unsupervised learning) v hc tng
cng (Reinforcement learning):
2) Lut hc khng gim st
1) L vic hc khng cn c bt k mt s gim st no.
2) Hc khng gim st: hon ton khng c tn hiu bn ngoi. Gi
tr mc tiu iu khin khng c cung cp v khng c tng
cng. Mng phi t khm ph cc mu, cc nt c trng cn i,
tnh tng quan,Trong khi khm ph cc c trng khc, mng
noron tri qua vic t thay i thng s, vn c gi l
t t chc.
3) Tn hiu vo c th c ly t cc u ra ca noron khc hoc
bn ngoi. Khng cn phi phn bit cc nhm s liu vo. Tt c
cc tn hiu vo c a vo cng mt lc. Cc noron ban u
c t gi tr 0. Khi hun luyn s lm thay i gi tr cc noron.
Qu trnh Hun luyn dng: khi dch chuyn noron l nh nht
trong khong xc nh trc.
4) Mng nron ch nhn c mt tp hp cc u vo t mi trng
bn ngoi. N c v b n tng tng nhng g cc mng c
th c th hc hi t thit lp mt ch s u vo. Tuy nhin, c th
chnh thc chng minh rng mt mng li khng c gim st
c th xy dng i din ca cc u vo c th c s dng cho
vic ra quyt nh.
5) Do c im ca nhn dng ca noron khng gim st nn s
lng th nghim khng i hi nhiu nh c gim st.
6) Do s nhn dng l theo vng khng gian nn s nhm ln trong
nhn dng l gim ng k vi mng noron c gim st.
7) Tnh tng qut ha: tnh t t chc hon ton.

III. Mng Hamming
1) Mng Hamming gm 2 lp
Lp 1: Lp tin x l( PreNet)
- C s noron bng s mu cn nh t tp s liu u
vo, mi noron trn lp tin x l lu tr 1 mu s
liu C
i
R
N
.
- u ra ca cc noron ny l tng t ( Mc
ging nhau) gia cc mu do noron c c trng
vi vector u vo ang xt.

Lp 2: Lp hi qui( MaxNet)
- C s noron bng s nron ca lp PreNet.
- Mi noron u vo gm 1 u ra ca noron tng ng t lp
tin x l v cc u ra ( tr t chu l trc) ca tt c cc
noron MaxNet.
- Mc ch ca lp Maxnet: la chn c u ra c gi tr
ln nht t lp tin x l. Vic la chn ny c thc hin
thng qua qu trnh lp: cc gi tr t lp tin x l c a
vo cc noron lp MaxNet, cc noron ny s iu chnh theo
hng gim dn cc gi tr t lp tin x l. Nhng gi tr ln
s b gim t, gi tr nh b gim nhiu cho n khi bng 0.
Qu trnh lp li nh vy s dn n ch cn 1 noron duy nht
c gi tr u ra khc 0 v noron cng tng ng vi u
ra ln nht ban u t lp tin x l.

2) Hun luyn mng Hamming
a. Lp truyn thng:
Tin hnh 2 cng vic: hun luyn tm ra cc
nguyn mu i din cho cc nhm; hun luyn c
c u ra cho lp truyn thng.
1) Hun luyn tm nguyn mu i din cho cc nhm:
Ta p dng lut instar :
a= hardlim(Wp + b );
W(0) c khi to ngu nhin
Ti bc th k:
W(k)= W(k-1) + a(k) (p(k) W(k-1))
Trong : p : thng tin nh mu
W : Vector trng s i din cho nhm mu

Lp qu trnh trn cho n khi W hi t ta s thu c
trng s i din cho c nhm mu a vo.
M t cht lng ca lut instar :

Do mt instar ch dng cho mt lp mu, tc l
cc vecto mu vo nhn chung sai khc it nn m
bo tnh hi t cho instar.
Khi = 0 th W(k) = W(k-1) vector trng s khng dch
chuyn; iu ny dn n khi ta cho 0 th h thng s
lu t c trng thi n nh, song khi t c trng thi
n nh th vector trng s s c n nh st quanh gi tr
trung tm.
Khi = 1 th W(k) = p(k) trng vi vector u vo. Nh
vy h thng nhanh t gi tr n nh nhng gi tr ny d
b dao ng khi n tip nhn mt u vo mi ca lp mu,
dn n khi ta cn nhn dng mt u vo th d xy ra
nhm ln.
2) Hun luyn tm u ra cho lp truyn thng :
Tnh u ra ca lp 1:
a
1
= W
1
p + b
|| a
1
|| l s vector nguyn mu thu c (chnh l s
nhm mu k t)
b. Lp hi quy:
a
2
(0)=a
1
(khi to)
Ti bc th k :
a
2
(k+1) = poslin(W
2
a
2
(k));



Thut ton dng khi vector u ra hi t. Kkhi
thnh phn max ca a
2
s cho tng ng vector
nguyn mu gn vi vector cn nhn dng nht v
l kt qu nhn dng ta thu c.
Chng minh tnh hi t ca a
2
:
Ta thy vi mi thnh phn ca a
2
trong php
bin i trn:
a
2
i
(k+1) = poslin ( a
2
i
(k) -

)
vi iu kin 0 < < 1/(S -1) th sau mi bc gi tr
a
2
i
li b gim i
cc thnh phn s gim n khi no ch cn mt gi tr
ln nht ln hn 0 v cc phn t cn li u bng 0.
Nh vy khi a
2
hi t.