Fuzzy Sets

Presentation by:
C. Vinoth Kumar
SSN College of Engineering
 Fuzzy Sets: Outline
• Introduction
• Basic definitions and terminology
• Set-theoretic operations
• MF formulation and parameterization
- MFs of one and two dimensions
- Derivatives of parameterized MFs
• More on fuzzy union, intersection, and complement
- Fuzzy complement
- Fuzzy intersection and union
- Parameterized T-norm and T-conorm
 Fuzzy Sets: Basic Concepts
• Fuzziness means vagueness.

• Fuzzy set theory is a mathematical tool to handle the

uncertainty arising due to vagueness.

Crisp Set:

• It is the traditional set called crisp set.

• In crisp set, an object either does or does not belong to

the set.

• It has a strict membership in which an object is either

completely included or excluded from the set.
 Fuzzy Sets: Basic Concepts

• Sets with fuzzy boundaries

A = Set of tall people

Crisp set A Fuzzy set A

1.0 1.0
.9
.5 Membership
function

5’10’’ Heights 5’10’’ 6’2’’ Heights

 Fuzzy Sets: Basic Concepts
Example of Crisp Sets:

• The set of numbers H from 6 to 8 is a crisp set.

• H = {6,7,8} = {x ϵ R | 6 ≤ x ≤ 8}

• H can be described by the membership function (MF)

1, 6 ≤ x ≤ 8
• μH (x) =
0, otherwise
 Fuzzy Sets: Basic Concepts
Fuzzy Set:

• It is a non traditional type of sets that allows an element

to have gradual (or partial) degrees of membership .

• Conversely with the traditional Boolean values of true

and false (i.e. 1 and 0 ), the membership degrees are
continuous values from 0 to 1.
 Fuzzy Sets: Basic Concepts
Example of Fuzzy Sets:

• The set F of real numbers close to 7.

• A MF for F should satisty the following properties:

1. Normality: μF (7)=1
2. Monotonicity: closer x to 7,close μF (x) to 1
3. Symmetry: numbers equally far left and right of 7
should have equal μF (x)
Fuzzy Sets: Basic Concepts
 Fuzzy Sets: Basic Concepts
Membership:

• The degree of inclusion to a set.

• Fuzzy sets have values between 0 and 1.

• The degree 0 means that the element has no

membership.

• The degree 1 means that the element has full

membership.
 Fuzzy Sets: Basic Concepts
Linguistic Variables:

• It is a scalar variable, such as temperature which has a

range, such as cold, cool, warm, and hot.

• Each of which is a fuzzy set defined over the same

domain.

• This domain is called universe of discourse of that

linguistic variable.
 Membership Functions (MFs)
• Characteristics of MFs:

– Subjective measures
– Not probability functions

MFs “tall” in Asia

.8
“tall” in the US
.5
.2 “tall” in NBA

5’10’’ Heights
 Fuzzy Sets

• Formal definition: A fuzzy set A in X is expressed as

a set of ordered pairs:

A = {( x , µ A ( x )) | x ∈ X }

Membership function Universe (or)

Fuzzy set
(MF) Universe of discourse

A fuzzy set is totally characterized by a

membership function (MF).
 Fuzzy Sets with Discrete Universes

• Fuzzy set C = “desirable city to live in”

X = {SF, Boston, LA} (discrete and non-ordered universe)
C = {(SF, 0.9), (Boston, 0.8), (LA, 0.6)}
• Fuzzy set A = “sensible number of children”
X = {0, 1, 2, 3, 4, 5, 6} (discrete and ordered universe)
A = {(0, .1), (1, .3), (2, .7), (3, 1), (4, .6), (5, .2), (6, .1)}
 Fuzzy Sets with Cont. Universes

• Fuzzy set B = “about 50 years old”

X = Set of positive real numbers (continuous)
B = {(x, μB(x)) | x in X}

1
µ B (x) = 4
 x − 50 
1+  
 10 
 Fuzzy sets

• The construction of a fuzzy set depends on two things:

(i) The identification of a suitable universe of

disclosure; and

