Documente Academic
Documente Profesional
Documente Cultură
Principiul extensiei
Capitolul 3
Doru Todinca
Departamentul Calculatoare
UPT
Cuprins
Cuprins
Cuprins
Extensii ale MF
2. L-fuzzy sets: multimi fuzzy la care intervalul de numere reale
[0, 1] este extins la o multime L numita POS (partially
ordered set) -multime partial ordonata:
Operatii cu MF intuitionistice
Prezentam operatiile cu IFS dupa [Ata86], [DBR01]
B
iff ()x X are loc (x) (x) si (x) (x)
1. A
A
=B
iff A
B
si B
A.
2. A
=B
iff ()x X are loc (x) = (x) si
Echivalent A
A
B
A (x) = B (x)
= {(x, (x), (x))|x X }
3. A
A
A
B
= {(x, max{ (x), (x)}, min{ (x), (x)})|x X }
4. A
A
B
A
B
+B
=
6. A
{(x, A (x) + B (x) A (x) B (x), A (x) B (x))|x X }
B
= {(x, (x) (x), (x)+ (x) (x) (x))|x X }
7. A
A
Cuprins
in universul discursului
2. Puterea a m-a a unei mutlimi fuzzy A:
X este multimea fuzzy avind functia de apartenenta
A m (x) = [A (x)]m
, unde x X
3. Operatiile de intersectie si reuniune fuzzy sunt extinse de catre
t-norme si s-norme, numite si t-conorme.
t-norme: definitii
Definition
O t-norma este o functie de doua variabile t : [0, 1] [0, 1] [0, 1]
avind proprietatile:
1. t(0, 0) = 0,
t(1, A (x)) = t(A (x), 1) = A (x), () x X , adica
() A (x) [0, 1]
2. monotonie:
t(A (x), B (x)) t(C (x), D (x))
daca A (x) C (x) si B (x) D (x)
3. comutativitate:
t(A (x), B (x)) = t(B (x), A (x))
4. asociativitate:
t(A (x), t(B (x), C (x))) = t(t(A (x), B (x)), C (x))
s-norme: definitii
Definition
O s-norma (t-conorma) este o functie de doua variabile
s : [0, 1] [0, 1] [0, 1] avind proprietatile:
1. s(1, 1) = 1,
s(0, A (x)) = s(A (x), 0) = A (x), () x X , adica
() A (x) [0, 1]
2. monotonie:
s(A (x), B (x)) s(C (x), D (x))
daca A (x) C (x) si B (x) D (x)
3. comutativitate:
s(A (x), B (x)) = s(B (x), A (x))
4. asociativitate:
s(A (x), s(B (x), C (x))) = s(s(A (x), B (x)), C (x))
s-norme si t-norme
1 (x) 2 (x)
2 [1 (x) + 2 (x) 1 (x) 2 (x)]
1 (x) + 2 (x)
1 + 1 (x) 2 (x)
11 (x)2 (x)
1,
6. minim si maxim:
t3 (1 (x), 2 (x)) = min{1 (x), 2 (x)}
s3 (1 (x), 2 (x)) = max{1 (x), 2 (x)}
, daca 1 , 2 6= 1
daca 1 = 2 = 1
t-norme si s-norme
Intre operatorii prezentati exista urmatoarea ordonare:
tw t1 t1.5 t2 t2.5 t3
s3 s2.5 s2 s1.5 s1 sw
Mai general, Dubois si Prade au aratat ca orice t-norma este
marginita inferior de produsul drastic si superior de minim si orice
s-norma este marginita inferior de maxim si superior de suma
drastica.
Adica, pentru orice t-norma t si orice s-norma s au loc relatiile:
tw (A (x), B (x)) t(A (x), B (x)) min{A (x), B (x)}, x X
A (x) B (x)
, 0
+ (1 ) (A (x) + B (x) A (x) B (x))
A
(x) =
B
x X , [0, 1]
x X , [0, 1]
, x X,0 1
i =1
si B
printr-o
Se poate realiza agregarea a doua MF, A
combinatie convexa de minim si maxim:
1 (A(x)
, B (x)) =
Cuprins
Cuprins
Cuprins
Functii
DESEN !!!!
Functii
Cuprins
X o multime
Definitie: Fie X , Y , universuri ale discursului, A
fuzzy in X si fie o functie f : X Y astfel incit y = f (x).
Y,
Principiul extensiei permite definirea unei multimi fuzzy B
0,
in caz contrar
Explicatii
X si o functie f : X Y ,
Daca avem o multime fuzzy A
principiul extensiei ne spune cum se determina multimea fuzzy
Y care este imaginea multimii A
prin functia f . Apar
B
urmatoarele situatii:
B (x) =
sup
xf 1 (y )
0,
unde x = (x1 , x2 , . . . , xn )
daca () f 1 (y )
daca nu exista f 1 (y )
Explicatii
=A
1 A
2 . . . A
n
A1 , A2 , . . . , An , adica A
Cuprins
A = {(2, 0.3), (1, 0.5), (0, 0.8), (1, 1), (2, 0.7), (3, 0.1)} si fie
Z cu
functia f : Z Z, f (x) = x 2 . Se cere multimea fuzzy B
Raspuns:
= {(6, 0.2), (7, 0.2), (8, 1), (9, 0.5), (10, 0.5), (11, 0.1), (12, 0.1)}
B
9=1+8
9=2+7
9=3+6
9=4+5
Inlocuind in formula
B (y ) = supy =x1 +x2 {min(A 1 (x1 ), A 2 (x2 ))} obtinem:
B (9) =
sup9=x1 +x2 {min(A 1 (1), A 2 (8))), min(A 1 (2), A 2 (7))),
min(A 1 (3), A 2 (6))), min(A 1 (4), A 2 (5)))} =
sup{min(0.2, 0.1), min(1, 0.5), min(0.5, 1), min(0.1, 0.2)} =
sup(0.1, 0.5, 0.5, 0.1) = 0.5
Cuprins
Definition
Pentru multimile fuzzy de ordinul 2 definite anterior, functia de
apartenenta a reuniunii lor se defineste astfel:
A
B
(x) = A
(x) B
(x) =
= {(w , A
(w )) | w = max{ui , vj }, ui , vj [0, 1]}
B
unde
A
B
(w ) =
sup
w =max{ui ,vj }
Definition
sup
w =min{ui ,vj }
se defineste prin:
Complementul lui A
CA (x) = {[(1 ui ), A (ui )]}
Sa se calculeze A
B
(3)
ui
vj
w = min{ui , vj }
ui (3)
vj (3)
.8
.8
.8
.7
.7
.7
.6
.6
.6
1
.8
.7
1
.8
.7
1
.8
.7
.8
.8
.7
.7
.7
.7
.6
.6
.6
1
1
1
.5
.5
.5
.4
.4
.4
1
.5
.3
1
.5
.3
1
.5
.3
1
.5
.3
.5
.5
.3
.4
.4
.3
{1, .5} = 1
.8=min{ui ,vj }
sup
.7=min{ui ,vj }
sup
.6=min{ui ,vj }
si B
Krassimir T Atanassov.
Intuitionistic fuzzy sets.
Fuzzy sets and Systems, 20(1):8796, 1986.
Supriya Kumar De, Ranjit Biswas, and Akhil Ranjan Roy.
An application of intuitionistic fuzzy sets in medical diagnosis.
Fuzzy Sets and Systems, 117(2):209213, 2001.
H.-J. Zimmermann.
Fuzzy Set Theory and Its Applications, Second, Revised
Edition.
Kluwer Academic Publishers, 1991.