Hc vin: T Vnh Sn M HV: CH0301061 I/ M u: Em ch xin o su v thut ton pht hin lut kt hp vi thut ton Apriori, thut ton

n AprioriTid, thut ton AprioriHybrid, thut ton SETM, thut ton AIS, thut ton genrule(pht sinh lut).Trong nhng thut ton ny th thut ton AprioriHybrid l thut ton tt nht da trn phn tch sau: Ngoi ra vic ng dng thut ton trn kt hp vi khai thc mng nrn cng c p dng cho nhiu lnh vc nh p dng cho vic d on tnh trng ph sn ca cc cng ty da trn mu ca cc cng ty b ph sn kt hp vi phn tch tnh trng ca cng ty da trn lut kt hp nhm d on kh nng ph sn Kt hp vi Fuzzy Logic th lut kt hp to ra nhiu lut hn h tr cho vic ra quyt nh tt hn trong mi lnh vc vi thut ton SSDM ang c pht trin II/ CC THUT TON CHO LUT KT HP: I1_1/ tng chung ca thut ton pht sinh lut kt hp: Da trn tp cc phn t I v min_sup tm ra cc tp phn t I l tp con ca I tha mn min_sup. Sau da vo min_conf pht sinh lut. Thc t vi tp n phn t th s ln duyt t nht l 2n . iu ny a n vic bng n t hp.C nhiu thut ton nh AIS,SETM,Apriori,AprioriTID v AprioriHybrid II._2/ Thut ton Apriori: 1/ L1 = ( cc tp phn t ch c 1 phn t }; 2/ For ( k=2; Lk-1 <> ; k++) do begin 3/ Ck =apriori-gen(Lk-1);// Cc ng vin mi new candidates 4/ forall transactions(giao tc) t D do begin 5/ Ct = subset(Ck,t) ; // Cc ng vin cha trong t 6/ forall candidates c Ct do 7/ c.count++ ; 8/ end; 9/ Lk = { c Ck | c.count >= minsup } 10/ end 11/ Answer =

L
k

II_3/Thut Ton AprioriTid: 1/ L1 = { Cc tp hp tha 1-phn t } 2/ C1 = c s d liu D; 3/ for ( k=2;Lk-1 <> ; k ( do begin 4/ Ck = apriori-gen(Lk-1) ; //Pht sinh cc ng vin mi 5/ C k = ; 6/ forall danh sch (entries) t C k 1 7/ // Xc nh cc tp phn t ng vin trong ck cha trong giao tc vi bin nh danh t.TID Ct = { c Ck | ( c- c[k]) t.set of items ( c- c[k-1]) t.set of items }; 8/ forall ng vin (candidates) c Ct do 9/ c.count ++; 10/ if ( Ct <> ) then C k + =<t.TID>,Ct >; 1

Hc vin: T Vnh Sn M HV: CH0301061 11 end; 12/ Lk = { c Ck | c.count >= minsup} 13/end; 14/ Answer =

L
k

III/ NHN XT CC THUT TON:

1/ Cc thut ton u th hin vic loi b cc tp phn t theo qui tc nhnh cn. 2/Thut ton AprioriTid nhanh hn thut ton Apriori nh n s dng thm tp C k ( backward tracking)lu tr cc tp k phn t ca cc giao tc , nh vy vic m minsup tr nn d dng v nhanh hn nhng b li chim dng b nh trong nhiu hn so vi li thut ton Apriori . Thut ton AprioriTid cng s dng hm apriori-gen xc nh cc tp ng vin trc mi bc bt u. Tnh cch th v ca thut ton ny l c s d liu D th khng c s dng cho vic m support sau bc u tin.. Hn na tp C k th c s dng cho mc ch ny. 3/ Cc thut ton u gim chi ph cho mt ln tnh support ca cc tp k_phn t bng cch duyt qua cc tp con 1_phn t, da vo thng tin ny ta tip tc tnh cc tp 2- phn t (tp cc ng vin Candidate) t suy ra tp cc phn t tha mn min_sup Do gim i s ln lp. 4/ ci thin vic lu tr d liu cho tn km b nh ta c th lu tr mi byte ng vi mt ha n rong bit th i nu bng 1 s cha mt hng th i+1.Cch t chc ny ci thin tc truy xut v thao tc nhanh hn. 5/ Vic xy dng tp Ck t Lk-1 tt hn so vi tp Ck-1 , u ny gip cho ta loi bt i mt lng ln tp Q m support(Q) < minsup 6/ Thut ton AprioriTid v Apriori nhanh hn thut ton AIS v SETM.Tuy nhin khi s dng thut ton AprioriTid ta cn ch n b nh do pht sinh tp thm tp C k c cha m nh danh TID trong mi giao tc 7/ Trong thc t ngi ta kt hp hai thut ton Apriori v AprioriTid thn thut ton AprioriHybrid v thut ton Apriori nhanh bc u nhng sau mi ln pht sinh tp ng vin C th li phi duyt li c c s d liu D rt tn th gi , trong khi cc giai on cui ca cc ln pht sinh tp ng vin Ck, ri tp C k c dng <TID, {Xk} > trong thut ton AprioriTid gip ta khng cn phi duyt li tp c s d liu D v sau, tn thi gian nhng b li tn hao b nh.y chnh l s kt hp gia Apriori lc u v lc sau dng AprioriTid to ra thut ton AprioriHybrid IV/ NG DNG CA DATA MINING v Kt Hp Qua Mng N Rn Ngy nay vn d on ph sn ca mt cng ty l mt vn rt quan trng khi m Vit Nam chun b tham gia vo WTO

1/Hai phng php tip cn d on ph sn;

oDa trn d liu ti chnh v cc cng vic bao gm vi t l khc nhau oDng cc d liu ca cc cng ty ph sn v so snh vi d liu ca cng ty ang xem xt .

Hc vin: T Vnh Sn M HV: CH0301061 Nh vy da trn cc d liu tnh hnh ti chnh c sn ca cng ty kt hp vi kh nng a n ph sn ca cc cng ty c ta c th tm ra cc yu t vi ngng min_sup v min_conf da trn lut kt hp m tm ra c cc lut nhm h tr cho cc cng ty hn ch c s ph sn. Tuy nhin thc t cng c cc phn mm da trn lut kt hp v mng nrn suy ra lut ph sn nh sau: Kin trc ca mng nrn d on ph sn: D/Hng pht trin: Ngy nay tm ra c nhiu lut hn na h tr quyt nh cho cc nh ti chnh , cc chuyn gia Y khoa , chuyn gia gio dc ,kh tng thy vn ngi ta kt hp khng nhng vi mng n rn trong vic pht sinh lut m cn kt hp c vi lgic m . C th l thut ton SSDM( Semantically Similar Data Mining Algorithm) do Eduardo L. G. Escovar, Mauro Biajiz, Marina T. Pires Vieira Thut ton ny dng cc khi nim trong lgic m biu din s tng t gia cc phn t. V d nh: TID attribute1 attribute2 1 chair table 2 sofa desk 3 chair desk 4 chair table Da trn lut kt hp v d liu ta c : chair => table (min_sup 50%, min_conf 67%) sofa => desk ( min_sup 25%, min_conf 100%) chair => desk (min_sup 25%, min_conf 33%) Nn tng ca thut ton SSDM gm 3 yu t: min_sup: ng h ti thiu min_conf: tin cy ti thiu min_sim: tng t ti thiu gia hai phn t da trn s tng t khi ta dng lut kt hp Da trn khi nim mi v min_sim kt hp vi lgic m ta s tm ra c nhiu lut hn na trong tng lnh vc h tr rt nhiu cho con ngi