CNG H CHUYN GIA

1. H chuyn gia v cc c trng ?

a.Khi nim: - H chuyn gia (Expert System) l mt chng trnh my tnh thng minh s dng tri thc (knowledge) v cc th tc suy lun (inference procedures) gii nhng bi ton tng i kh khn i hi nhng chuyn gia mi gii c - Mt h chuyn gia gm ba thnh phn chnh l c s tri thc (knowledge base), my suy din hay mt suy din (inference engine), v h thng giao tip vi ngi s dng (user interface). C s tri thc cha cc tri thc t , my suy din to ra cu tr li cho ngi s dng qua h thng giao tip. b.Cc c trng : C bn c trng c bn ca mt h chuyn gia :
-

Hiu qu cao (high performance). Kh nng tr li vi mc tinh thng bng hoc

cao hn so vi chuyn gia (ngi) trong cng lnh vc.

-

Thi gian tr li tho ng (adequate response time). Thi gian tr li hp l, bng

hoc nhanh hn so vi chuyn gia (ngi) i n cng mt quyt nh. H chuyn gia l mt h thng thi gian thc (real time system).
-

tin cy cao (good reliability). Khng th xy ra s c hoc gim st tin cy khi

s dng.
-

D hiu (understandable). H chuyn gia gii thch cc bc suy lun mt cch d hiu

v nht qun, khng ging nh cch tr li b n ca cc hp en (black box).

2. Cc cch biu din tri thc trong h chuyn gia ?

Tri thc ca mt h chuyn gia c th c biu din theo nhiu cch khc nhau. Thng thng ngi ta s dng cc cch sau y : Biu din tri thc bi cc lut sn xut Biu din tri thc nh mnh logic

Biu din tri thc nh mng ng ngha Biu din tri thc nh ngn ng nhn to

a. Biu din tri thc bi cc lut sn xut Lut l mt kiu sn xut c nghin cu t nhng nm 1940. Trong mt h thng da trn lut, cng c suy lun s xc nh nhng lut no l tin tha mn cc s vic. Cc lut sn xut thng c vit di dng IF THEN. C hai dng : IF < iu kin > THEN < hnh ng > hoc IF < iu kin > THEN < kt lun > DO < hnh ng > Phn gia IF v THEN l phn tri lut (LHS: Left - Hand -Side) Phn sau THEN l kt lun hay hu qu (consequent). Mt s h chuyn gia c them phn hnh ng (action) c gi l phn phi lut (RHS: Right Hand -Side). V d : Rule: n IF n sng .

THEN Dng Rule: n-xanh IF n xanh sng i

THEN

b. Biu din tri thc nh mnh logic Ngi ta s dng cc k hiu th hin tri thc v cc php ton lgic tc ng ln cc k hiu th hin suy lun lgic. K thut ch yu thng c s dng l lgic v t V d :

c. Biu din tri thc nh mng ng ngha Trong phng php ny, ngi ta s dng mt th gm cc nt (node) v cc cung (arc) ni cc nt biu din tri thc. Nt dng th hin cc i tng, thuc tnh ca i tng v gi tr ca thuc tnh. Cn cung dng th hin cc quan h gia cc i tng. Cc nt v cc cung u c gn nhn. V d

d. Biu din tri thc nh ngn ng nhn to Theo quan im ca ngi s dng, ngn ng t nhin s l phng cch thun tin nht giao tip vi mt h chuyn gia, khng nhng i vi ngi qun tr h thng (t cch chuyn gia), m cn i vi ngi s dng cui.

V d :

3. Cc k thut suy lun trong h chuyn gia ?

-

Suy din tin (foward chaining) Suy din li(backward chaining) Phn tch phng tin (means-end analysis) Rt gn vn (problemreduction) Quay lui (backtracking) Kim tra lp k hoch (plan-generate-test) Lp k hoch phn cp (hierachical planning)...

2 k thut thng gp : a.Suy din tin Suy din tin ( forward charning) l lp lun t cc s kin, s vic rt ra cc kt lun. Trong phng php ny, ngi s dng cung cp cc s kin cho h chuyn gia h thng (my suy din) tm cch rt ra cc kt lun c th. Kt lun c xem l nhng thuc tnh c th c gn gi tr. Cc s kin thng c dng : Atthibute = value V d : Nu thy tri ma trc khi ra khi nh (s kin) th phi ly o ma (kt lun).

b.Suy din li

Phng php suy din li tin hnh cc lp lun theo chiu ngc li (i vi phng php suy din tin). T mt gi thuyt (nh l mt kt lun), h thng a ra mt tnh hung tr li gm cc s kin l c s ca gi thuyt cho ny. V d : nu ai vo nh m cm o ma v o qun b t th gi thuyt ny l tri ma.

4. H chuyn gia m
Mt h m bao gm 5 thnh phnh c bn: -B m ho -C s tri thc bao gm : + b tham s + c s lut m -C ch suy din -B kh m Xy dng h m gm 5 bc c bn: - Bc 1: Xc nh bi ton, nh ngha cc bin ngn ng vo v ra, cng chnh l cc tn hiu vo/ra ca b iu khin - Bc 2: nh ngha cc tp m (gi tr ngn ng) cho tng bin vo/ra, tc l thc hin cng vic m ho - Bc 3: Xy dng cc lut m (lut hp thnh) - Bc 4: M ho cc tp m, lut m v th tc suy din m vo trong h chuyn gia - Bc 5: c lng, nh gi trn c s tinh chnh h thng. Trong qa trnh thit k, ta cn ch my im sau: 1. Khng nn thit k b iu khin m gii quyt mt bi ton tng hp m c th d dng thc hin bng cc b iu khin kinh in tho mn cc yu cu t ra 2. Khng nn thit k b iu khin m cho cc h thng cn an ton cao (iu khin l phn ng ht nhn, iu khn cc quy trnh cng ngh sn xut ho cht) 3. Do nguyn l lm vic ca b iu khin m l sao chp li kinh nghim iu khin ca chuyn gia nn lun phi ngh ti vic b sung thm cho b iu khin m cc kh nng t hc thch nghi c vi s thay i ca i tng.

5. My hc

Hc c nh ngha nh l bt c s thay i no trong mt h thng cho php n tin hnh tt hn trong ln th hai khi lp li cng mt nhim v hoc vi mt nhim v khc rt ra t cng mt qun th cc nhim v . My hc l mt lnh vc khoa hc ,c lin quan vi vic thit k v pht trin ca cc thut ton ,cho php cc my tnh thay i hnh vi da trn d liu. 3 Cch tip cn : Da vo k hiu ( Symbol based ) Tip cn kt ni Tip cn di truyn hay tin ha

3 Phng php hc :
-

Hc gim st : L phng php my hc , v suy din ra t CSDL .Cc d liu bao gm d liu u vo ( thng l vector ) v kt qu mong mun V d: Nhn dng ch vit tay, Nhn dng k t quang hc,

Hc khng gim st : L cch hc thng tin khng cn tp d liu hun luyn c gn nhn sn V d:K thut gom cm (Hierarchical clustering, K-means,)

Hc bn gim st : Kt hp c 2 cch trn l tp hun luyn c nh du sau hoc ch c nh du mt phn