1. Gii thiu ti tp trung i su nghin cu v cch xy dng mng phn cm kt hp hai hng m - FBACN.

. Mng ny c pht trin phc v cho vn ti u cc rng buc vi cc hm mc tiu. Cu trc mng bao gm hai lp mng hi quy c a ra cho phn cm m da trn phng php hm mc tiu. 2. Phn cm m 2.1. Vn phn cm m Thng thng, mi phng php PCDL phn mt tp d liu ban u thnh cc cm d liu c tnh t nhin v mi i tng d liu ch thuc v mt cm d liu, phng php ny ch ph hp vi vic khm ph ra cc cm c mt cao v ri nhau (phn cm r). Tuy nhin, trong thc t, cc cm d liu li c th chng ln nhau, ngha l mt s cc i tng d liu thuc v nhiu cc cm khc nhau, ngi ta p dng l thuyt v tp m trong PCDL gii quyt cho trng hp ny, cch thc kt hp ny c gi l phn cm m. Trong phng php phn cm m, ph thuc ca i tng d liu xk ti cm th i (uik) c gi tr thuc on [0,1]. tng trn c gii thiu bi Ruspini (1969) v c Dunn p dng nm 1973 nhm xy dng mt phng php phn cm m da trn ti thiu ho hm mc tiu. Bezdek (1982) tng qut ho phng php ny v xy dng thnh thut ton phn cm m c-means c s dng trng s m. K-means l thut ton PCDL r v c-means l thut ton phn cm m tng ng, hai thut ton ny cng s dng chung mt chin lc phn cm d liu. Thut ton c-means m hay cn gi tt l thut ton FCM (Fuzzy C means - FCM) c p dng thnh cng trong gii quyt mt s ln cc bi ton PCDL nh trong nhn dng mu, x l nh, y hc, Tuy nhin, nhc im ln nht ca thut ton FCM l nhy cm vi cc nhiu v phn t ngoi lai trong d liu, ngha l cc trung tm cm c th nm xa so vi trung tm thc ca cm. c nhiu cc phng php xut ci tin cho nhc im trn ca thut ton FCM bao gm : Phn cm da trn xc sut (keller, 1993), phn cm nhiu m (Dave, 1991), Phn cm da trn ton t LP Norm (Kersten, 1999). Thut ton - Insensitive Fuzzy C-means ( FCM). 2.2. Hm mc tiu Mt cch ph bin trong PCDL l ti thiu ho hm mc tiu nhm o cht lng ca phn hoch. Trong phn cm m, tng tt c cc phn hoch m c c cm d liu ca tp d liu c N i tng trong khng gian D chiu c xc nh nh sau:
-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

M
Trong :

= U RcN | fc 1 i c 1 k N

ik

[0,1], uik = 1,
i =1

0 < uik < N (1) k =1

N

cN

l khng gian ca tt c cc ma trn thc cp c*N, uik l cc phn t

ca ma trn U. Hm mc tiu ca phn cm m c nh ngha nh sau :

Z m (U , V ) = (u ik )
i =1 k =1

2 ik

(2)

Trong

U M

fc

, V=[v1, v2, , vc] R pc l ma trn mu biu din cc gi

tr i tng tm ca cm, m l trng s m nm trong (1, ). Hn na, xc nh nh sau :

ik

d ik = | x k vi| = ( x k vi) G( xk vi)

2 T G

(3)

Trong : G l ma trn hu hn dng 3. Xy dng mng nron phn cm kt hp hai hng m (FBACN) bng vic s dng mng a khp ni
recursion3

Layer 1
Ti u cc trung tm cm vi recursion1

Layer 2
vis
Ti u cc thuc ui,k recursion2

uis

Hnh 1 : M hnh FBACN

FBACN s dng cc mng nron a khp ni, khng gn trc tip cc cng thc ca fuzzy c-means. Cu trc ca FBACN c a ra nh hnh 1. Lp hi quy layer1 (recursion1) c thc hin bi mt mng Hopfield ti u ho cc trung tm cm. Trong khi lp hi quy layer2 (recursion2) c thc hin bi mt mng nron a khp ni ti u cc thuc. Kt hp layer1 v layer2 to thnh lp hi quy 3 (recursion3).

-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

