TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).

2010

M HNH C S D LIU HNG I TNG VI THNG TIN M V KHNG CHC CHN THEO HNG TIP CN I S GIA T
A MODEL OF OBJECT-ORIENTED DATABASES WITH FUZZY AND UNCERTAIN INFORMATION IN AN APPROACH TO HEDGE ALGBEBRAS on Vn Ban
Vin Cng ngh Thng tin

on Vn Thng
Trng C Hu Ngh CNTT Vit-Hn
TM TT

Trong bi bo ny, chng ti gii thiu mt cch tip cn i s gia t v ng ngha da trn quan h th t ca d liu ngn ng ca bin ngn ng cho vic nghin cu m hnh c s d liu hng i tng vi thng tin m v khng chc chn. Trong cch tip cn ny, gi tr tp m ca mi thuc tnh c biu din bi mt nhn ngn ng v ng ngha ca n c xc nh bi i s gia t trn min gi tr thuc tnh tng ng. Da trn c s cc i s gia t c th t tuyn tnh nh ngha c o m, ng ngha ca cc nhn ngn ng, tnh tng t v quan h i snh gia chng lm c s cho ngn ng truy vn d liu tr nn n gin v hiu qu. ABSTRACT In this paper, a hedge algebraic approach to a research model of object-oriented databases with fuzzy and uncertain information is presented. In the approach, the fuzzy value of each attribute is represented by a linguistic label and its meaning is determined by hedge algebras on domain attribute values, respectively. Based on the hedge algebra linear order defined by fuzzy measurement, the semantic elements of the linguistic labels, similarity and matching relations between them, which lay the foundation for the data query language have become simpler and more effective.

1. Gii thiu Trong nhng nm gn y, m hnh c s d liu hng i tng (CSDL HT) vi thng tin m v khng chc chn c nhiu tc gi trong v ngoi nc quan tm nghin cu v c nhng kt qu ng k nh George, Buckles v Petry 1993; Kornatzky v Shimony 1994; Rossazza, Duboi v Prade 1997; Van Gyseghem v De Caluwe 1997; Yazici v George 1999; Yazici, George v Aksoy 1999; Bordogna, Lucarella v Pari 1994, 1999; Baldwin v cng s 2000; Marin, Pons v Vila 2001; Eiter v cng s 2001; Biazzo v cng s 2002; Cao v Rossiter, 2003; Berzal v cng s 2005; da trn l thuyt xc sut, logic m, gi tr m kt hp vi quan h tng t. Tt c cc cch tip cn trn nhm mc ch nm bt v x l mt cch tha ng trn mt lun im no cc thng tin khng chnh xc (Unexact), khng chc chn (uncertainty) hay nhng thng tin khng y (Incomplete). Hu ht, cc cch tip cn ny ch xy dng phng php x l gi tr thuc tnh m khng (hoc cha) quan tm n x l phng thc ca lp i tng.
58

TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).2010