(ii) The specification of an appropriate membership

function
 Alternative Notation

• A fuzzy set A can be alternatively denoted as follows:

X is discrete A= ∑µ
xi ∈X
A ( xi ) / xi

X is continuous A = ∫ µ A(x) / x
X

Note that summation and integration stands for the

union of membership grades; “/” stands for a marker
and does not imply division.
 Fuzzy Partition

• Fuzzy partitions formed by the linguistic values “young”,

“middle aged”, and “old”:
 More Definitions
1. Support: The support of a fuzzy set A is the set of all points
x in X such that µA(x) > 0:
Support(A) = {x | µA(x) > 0 }

2. Core: The core of a fuzzy set is the set of all points x in X

such that µA(x) = 1;
Core(A) = {x | µA(x) = 1}

3. Normality: A fuzzy set A is normal if its core is nonempty.

In other words, we can always find a point x ϵ X, such that
µA(x) = 1.

4. Crossover points: A crossover point of a fuzzy set a is a

point x ϵ X at which µA(x)=0.5.
Crossover(A) = {x | µA(x) = 0.5}
 More Definitions
5. Fuzzy singleton: A fuzzy set whose support is a single point in
X with µA(x)=1 is called a fuzzy singleton.

6. α-cut and strong α-cut: The α-cut or α-level set of a fuzzy set
A is a crisp set defined by
Aα = {x| µA(x) ≥ α} → core(A) = A1
The strong α-cut or strong α-level set are defined similarly:
Aα’ = {x| µA(x) > α} → support(A) = Ao’

7. Convexity: A fuzzy set A is convex if and only if for any x1, x2 ϵ

X and any λ ϵ [0,1],
µA(λx1 + (1- λ)x2) ≥ min{µA(x1), µA(x2)}

8. Fuzzy numbers: A fuzzy number A is a fuzzy set in the real

line (R) that satisfies the conditions for normality and convexity.
 More Definitions
9. Bandwidths of normal and convex fuzzy sets: For a
normal and convex fuzzy set, the bandwidth or width is
defined as the distance between the two unique crossover
points.
Width(A) = |x2 – x1|; where µA(x1) = µA(x2) = 0.5

10. Symmetry: A fuzzy set a is symmetric if its MF is

symmetric around a certain point x=c.
µA(c + x) = µA(c - x) for all x ϵ X

11. Open left, open right, closed: A fuzzy set A is

open left if limx→-∞µA(x) = 1 and limx→+∞µA(x) = 0
open right if limx→-∞µA(x) = 0 and limx→+∞µA(x) = 1
closed if limx→-∞µA(x) = limx→+∞µA(x) = 0
 More Definitions
MF

.5
α
0
Core X
Crossover points
α - cut
Support
 Set-Theoretic Operations

• Subset:
A ⊆ B ⇔ µA ≤ µB
• Complement:
A = X − A ⇔ µA ( x ) = 1 − µA ( x )
• Union:
C = A ∪ B ⇔ µc ( x ) = max( µA ( x ), µB ( x )) = µA ( x )∨ µB ( x )
• Intersection:
C = A ∩ B ⇔ µc ( x ) = min( µA ( x ), µB ( x )) = µA ( x ) ∧ µB ( x )
Set-Theoretic Operations
 Set-Theoretic Operations

• Cartesian Product: Let A and B be fuzzy sets in X

and Y, respectively. The Cartesian product of A and B,
denoted by A x B, is a fuzzy set in the product space
X*Y with the membership function,

µAxB(x,y) = min(µA(x), µB(y))

• Cartesian co-product: The Cartesian co-product A+B

is a fuzzy set with the membership function,

µA+B(x,y) = max(µA(x), µB(y))

MF Formulation – One Dimension Triangular MFs

• Triangular MF:
 x−a c−x 
triangle mf ( x ; a , b , c ) = max  min  ,  , 0 
  b − a c − b  
• Trapezoidal MF:
 x−a d −x 
trapezoid mf ( x ; a , b , c , d ) = max  min  ,1,  , 0 
  b − a d − c  