Hot ng ca FBACN c m t nh sau: th nht l khi to ngu nhin cc trung tm cm v thuc thnh vin ca layer1 v layer2 tng ng. Th 2, khi to cc thuc thnh vin trong layer2 s c truyn sang layer1. Th 3, da trn vic nhn c cc thuc thnh vin, layer1 thc hin qu trnh hi quy thu c cc trung tm cm ti u mi. Th 4, cc trung tm cm mi ca layer1 truyn sang layer2. Th 5, da trn vic nhn c cc trung tm cm mi, thc hin qu trnh hi quy thu c thuc thnh vin ti u mi. Vic hon tt qu trnh trn t bc 2 n bc 5 c gi l qu trnh lp. Qu trnh lp din ra cho ti khi no t ti mt tiu chun ti hn. 3.1. Xy dng lp mng layer1 cho ti u cc trung tm cm

v1

i1 w11 w21 w1s 1 i2 2 w2s wss is s net2 f v2 net1 f v1

v2

w12 w22 ws1

ws1

M
nets f vs

vs

Hnh 2: Layer1 ca FBACN

Lp mng Layer1 s dng m hnh mng Hopfield, chc nng ti u ha cc trung tm cm. Ma trn i din tng u vo mng: NET = W.V +I (4) Vi
net1 net 2 NET = , W= M net s w11 w21 M ws1 w 12 ... w 1s w 22 ... w 2s , V= M O M w s2 ... w ss v1 v 2 v I = M v s i1 i2 (5) M i s

- Tnh ng ca mng (cho mi nron th j), vi g l ch s hi quy

-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

(6) - ti thiu ho hm mc tiu Zm, s cn thit phi xy dng hm nng lng tnh ton E cho Layer1 bng cc thm cc thnh phn tng ng vo cng thc (4), ta s c (7) 1 s s E=w ji vi v j i j v j (7) 2

j =1 i =1

j =1

- Bin i hm mc tiu (*) ph hp qu trnh i snh vi hm nng lng ca mng (loi b s tn ti dng vc t, gn li nhn, loi b thnh phn hng s)
Z m (U; V) = 2(ui ,k ) m v(i 1) p +l xk ,l + (ui ,k ) m v(2i 1) p +l
k =1 i =1 l =1 n l p

(8)

- i snh gia hm nng lng E v hm mc tiu Zm tm ra cc gi tr ca cc ma trn W, I. Chi tit nh cng thc (10)

(10)

Qu trnh ti u ca Layer1
- Tnh ton vect nng lng gradient ca (4) ta c
E = NET

(11)

- S thay i trong mi bc tin ho ca mng

E = net j v j
s

(12)

- Xy dng hm kch hot ri rc

v
( g +1) j

j =1

+ f net j

(g )

(g ) (g ) v j + j if net j 0 = (g ) (g ) v j j if net j < 0

(13)

Vi j l h s cp nht gi tr dng nh iu chnh vj. Quan st rng nu netj(g)0 th vj = v (j g +1) - v (j g ) = j >0. iu ny dn n s thay i nng lng,
E = net v j 0 trong cng thc (12) c gi tr m. Khi netj
j =1 s

(g)

<0, vj = v (j g +1) -

-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

v (j g ) = - j <0, iu ny cng em li E = net v j < 0 . Do mt hm kch hot

j =1

ri rc nh (13) bo m rng gi tr ca (8) s gim xung trong qu trnh hi quy layer1. Khuynh hng t n nng lng thp s tc ng lm cho cc vis xut hin tt hn. 3.2. Xy dng lp mng layer2 cho ti u cc thuc - Chc nng l ti u cc uik - Bin i hm mc tiu Zm thun li cho qu trnh i snh sau ny bng cc loi b cc thnh phn hng s, dng vc t, v gn li nhn, ta c cng thc (14).

(14) - Tn ti di dng bc cao, thc y pht trin mng a khp ni. - M hnh mng a khp ni c s cho Layer2

u1 w11
u1m 1

i1 z11 i2 2 net2 f 1 net1 f

u1 h

u2
m 1 u2

w31

w21 z21

u1m1

u2 h
m 1 u2

us

zs1 is

nets

us h

u sm 1

Hnh 3: Layer2 ca FBACN

u sm 1
(15)

- Ma trn u vo mng: NET = W.U<m-1> + Z.U + I - Tnh ng ca mng:

s u (j g +1) = f net (j g ) = f w ji ui( g ) i =1

( )

m 1

+ z ji ui( g ) + i j

(16)

- ti thiu ha hm mc tiu, mt cch tng t nh Layer1, ta thit lp hm nng lng, sau i snh tm ra cc gi tr ca cc ma trn: W, Z, I.

-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

 Qu trnh ti u ca Layer2
- Vect nng lng gradient c tnh ton lin quan n uj

E = net j u j

- Hm kch hot ri rc c a ra

( g +1) j

(g ) (g ) u j + j if net j 0 = f (net j ) = ( g ) (g ) u j j if net j < 0 (g )

(17)