Nm 2006, Nguyn Ct H v cng s ngh mt m hnh trong gi tr tp m ca mi thuc tnh c biu din bi mt nhn ngn ng v ng ngha ca n c xc nh bi mt i s gia t (SGT). Trong m hnh ny, tc gi nh ngha o tnh m, ng ngha ca cc nhn ngn ng, tnh tng t v cc quan h i snh gia chng, lm c s cho mt ngn ng truy vn d liu m trn m hnh ny. V vy, mc d c nhiu kt qu nghin cu v CSDL HT vi thng tin m v khng chc chn theo nhiu hng tip cn khc nhau nhng cch tip cn nghin cu CSDL HT vi thng tin m v khng chc chn da trn SGT vn c th c xem l mt vn nghin cu mi. 2. i s gia t xy dng cch tip cn i s gia t, trong phn ny chng ti trnh by tng quan v mt s nt c bn ca i s gia t v kh nng biu th ng ngha da vo cu trc ca i s gia t [4]. Chng ta xt min ngn ng ca bin chn l TRUTH gm cc t sau: Dom(TRUTH) = {true, false, very true, very false, more-or-less true, more-or-less false, possibly true, possibly false, approximately true, approximately false, little true, little false, very possibly true, very possibly false.....}, trong true, false l cc t nguyn thu, cc t nhn (mordifier hay intensifier) very, more-or-less, possibly, approximately true, little gi l cc gia t (hedges). Khi min ngn ng T = dom(TRUTH) c th biu th nh mt i s X = ( X, C, H, ), trong C l tp cc t nguyn thu c xem l cc phn t sinh. H l tp cc gia t c xem nh l cc php ton mt ngi, quan h trn cc t (cc khi nim m) l quan h th t c "cm sinh" t ng ngha t nhin. V d da trn ng ngha, cc quan h th t sau l ng: false true, more true very true nhng very false more false, possibly true true nhng false possibly false, ... Tp X c sinh ra t C bi cc php tnh trong H. Nh vy, mi phn t ca X s c dng biu din x = hnhn-1.......h1x, x C. Tp tt c cc phn t c sinh ra t mt phn t x c k hiu l H(x). Nu C c ng hai t nguyn thu m, th mt c gi l phn t sinh dng k hiu l c+, mt gi l phn t sinh m k hiu l c- v ta c c- < c+. Trong v d trn True l dng cn False l m. Nh vy, cho X = ( X, G, H, ) vi G = { c, W, c+} , H = HH+, trong H+ = {h1,..., hp} v H- = {h-1, ..., h-q}, vi h1 < .. .< hp v h-1 < .. .< h-q, trong p, q >1 l dy cc gia t. nh ngha 2.1 [4]. f: X [0,1] gi l hm ng ngha nh lng ca X nu h, k H+ hoc h, k H-, v x, y X ta c:
f (hx) f ( x) f (kx) f ( x) = f (hy ) f ( y ) f (ky ) f ( y )

Vi i s gia t v hm nh lng ng ngha ta c th nh ngha tnh m ca

59

TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).2010

mt khi nim m. cho trc hm nh lng ng ngha f ca X, xt bt k x X. Tnh m ca x khi c o bng ng knh ca tp f(H(x)) [0,1]. nh ngha 2.2 [4]: Hm fm: X [0,1] c gi l o tnh m trn X nu tho mn cc iu kin sau: (1) fm l o m y trn X, tc l

q i p , i 0

fm(h u ) = fm(u )
i

(2) Nu x l khi nim r, tc l H(x) = {x} th fm(x) = 0. Do fm(0) = fm(W) = fm(1) = 0. (3) Vi x,y X, h H, ta c fm(hx) fm(hy ) = , ngha l t s ny khng fm( x) fm( y )

ph thuc vo x v y, c k hiu l (h) gi l o tnh m (fuzziness measure ) ca gia t h.

3. Hm nh lng ng ngha trn c s o tnh m ca gia t 3.1 nh ngha 2.3 [1] (Hm Sign)

Hm Sign: X {-1, 0, 1} l mt nh x c nh ngha mt cch qui nh sau, vi h,h'H: (1) Sign(c) = -1 v Sign(hc) = +Sign(c) nu hc < c Sign(hc) = - Sign(c) nu hc > c Sign(c+) = +1 v Sign(hc+) = +Sign(c+) nu hc+ > c+ Sign(hc+) = - Sign(c+) nu hc+ < c+ (2) Sign(hhx) = -Sign(hx) nu h' l negative i vi h v h'hx hx (3) Sign(hhx) = +Sign(hx) nu h' l positive i vi h v h'hx hx (4) Sign(hhx) = 0 nu h'hx = hx
3.2 nh ngha 2.4 [1] (Hm nh lng ng ngha )

Gi s cho trc o tnh m ca cc gia t (h), v cc gi tr o tnh m ca cc phn t sinh fm(c-), fm(c+) v w l phn t trung ha. Hm nh lng ng ngha (Quantitatively semantic function) ca X c xy dng nh sau vi x=him...hi2hi1c :

