1 / 38

Chapter 2 The Operation of Fuzzy Set

Chapter 2 The Operation of Fuzzy Set. 2.1 Standard operations of fuzzy set. Complement set Union A  B Intersection A  B difference between characteristics of crisp fuzzy set operator law of contradiction law of excluded middle. (1) Involution. (2) Commutativity. A  B = B  A

zubia
Download Presentation

Chapter 2 The Operation of Fuzzy Set

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 2The Operation of Fuzzy Set

  2. 2.1 Standard operations of fuzzy set • Complement set • Union A  B • Intersection AB • difference between characteristics of crisp fuzzy set operator • law of contradiction • law of excluded middle

  3. (1) Involution (2) Commutativity A  B = B  A A B = B A (3) Associativity (A  B) C = A  (B  C) (A  B) C = A  (B  C) (4) Distributivity A  (B  C) = (A  B)  (A  C) A  (B  C) = (A  B)  (A  C) (5) Idempotency A  A = A A  A = A (6) Absorption A  (A  B) = A A  (A  B) = A (7) Absorption by X and  A  X = X A =  (8) Identity A  = A A  X = A (9) De Morgan’s law (10) Equivalence formula (11) Symmetrical difference formula Table 2.1 Characteristics of standard fuzzy set operators

  4. 2.2 Fuzzy complement • 2.2.1 Requirements for complement function • Complement function C: [0,1]  [0,1] (Axiom C1) C(0) = 1, C(1) = 0 (boundary condition) (Axiom C2) a,b  [0,1] if a  b, then C(a)  C(b) (monotonic non-increasing) (Axiom C3) C is a continuous function. (Axiom C4) C is involutive. C(C(a)) = a for all a  [0,1]

  5. C(a) 1 C(a) = 1 - a a 1 2.2 Fuzzy complement • 2.2.2 Example of complement function(1) Fig 2.1 Standard complement set function

  6. 1 1 x x 1 1 2.2 Fuzzy complement • 2.2.2 Example of complement function(2) • standard complement set function

  7. C(a) 1 a t 1 2.2 Fuzzy complement • 2.2.2 Example of complement function(3) It does not hold C3 and C4

  8. 1.0 0.9 0.8 C(a) 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0.0 0.4 0.5 0.6 0.7 0.8 0.9 1.0 0.1 0.3 0.2 2.2 Fuzzy complement • 2.2.2 Example of complement function(4) • Continuous fuzzy complement function C(a) = 1/2(1+cosa)

  9. 1.0 0.9 0.8 Cw(a) 0.7 0.6 0.5 a 0.4 0.3 0.2 0.1 0.0 0.4 0.5 0.6 0.7 0.8 0.9 1.0 0.1 0.3 0.2 w=5 w=2 w=1 w=0.5 2.2 Fuzzy complement • 2.2.2 Example of complement function(5) • Yager complement function

  10. 2.2 Fuzzy complement • 2.2.3 Fuzzy Partition (1) (2) (3)

  11. 2.3 Fuzzy union • 2.3.1 Axioms for union function U : [0,1]  [0,1]  [0,1] AB(x) = U[A(x), B(x)] (Axiom U1) U(0,0) = 0, U(0,1) = 1, U(1,0) = 1, U(1,1) = 1 (Axiom U2) U(a,b) = U(b,a) (Commutativity) (Axiom U3) If a  a’ and b  b’, U(a, b)  U(a’, b’) Function U is a monotonic function. (Axiom U4) U(U(a, b), c) = U(a, U(b, c)) (Associativity) (Axiom U5) Function U is continuous. (Axiom U6) U(a, a) = a (idempotency)

  12. A B 1 1 X X AB 1 X 2.3 Fuzzy union • 2.3.2 Examples of union function U[A(x), B(x)] = Max[A(x), B(x)], or AB(x) = Max[A(x), B(x)] Fig 2.6 Visualization of standard union operation

  13. 2.3 Fuzzy union • Yager’s union function :holds all axioms except U6.

  14. 2.3.3 Other union operations 1) Probabilistic sum (Algebraic sum) • commutativity, associativity, identity and De Morgan’s law 2) Bounded sum AB (Bold union) • Commutativity, associativity, identity, and De Morgan’s Law • not idempotency, distributivity and absorption

  15.    2.3.3 Other union operations 3) Drastic sum A B 4) Hamacher’s sum AB

  16. 2.4 Fuzzy intersection • 2.4.1 Axioms for intersection function (Axiom I1) I(1, 1) = 1, I(1, 0) = 0, I(0, 1) = 0, I(0, 0) = 0 (Axiom I2) I(a, b) = I(b, a), Commutativity holds. (Axiom I3) If a  a’ and b  b’, I(a, b)  I(a’, b’), Function I is a monotonic function. (Axiom I4) I(I(a, b), c) = I(a, I(b, c)), Associativity holds. (Axiom I5) I is a continuous function (Axiom I6) I(a, a) = a, I is idempotency. I:[0,1]  [0,1]  [0,1]

  17. AB 1 X 2.4 Fuzzy intersection • 2.4.2 Examples of intersection • standard fuzzy intersection I[A(x), B(x)] = Min[A(x), B(x)], or AB(x) = Min[A(x), B(x)]

  18. 2.4 Fuzzy intersection • Yager intersection function

  19.    2.4.3 Other intersection operations 1) Algebraic product (Probabilistic product) xX, AB (x) = A(x) B(x) • commutativity, associativity, identity and De Morgan’s law 2) Bounded product (Bold intersection) • commutativity, associativity, identity, and De Morgan’s Law • not idempotency, distributivity and absorption

  20.    2.4.3 Other intersection operations 3) Drastic product A B 4) Hamacher’s product AB

  21. A B 2.5 Other operations in fuzzy set • 2.5.1 Disjunctive sum Fig 2.10 Disjunctive sum of two crisp sets

  22. 2.5 Other operations in fuzzy set • Simple disjunctive sum

  23. 2.5 Other operations in fuzzy set • Simple disjunctive sum(2) ex)

  24. 2.5 Other operations in fuzzy set • Simple disjunctive sum(3) Fig 2.11 Example of simple disjunctive sum

  25. 2.5 Other operations in fuzzy set • (Exclusive or) disjoint sum Fig 2.12 Example of disjoint sum (exclusive OR sum)

  26. 2.5 Other operations in fuzzy set • (Exclusive or) disjoint sum A = {(x1, 0.2), (x2, 0.7), (x3, 1), (x4, 0)} B = {(x1, 0.5), (x2, 0.3), (x3, 1), (x4, 0.1)} A△B = {(x1, 0.3), (x2, 0.4), (x3, 0), (x4, 0.1)} Fig 2.12 Example of disjoint sum (exclusive OR sum)

  27. A B 2.5 Other operations in fuzzy set • 2.5.2 Difference in fuzzy set • Difference in crisp set Fig 2.13 difference A – B

  28. 2.5 Other operations in fuzzy set • Simple difference • ex)

  29. Set A Set B 1 Simple difference A-B : shaded area A 0.7 B 0.5 0.7 0.3 0.2 0.2 0.1 x1 x3 x4 x2 2.5 Other operations in fuzzy set • Simple difference(2) Fig 2.14 simple difference A – B

  30. 1 0.7 0.5 0.3 0.2 0.1 x1 x3 x4 x2 Set A Set B Bounded difference : shaded area A B 0.4 2.5 Other operations in fuzzy set • Bounded difference AB(x) = Max[0, A(x) - B(x)] A  B = {(x1, 0), (x2, 0.4), (x3, 0), (x4, 0)} Fig 2.15 bounded difference A  B

  31. 2.5.3 Distance in fuzzy set • Hamming distance d(A, B) = • d(A, B)  0 • d(A, B) = d(B, A) • d(A, C)  d(A, B) + d(B, C) • d(A, A) = 0 ex) A = {(x1, 0.4), (x2, 0.8), (x3, 1), (x4, 0)} B = {(x1, 0.4), (x2, 0.3), (x3, 0), (x4, 0)} d(A, B) = |0| + |0.5| + |1| + |0| = 1.5

  32. A(x) B(x) 1 1 B A x x A(x) A(x) A B(x) B(x) A 1 1 B B x x difference A- B distance between A, B 2.5.3 Distance in fuzzy set • Hamming distance : distance and difference of fuzzy set

  33. 2.5.3 Distance in fuzzy set • Euclidean distance ex) • Minkowski distance

  34. 2.5.4 Cartesian product of fuzzy set • Power of fuzzy set • Cartesian product

  35.   2.6 t-norms and t-conorms 2.6.1 Definitions for t-norms and t-conorms • t-norm T : [0,1][0,1][0,1] x, y, x’, y’, z [0,1] • T(x, 0) = 0, T(x, 1) = x : boundary condition • T(x, y) = T(y, x) : commutativity • (x  x’, y  y’)  T(x, y)  T(x’, y’) : monotonicity • T(T(x, y), z) = T(x, T(y, z)) : associativity 1)intersection operator (  ) 2)algebraic product operator (  ) 3)bounded product operator ( ) 4) drastic product operator ( )

  36.  2.6 t-norms and t-conorms • t-conorm (s-norm) T : [0,1][0,1][0,1] x, y, x’, y’, z [0,1] • T(x, 0) = 0, T(x, 1) = 1 : boundary condition • T(x, y) = T(y, x) : commutativity • (x  x’, y  y’)  T(x, y)  T(x’, y’) : monotonicity • T(T(x, y), z) = T(x, T(y, z)) : associativity 1)union operator (  ) 2) algebraic sum operator ( ) 3) bounded sum operator (  ) 4) drastic sum operator ( ) 5) disjoint sum operator (  )

  37. 2.6 t-norms and t-conorms Ex) a)  : minimum Instead of *, if  is applied x  1 = x Since this operator meets the previous conditions, it is a t-norm. b)  : maximum If  is applied instead of *, x  0 = x then this becomes a t-conorm.

  38. 2.6 t-norms and t-conorms • 2.6.2 Duality of t-norms and t-conorms

More Related