• Gaussian MF: 2
1  x−c 
−  
2 σ 
gaussian mf ( x; c,σ ) = e
• Generalized Bell MF:
1
bell mf ( x; a , b, c ) = 2b
x−c
1+
a
MF Formulation – One Dimension Triangular MFs
MF Formulation – One Dimension Sigmoid MFs
• Sigmoidal MF:
1
sig m f ( x ; a , b , c ) =
1 + e −a ( x −c )

where ‘a’ controls the slope at the crossover point x=c.

Abs. difference
of two sig. MF

Product of two
sig. MF
MF Formulation – One Dimension Sigmoid MFs

• Left-right (L-R) MF:  c − x

 L 
F  ,x < c

 α
LR ( x ;c ,α , β ) = 
 F  x − c  , x ≥ c
 R  β 

where FL(x) and FR(x) are monotonically decreasing

functions
3
Example: FL ( x ) = max( 0 , 1 − x 2 ) F R ( x ) = exp( − x )

c=65 c=25
a=60 a=10
b=10 b=40
MF Formulation – Two Dimension
Cylindrical Extension

Base set A Cylindrical Ext. of A

 2D MF Projection

Two-dimensional Projection Projection

MF onto X onto Y

µ R ( x, y ) µ A( x) = µB( y) =
max µ R ( x, y ) max µ R ( x, y )
y x
2D MFs
 Fuzzy Complement

• General requirements:
– Boundary: N(0)=1 and N(1) = 0
– Monotonicity: N(a) > N(b) if a < b
– Involution: N(N(a)) = a
• Two types of fuzzy complements:
– Sugeno’s complement:
1− a
N s (a) = s > −1
1 + sa
– Yager’s complement:
N w ( a ) = (1 − a w )1 / w w>0
 Fuzzy Complement

Sugeno’s complement Yager’s complement

1− a
N s (a ) = N w ( a ) = (1 − a w )1/ w
1 + sa
 Fuzzy Intersection: T-norm

• Basic requirements:
– Boundary: T(0, 0) = 0, T(a, 1) = T(1, a) = a
– Monotonicity: T(a, b) < T(c, d) if a < c and b < d
– Commutativity: T(a, b) = T(b, a)
– Associativity: T(a, T(b, c)) = T(T(a, b), c)
• Four examples:
– Minimum: Tm(a, b)
– Algebraic product: Ta(a, b)
– Bounded product: Tb(a, b)
– Drastic product: Td(a, b)
 T-norm Operator

Algebraic Bounded Drastic

Minimum: product: product: product:
Tm(a, b) Ta(a, b) Tb(a, b) Td(a, b)
 Fuzzy Union: T-conorm or S-norm

• Basic requirements:
– Boundary: S(1, 1) = 1, S(a, 0) = S(0, a) = a
– Monotonicity: S(a, b) < S(c, d) if a < c and b < d
– Commutativity: S(a, b) = S(b, a)
– Associativity: S(a, S(b, c)) = S(S(a, b), c)
• Four examples (page 38):
– Maximum: Sm(a, b)
– Algebraic sum: Sa(a, b)
– Bounded sum: Sb(a, b)
– Drastic sum: Sd(a, b)
 T-conorm or S-norm

Algebraic Bounded Drastic

Maximum: sum: sum: sum:
Sm(a, b) Sa(a, b) Sb(a, b) Sd(a, b)

tconorm.m
 Generalized DeMorgan’s Law

• T-norms and T-conorms are duals which support the

generalization of DeMorgan’s law:
– T(a, b) = N(S(N(a), N(b)))
– S(a, b) = N(T(N(a), N(b)))

Tm(a, b) Sm(a, b)

Ta(a, b) Sa(a, b)

Tb(a, b) Sb(a, b)

Td(a, b) Sd(a, b)
 Parameterized T-norm and S-norm

• Parameterized T-norms and dual T-conorms have been

proposed by several researchers:
– Yager
– Schweizer and Sklar
– Dubois and Prade
– Hamacher
– Frank
– Sugeno
– Dombi