(c) =w-.fm(c-) v (c+) = w+.fm(c+)

(hjx)=(x)+Sign(hjx)
p 1 fm( hi x ) ( 1 Sign ( h j x )Sign ( h1 h j x )( )) fm( h j x ) 2 i = j

vi 1 jp, v

(hjx)=(x)+Sign(hjx)
60

TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).2010

j 1 fm ( hi x ) ( 1 Sign ( h j x )Sign ( h1 h j x )( )) fm ( h j x ) 2 i = p +1

vi j>p.

4. Quan h i snh trn min tr ca thuc tnh

V o tnh m ca cc t l mt khong ca on [0, 1] v h cc khong nh vy ca cc t c cng di s to thnh phn hoch ca [0, 1]. Phn hoch ng vi di t ln hn s mn hn v khi di ln v hn th di ca cc khong phn hoch gim dn v 0.
nh ngha 3.1 [4]: Gi fm l o tnh m trn i s gia t X, f: X -> [0, 1]. Vi mi x X, ta k hiu I(x) [0, 1] v |I(x)| l di ca I(x).

Mt h J = {I(x):xX} c gi l phn hoch ca [0, 1] nu: (1): {I(c+), I(c-)} l phn hoch ca [0, 1] sao cho |I(c)| = fm(c), vi c{c+, c-}. (2): Nu on I(x) c nh ngha v |I(x)| = fm(x) th {I(hix): I = 1...p+q} c nh ngha l phn hoch ca I(x) sao cho tho mn iu kin: |I(hix)| = fm(hix) v |I(hix)| l tp sp th t tuyn tnh. Tp {I(hix)} c gi l phn hoch gn vi phn t x. Ta c

I (h x) =
i =1 i

p+q

I ( x ) = fm ( x )

V d 3.1. Cho i s gia t AH=(X, C, H, ), Trong H=H+ H-.

H+={h1, h2}, h1 < h2 ; H-={h3, h4}, h3 > h4; C={ c+, c-} 1/2 h3c+ h4c+ c+
Hnh v 1

h1c+

h2c+

Khi ta c P1 ={I(c+)}v P2 ={I(h3c+), I(h4c+), I(h1c+), I(h2c+)} Gi s tc ng gia t h1 vo t h3c+ v h2c+ ta c 1/2 h1h3c+ h3c+ h4c+ c+
Hnh v 2

h1c+

h2c+ h1 h2c+

nh ngha 3.2 [4]: Cho Xk = {x X : x = k }, xt Pk = {I ( x) : x X k } l mt

phn hoch ca [0, 1]. Ta ni rng u xp x v theo mc k, c k hiu u k v, khi v ch khi u v v cng thuc mt khong trong Pk. C ngha u, v X,
u k v k P k : I (u ) k v I (v) k .

V d 3.2: theo v d 3.1

P1 l phn hoch ca [0, 1]. Ta c h1c+ 1 h2c+ v 1 = I (c + ) P1 m I (h1c + ) 1 v I (h2 c + ) 1

61

TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).2010

P2 l phn hoch ca [0, 1]. Ta c h2c+ 2 h1h2c+ v 2 = I (h2 c + ) P 2 m I (h2 c + ) 2 v I (h1h2 c + ) 2

nh ngha 3.3 [1]: Cho Xk = {x X : x = k }, xt Pk = {I ( x) : x X k } l mt

phn hoch ca [0, 1]. Ta ni rng u khng xp x v theo mc k, c k hiu u ! k v, khi v ch khi u v v khng cng thuc mt khong trong Pk. C ngha u, v X,
u ! k v k P k : I (u ) k v I (v) k .

nh ngha 3.4 [3] ( o ca hai gi tr xp x )

nh gi gn nhau ca hai gi tr trong cng mt khong ca phn hoch ta xy dng hm SP (Semantic Proximity) : Di x Di [0,1] nh sau: x, y Di:
1 ( x , y ) SP ( x , y ) = 0

Nu P(xy) Nu ngc li ( x v y c lp )