- Vi vect nng lng gradient lun m v cng thc (17), m bo mng Layer2 s ti u trong qu trnh tin ho. 4. S hi t ca FBACN Mt yu t quan trng cho mng hi quy l kh nng n nh ca mng. Trc khi a ra tnh n nh ca mng FBACN, chng ta s bt u vi mt vi nh ngha v khng gian metric v nh l a ra bi Steck v sau l mt nh l hi t ph qut. nh ngha 1. Mt khng gian metric trn tp X nu trn n c mt hm gi tr thc d xc nh trn XxX, c mt s tnh cht sau: 1) d(x,y)0, vi x,y X. 2) d(x,y)=0, nu x=y. 3) d(x,y)=d(y,x), vi x,y X. 4) d(x,z) d(x,y)+d(y,z), x,y,z X Dnh ngha 2. X l mt khng gian metric vi mt metric d v t l mt hm xc nh t X vo X, th im x X c gi l mt im c nh nu (x) = x. nh ngha 3. l mt s thu gn (contraction) nu tn ti mt im c*, 0<c*<1, sao cho d((x),(y)) c*.d(x,y), vi x,y X. (18)

phng php nh x thu gn : Mt nh x thu gn ca khng gian metric y c chnh xc mt im c nh [19]. nh l 1: ng vi mt mng nron hi quy kt ni y gm s nron vi tnh ng kch hot sau:

-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

net (jg +1) = w ji f net i( g ) + i j

i =1

(19)

Vi f l hm thc kh vi lin tc, c gii hn v nu cc iu kin sau tho mn

w ji < c ** < f max

1 vi 1 i & j s s

(20)

th mng hi t ti mt im duy nht vi bt k gi tr khi to no [20][21]. B : Vi f l hm thc kh vi lin tc c gii hn th vi mi x, y R ta c

' f (x ) f ( y ) f max x y

(21)

Da vo cc nh ngha, nh l v b trn, mt phng php hi t ph bin cho mng nron a khp ni c a ra nh sau: nh l 2: (i vi mng nron a khp ni) ng vi mng nron a khp ni gm s nron c hai trng s wji v zji v c tnh ng kch hot sau
net j
( g +1)

= w ji f net i
i =1

((

(g )

))

+ z ji f net ig + i j

(22)

vi f l hm thc kh vi, lin tc v c gii hn, c cc iu kin sau tho mn

(f )

m 1 ' max

w ji < c ** < w ji + f max

1 s
vi 1 i&j s

(23)

Th mng hi t ti mt im c nh duy nht vi bt k gi tr khi to no. Kt lun Qu trnh tnh ton v chng minh, ta c c kt qu sau: - Vi Layer1, mng tho mn gi thuyt ca nh l 1, nn mng hi t - Vi Layer2, mng tho mn gi thuyt ca nh l 2, nn mng hi t 5. Gii thut ca FBACN Cc bc thc hin sau: 1). Thit lp cc gi tr c, m, , v cc h s iv, iu trong cc layer1, layer2 tng ng 2). Thit lp cc h s v, u cho layer1, layer2 tng ng

-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

3). Khi to ngu nhin v(i 1)* p +l , trong layer1 vi i=1,2,c v l =1,2,,p v cc thuc thnh vin [ui,k] Mfc trong layer2 vi i=1,2,...,c v k=1,2,,n 4). Gn vj = iv v uj = iu v net(0)j =0 vi mi j=1,2..s (s=c*p trong layer1 v s=n*c trong layer2) 5). Thit lp ch s hi quy g=1 cho layer1 6). Trong layer1: Tnh ma trn W theo cng thc(3.12), ma trn I theo cng (3.11), v ma trn NET theo cng thc (3.4)
7). For j = 1 to s
g 1 if net g < 0 then vj := j . net j

vj

8). For j = 1 to s if net g j 0 then v j := v j + vj else v j := v j vj 9). IF (( v1 v ) & ( v2 v ) & ... & ( vs v )) then goto Step10 Else g := g + 1 and goto Step 6

10). t g=1 cho layer2 11). Trong layer2: Tnh ma trn W theo cng thc (3.23), Z theo cng thc (3.24) v I=[2, 2,, 2]T1,cxn v ma trn NET = W.U<m-1> + Z.U +I
12). For j = 1 to s
g 1 < 0 then uj := if net g j . net j

uj

13). For j = 1 to s if net g j 0 then u j := u j + uj else u j := u j uj 14). If (( u1 u ) & ( u2 u ) & ... & ( us u )) then goto Step15 Else g := g + 1 and goto Step11 15). If U (g) U (g1) Then terminate algorithm Else goto Step4

6. Thc nghim
Input - Hai tp d liu + Tp d liu Butterfly, vi 53 im d liu, kch thc 2 cho mi im.
-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

