Fuzzy criteria for feature selection

Nguyn Quang Mnh Nguyn Tin Qung

Tng quan
Trong hc my , s lng c trng cng nhiu th chnh xc cng cao ? Cha c chng minh c th cho vn . Nhiu c trng tn thi gian hc + phn loi. Cn thit phi la chn t tp c trng ra mt tp con nh hn m vn m bo chnh xc ca phn loi.

Nhn nhn vn
Vn c th trnh by nh mt vn ti u ho a mc tiu: Ti a chnh xc ca m hnh Ti thiu s lng c trng s dng Hai tiu chun tri ngc - khc khng gian tm kim gy kh khn a chng vo mt hm mc tiu c in. L thuyt tp m cung cp cch biu din v i ph vi cc mc tiu linh hot a v vn ti u ho m (Fuzzy optimization problem)

Ti u m cho bi ton
Bi bo ny s dng gii thut ti u ho n kin (Ant colony optimization - ACO) S dng hai n kin tng ng vi hai mc tiu khc nhau. C th kin s dng i ph vi tiu chun mu thun v trao i thng tin trong qu trnh ti u. S dng m hnh ra quyt nh m ca Bellman v Zadeh xy dng b phn loi m

Gii thut ACO

Bi ton ti u: Cho f:X, Tm xX sao cho f(x) is l nh nht

V d: cho mt th, gi s ta c hai nh A v B trn th. Tm ng i ngn nht gia 2 nh A, B. Bi ton ng i ngn nht

Thc t

Thc t khi kin i kim n, trn ng chng tr v chng s tit cht pheromone nh du. Ln i tip chng s chn hng c nhiu pheromone nht i.

S ra i ca ACO
Thut ton ti u n kin ra i da vo hin tng sinh hc t nhin trong vic kim n ca kin. Thut ton c dng gii bi ton ng i ngn nht v cc bi ton ti u khc.

Trong thc t sau mt thi gian kim n th n kin s chn cho n 1 ng i ngn nht.

Minh ha thut ton ACO

Cho th (V={0,...,N}, E={ij})

for all i: pi:=0; si:=hungry; for all i j: ij:=const; repeat for all i: ant_step(i); for all i j: ij := (1-) ij ;

/*ant position init*/ /*ant state init*/ /*pheromone init*/ /*ant step*/ /*evaporate pheromone*/

Minh ha thut ton ACO

ant_step(i): if pi=N: si:=satisfied; if pi=0: si:=hungry; /*collect food/deliver food*/ if si=hungry: choose j with pij with probability pi j/pijpij /*choose next step*/ update pi j := ; pi:=j; /*update pheromone*/ if si=satisfied: choose j with jpi with probability jpi/jpijpi update jpi:= ; pj:=i; /* reversed directions*/

Nhn xt v ACO
ACO thc cht l tm kim ngu nhin da vo thng tin heuristic kt hp vi thng tin hc tng cng. So vi cc thut ton heuristic c in th ACO m rng thm qu trnh hc tng cng, cc con kin t ra thch nghi hn vi mi trng da vo cc vt mi trn cnh th c tch ly.

y ch l tng v thut ton, cc cng trnh ci tin ca thut ton cho ti hin ti v thut ton ACO c th c dng trong bi bo s c trnh by chi tit sau.

Hm mc tiu

Dng l thuyt tp m kt hp cc mc tiu: - Tng hiu nng ca b phn loi - Gim ti thiu cc c trng cn s dng.

M hnh ra quyt nh m
Decision = Confluence of Goal and Constrains.

V d

 C th cho phn sau:

- Trnh by c th thut ton ACO c ci t nh th no vi bi ton - C th cch dng ca hm mc tiu m.

B phn loi m
Cha lut c s: Tp cc lut nu-th m + chui suy din m. S dng suy din xc nh lp m vector thuc v. Ba phng php thit k b phn loi m c ch :
Phng php hi quy Phng php ring bit - discriminant method Phng php tng thch ti a

Discriminant method

= ()

Thank you!