Trong (x,y) l hm khong cch ca x v y trong i s gia t Di v c xc nh (x,y)=|(x)-(y)|, l hm nh lng ng ngha.

Cc tnh cht ca o hai gi tr xp x SP

1. xDi ta c SP(x,x)=1 2. x,yDi ta c SP(x,y)=SP(y,x) 3. x,yDi ta c SP(x, x) SP(x, y)

Mnh 3.1

x,yDi ta c 0 SP(x,y) 1
Mnh 3.2

x,y, zDi, Nu xyz hoc x y z th SP(x,y) SP(x,z)

5. M hnh c s d liu hng i tng

M hnh CSDL HT, l chin lc t chc cc h thng nh l tuyn tp (Collection) cc i tng tng tc, phi hp vi nhau v d liu v cc hnh vi ng x. Trong , i tng l th hin mt i biu ca mt lp. Lp l mt m t v mt nhm cc i tng c nhng tnh cht ging nhau, c cng mi lin quan vi cc i tng khc v c chung ng ngha trong h thng. Theo cc thuc tnh th hin thng tin v trng thi ca i tng, cn cc phng thc c xem nh l nhng c tnh m t cc hnh vi ca chng. Thuc tnh v phng thc i tng l mt trong nhng khi nim trung tm ca m hnh CSDL HT.
5.1 Thuc tnh v gi tr thuc tnh ca i tng

Gi tr l mt phn ca d liu. Thuc tnh ca i tng (Object Attribute) l thuc tnh ca lp c m t bi gi tr ca mi i tng trong lp . Gi tr thuc tnh ca i tng c th l mt trong bn trng hp sau:
62

TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).2010

1. Gi tr chnh xc: Gi tr c th l cc gi tr ca cc kiu d liu nguyn thy nh cc kiu s hoc kiu xu k t, hoc l tp hp cc gi tr nguyn thy. Min gi tr trong trng hp ny chng ta c th d dng thao tc bng vic s dng cc php ton ( , , = ) trong biu thc iu kin ca cu hi truy vn; hoc

chng ta c th xy dng cc iu kin m thc hin truy vn d liu, v d cho bit tt c i tng nhn vin c thu nhp thp hn lng trung bnh
2. Gi tr khng chnh xc (hoc m): Trng hp vi gi tr khng chnh xc (hoc m) rt phc tp, thng th nhn ngn ng c s dng biu din cho nhng loi gi tr ny. Nhng kiu gi tr khng chnh xc phi c xem xt theo ng ngha ca cc gi tr khng chnh xc. Chng hn, mt thc vt c tn l hng ty, t thch hp cho n pht trin l mn nhng khng chc chn n cn mc nh sng l nh hay trung bnh, hoc chiu cao ca anh ta khong 2m, hoc khong [0, 35] biu din khi nim tr ca con ngi. 3. i tng: Trong trng hp ny gi tr thuc tnh c th tham chiu n mt i tng khc (i tng phc). i tng m n tham chiu n c th m. 4. Tuyn tp: Thuc tnh c th l tp cc gi tr hoc tp (set) cc i tng. S khng chnh xc ca cc thuc tnh ny c chia thnh 2 mc: a. Tp (set) c th m. b. Thnh vin ca tp c th l cc gi tr m hoc cc i tng m

V cc gi tr thuc tnh i tng l nhng gi tr khng chnh xc (hoc m) nn cc lp i tng cng tr nn m hoc khng chnh xc.
5.2 Phng thc

Trong m hnh CSDL HT lp c nh ngha nh l mt tp cc tnh cht gm cc thuc tnh v phng thc lp xc nh cc i tng ca lp ny, mi phng thc c biu din nh mt hm thao tc trn gi tr thuc tnh ca i tng. Mc khc, gi tr thuc tnh ca i tng l cc gi tr khng chnh xc (hoc m) (4.1) nn phng thc xc nh cc i tng lp ny cng tr nn m h v khng chc chn.
5.3 S tha k