+ Tp d liu v loi hoa Iris, vi 150 im d liu, kch thc 4 - Cc thng s s dng: + Trng s m: m=2 + Hng s nhn Lagrange: = 1000 + H s gii hn: = 0.001 + Khi to h s cp nht: iv=0.5 v iu = 0.2 + H s n nh hi quy: v=0.0001 v u=0.0001 Ouput - Butterfly: Lp ton mng 15 ln - Hm mc tiu Zm 1361.67501
1211.33943 773.37927 549.62118 536.57204 536.28857 536.16007 535.98195 536.01463 536.00108 536.00069 536.0014 535.99992 536.00138

- Iris: Lp ton mng 35 ln - Hm mc tiu Zm 489.76932

402.26199 303.28219 227.94389 199.70799 171.40243 154.44207 148.90185 144.87851 142.01987 125.99175 125.76015 125.60948

536.00039 - 2 cm (26, 26) - nh gi: Kt qu t c tt.

125.27014 - 3 cm (57,50,40)

7. Ti liu dn
[1] Martin T. Hagan and Howard B. Demuth Neural network design, PWS Publishing Company, 1996. [2] J.H.Wang and C.Y.Peng, Optimal clustering using neural network, in Proc. IEEE Int. Conf. Syst., Man, Cybern., vol.2, 1998, pp.1625-1630 [3] Y.Guo, X.Yin, and W.Gong, ART2 neural network clustering for hierarchical simulation, in Proc. SPIE Int. Soc.Opt.Eng., vol. 2.1998, pp.35-48 [4] M.F.Augusteijn and U.J.Steck, Supervised adaptive clustering: A hybrid neural network clustering algorithm, neural Comput.Applicat., vol.7,no. 1, pp.78-89, 1998. [5] T.Kohonen, Self organization and associative memorry, Berlin, Germany: Springer-Verlag, 1984.

-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

[6] E. C. Tsao, J. C. Bezdek, and N. R. Pal, Fuzzy Kohonen clustering network, Patterm recognition, vol.27, no.5, pp.757-764, 1994. [7] J. Lin, K. Cheng, and C.Mao, A fuzzy Hopfield neural network for medical image segmentation, IEEE Trans. Nuclear Sci., vol.43, 1996. [8] V Thanh Nguyn, ng dng logic m, mng nron m, h cc lut m phn tch d bo cc mt hng chin lc, Hi tho khoa hc H m, mng nron v ng dng, ln th nht, H ni 8-9/11/2006. [9] Bi Cng Cng v Nguyn Don Phc, H m, mng nron v ng dng , NXB Khoa hc v k thut, 2006. [10] Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Hacours Science and Technology Company, USA, 2001. [11] J.Han, M.Kamber and A.K.H. Tung, Spatial Clustering Methods in Data mining : A Survey, Simon Fraster University, Canada, 2002 . [12] MARIA HALKIDI, On Clustering Validation Techniques, Kluwer Academic Publishers, Holland, 2001. [13] Hong Tu, Hm thc v gii tch hm, Nh xut bn i hc Quc gia H Ni, 2003. [14] Jacek Leski (2001), An -Insensitive Approach To Fuzzy Clustering, International Journal Applied Mathematics and Computer Sciences, Vol.11, No.4, 2001, pp.993-1007. [15] Kersten P.R.(1999), Fuzzy Order Statistics and their application, IEEE Trans.Fuzzy Syst, No 6. [16] Hathaway R.J and Bezdek J.CNTT (2000), Generalized fuzzy c-means clustering Strategies using LP Norm Distances, IEEE Trans.Fuzzy Syst, No 5, pp.576-582. [17] K.S. Al-Suntal and S.Z.Selin, A global algorithm for the fuzzy clustering problem,, Patterm Recognition, vol. 26, no.9, pp. 1357-1361, 1993. [18] H.S. Rhee amd K.W.Oh, Performance measure for the fuzzy cluster validity, in Proc.Asian Fuzzy Syst. Symp., 1996. [19] R. E. Greene, Introduction to Topology, New York: Saunders, 1983, ch.1

-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

10

[20] J. E. Steck, Convergence of recurrent networks as contraction mappings, in Proc. Int.Joint Conf. Newral Networks, vol.III, 1992, pp.462-467 [21] J.E.Steck and S.N.Balakrishnan, Use of Hopfield newral networks in optimal guidance, IEEE Trans. Aerosp.Electron. Syst., vol.30, no.1, pp 287-293, Jan.1994.

-----------------------L Minh Hong, B mn Khoa hc my tnh v Cng ngh phn mm-------------------

11