S tha k l mt trong nhng khi nim trung tm ca m hnh CSDL HT. Tha k l c ch cho php mt lp c p dng cc tnh cht ca lp cha ca n, phn nh mt c trng vn c trong quan h gia cc i tng thc t. C ch k tha l mt u im ln ca m hnh hng i tng, bi khng ch phn nh bn cht ca cc quan h thc t m cn cho php ti u d liu v ti s dng m khi xy dng h thng. V do lp i tng khng chc chn v m h nn c ch k tha cng tr nn khng chc chn. Chng hn, khi m hnh ha v cc gi bu kin c vn chuyn bi cng ty vn ti th thi gian vn chuyn ca mi gi bu kin khng phi lun c xc nh mt cch chc chn. Tng t, kch thc ca mi gi (chiu di, rng, cao) cng nh din tch, th tch v do c cc ph vn chuyn cng khng phi c lun
63

TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).2010

c o v c tnh ton mt cch chc chn. V cc gi tr nh th c th l m v khng chc chn. Trong hnh di y chng ti trnh by mt v d n gin v s k tha ca cc lp gi bu kin trong m hnh . Bu kin If 0.5 Th 0.5 th_u tin
Hnh 3

If 0.5 Hp 0.7 0.3 Gi u tin 0.5 0.7 Gi thng thng 0.3 hp_thng thng

Cc lp con ca mt lp c lin kt vi mt nt If l loi tr ln nhau (ngha l mt i tng khng th thuc v hai lp ti cng mt thi im. Trong v d trn, lp bu kin c hai nhm lp con l {th, hp} v {gi u tin, gi thng thng}. Cc gi tr s trong khong [0, 1] trn cc cung lin kt gia mt lp vi lp con trc tip ca n biu din xc sut c iu kin mt i tng thuc lp cha l thuc lp con ca n. Chng hn, s phn cp ch ra rng mt i tng bt k ca gi bu kin c 70% kh nng thuc v gi thng thng trong khi ch c 30% thuc v gi u tin.
6. Nhn xt cch tip cn m hnh CSDL HT vi thng tin m v khng chc chn

Trong m hnh CSDL HT truyn thng cc mi quan h cng nh trng thi v hnh vi ca cc i tng lun lun c th hin mt cch chc chn v chnh xc. Tuy nhin, iu ny khng cn hon ton ng vi thc t v khi thao tc vi d liu thng tin v cc i tng khng chn chn, khng y m thng gi l thng tin m h. C nhiu hng tip cn khc nhau trong vic nghin cu m hnh CSDL HT vi thng tin m v khng chc chn theo cc hng chnh sau.
M hnh da trn quan h tng t [11][12]

Trong m hnh ny, cc nghin cu cho php gi tr thuc tnh i tng l mt tp cc gi tr m kt hp vi mt quan h tng t trn min gi tr thuc tnh ny (George, Buckles v Petry, 1993; Yazici v George, 1999a; Yazici v George, 1999b; Yazici, George v Aksoy 1999). V cc gi tr thuc tnh i tng l nhng tp m, nn cc lp i tng cng tr nn m. Trong m hnh ny, s phn loi v phn cp lp l m nn mc thnh vin lp ca cc i tng cng c m ha theo. tnh ton mc bao hm lp v mc thnh vin lp, cc o tng ng c
64

TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).2010

ngh. Tuy nhin, cc m hnh ny cha quan tm n cc phng thc ca i tng. Ngha l, chng khng biu din c cc hnh vi v thao tc ca cc i tng trong thc t. Ngoi ra, tha k khng chc chn cng cha c xem xt.
M hnh da trn th [5][6]

Bordogna, Lucarella v Pari (1994) ngh mt m hnh CSDL HT da trn th, trong gi tr thuc tnh c biu din bi cc phn b kh nng, bao hm cc lp con trong lp cha c biu din bi cc tp m. Mc thnh vin m ca cc i tng c xc nh thng qua mc bao hm lp v mc bao hm gi tr thuc tnh ca i tng trong min gi tr thuc tnh tng ng ca lp. Mt ngn ng truy vn i tng da trn cc o kh nng c ngh cho m hnh ny. Tuy nhin, trong m hnh ny cc phng thc lp cha c quan tm, kh nng p dng ca cc tnh cht lp l chc chn. Quan h k tha ch c xem xt gia lp con v lp cha trong khi a tha k khng c cp.
M hnh da trn logic m v l thuyt kh nng [9][10]

Trong m hnh ny, cc nhm tc gi (Rossazza, Duboi v Prade 1997; Van Gyseghem v De Caluwe 1997; Marin, Pons v Vila 2001; Berzal v cng s 2005a, 2005b) nh ngha lp nh mt tp thuc tnh m gi tr cng nh min gi tr ca thuc tnh c th l cc tp m. Bao hm v phn cp lp m c nh ngha trn c s logic m v l thuyt kh nng. Tuy nhin, tha k ch c xem xt khi quan h lp thc s l quan h lp cha lp con.
M hnh da trn l thuyt xc sut [7]

y l m hnh c nhm tc gi Kornatzky v Shimony xut nm 1994. Trong m hnh ny, lp c nh ngha nh mt tp cc thuc tnh m gi tr ca chng c th kt hp vi mt phn b xc sut. Lc c nh ngha nh mt tp cc lp c phn cp kt hp vi xc sut c iu kin mt i tng ca mt lp thuc v lp con ca n. Cc tc gi cng pht trin mt ngn ng truy vn thao tc chn cc i tng tha mt xc sut c kt hp vi cc truy vn. Tuy nhin, trong m hnh ny khng cho php gi tr thuc tnh m v cha quan tm n phng thc lp.
M hnh da trn c s logic [8]

Cao v Rossiter (2003) ngh mt m hnh CSDL HT xc sut m trn c s logic. Trong , lp c nh ngha bi mt tp tnh cht c din dch nh cc v t m kt hp vi mt khong xc sut biu din kh nng p dng khng chc chn ca chng i vi lp. Mi tnh cht i tng c th nhn mt gi tr tp m vi mt xc sut thuc v khong xc sut c suy dn t mc p dng ca n i vi i tng. Thao tc d liu c thc hin nh c ch suy lun trn cc s kin m trong Balwin, Martin v Pilsworth (1995).
M hnh da trn i s gia t [1][2][3][4]

Nh trnh by trn, cc hng tip cn cho m hnh CSDL HT vi thng tin

65

TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).2010

m v khng chc chn cng chng t c kh nng m hnh ha thng tin m, khng chnh xc v cc i tng thc t. Tuy nhin, trong cc m hnh xut cn rt nhiu hn ch. V l do , m hnh CSDL HT vi thng tin m v khng chc chn theo hng tip cn i s gia t c xut v tp trung nghin cu. Cc nghin cu tp trung vo cc vn sau: Bin din gi tr thuc tnh khng chc chn hoc khng chnh xc ca cc i tng. Biu din v thc thi cc phng thc lp. M hnh ha kh nng p dng khng chc chn ca thuc tnh v phng thc lp. M hnh ha cc quan h lp v nh ngha mc thnh vin khng chc chn ca cc i tng.

Theo hng tip cn ny, chng ti xem cc gi tr trn min ca thuc tnh i tng l mt cu trc SGT v cc gi tr ny c sinh ra t hai phn t dng v m trong SGT. Ngoi ra, chng ti xem mi phng thc c biu din nh mt hm thao tc trn cc gi tr tp m ca thuc tnh i tng. Trong m hnh ny, chng ti da trn tnh ton ln cn tng t, o ng ngha v cc quan h i snh ca chng a ra mt s php ton i s, tch hp nhiu i s gia t thc hin vic thao tc v truy vn d liu trn m hnh CSDL HDT vi thng tin m v khng chc chn [5]. Theo hng tip cn ny c cc u im: - Chuyn cc thao tc, truy vn trn cc kiu m thnh cc thao tc, truy vn trn tp c in thng qua tnh ton ln cn tng t, o ng ngha v cc quan h i snh ca chng. - Tp trung n lc vo vic la chn o tnh m ca cc gia t v chng tr thnh h tham s ca cch tip cn. - Vic t chc lu tr v thao tc d liu tr nn n gin, trc quan hn bi v khi ta c mt gi tr ngn ng c ngha l xc nh c mt on con ca [0, 1], khi tc ng cc gia t vo cc t s to ra mt phn hoch mn hn.
7. Kt lun

Trong bi bo, chng ti cp n vic nghin cu m hnh CSDL HT vi thng tin m v khng chc chn theo cch tip cn SGT. Trn m hnh ny, chng ti phn tch ng ngha ca cc php ton nh o tnh m, phn hoch da trn o tnh m, xp x theo phn hoch, bng nhau theo ngng. Chng ti nhn xt u im ca vic xy dng m hnh CSDL HT vi thng tin m v khng chc chn theo cch tip cn SGT. Chng ti xut cc phng php xy dng cc php ton cho vic x l gi tr thuc tnh i tng [5], i vi phng thc lp i tng v cc mi quan h trong m hnh CSDL HT vi thng tin m v khng chc chn s c chng ti trnh by trong cc bi bo tip theo.
66

TP CH KHOA HC V CNG NGH, I HC NNG - S 6(41).2010

TI LIU THAM KHO

[1] Nguyn Ct H. L thuyt tp m v cng ngh tnh ton mm. H m, mng noron v ng dng, NXB Khoa hc k thut 2001, 37-74.. [2] N.C. Ho, Quantifying Hedge Algebras and Interpolation Methods in Approximate Reasoning, Proc. of the 5th Inter. Conf. on Fuzzy Information Processing, Beijing, March 1-4 (2003), p105-112. [3] Nguyn Ct H, Trn Thi Sn, V khong cch gia cc gi tr ca bin ngn ng trong i s gia t, Tp ch tin hc v iu khin hc, T11 S1 (1995), 10-20.. [4] on Vn Thng, Truy vn d liu vi thng tin m v khng chc chn trong c s d liu hng i tng. Tp ch Khoa hc v Cng ngh, i hc Nng 2010, 15-24. [5] Bordogna G., Pasi G., and Lucarella D., A Fuzzy object-oriented data model managing vague and uncertain information, International Journal of Intelligent Systems 14 (1999), 623-651. [6] Bordogna G., Pasi G., and Lucarella D., A Fuzzy object-oriented data model, In Proceeding ot the 3rd IEEE International Conference on Fuzzy Systems, NewYork, USA 1994, 1, 313-318. [7] Biazzo, V., Giugno R, Lukasiewiez T., Subrahmanian, V.S. Temporal probabillistic object bases. IEEE Transaction on Knowledge and Engineering, 2002, 15, 921-939. [8] Baldwin, J.F., Cao, T.H, Martin, T.P., Rossiter J.M. Toward soft computing objectoriented logic programming. In Proceedings og the 8th International conference on Fuzzy Systems, San Antonio, USA, 2000, 768-773. [9] Berzal, F., Martin N., Pons O., Vila M.A. A framework to biuld fuzzy objectoriented capabilities over an existing database system. In Ma, Z. (E.d): Advances in Fuzzy Object-Oriented Database: Modeling and Application. Ide Group Publishing, 2005a,117-205. [10] De Tre, G., De Caluwe, R. A constraint based fuzzy object-oriented database model. In Ma, Z. (E.d): Advances in Fuzzy Object-Oriented Database: Modeling and Application. Ide Group Publishing, 2005,1-45. [11] George, R., Buckles, B.P., and Petry, F.E. Modelling class hierarchies in the fuzzy object-oriented data model. International Journal of Fuzzy Sets and Systems, 1993, 60, 259-272. [12] Yazici, A., and George, R. Logical database models for uncertain data: Fuzzy database modelling. Studies in Fuzziness and Soft Computing, Physica-Verlag, 1999b, 26, 113-210.
67