Introduction to

Fuzzy Set Theory

:
Content
Fuzzy Sets
Set-Theoretic Operations
MF Formulation
Extension Principle
Fuzzy Relations
Linguistic Variables
Fuzzy Rules
Fuzzy Reasoning
Introduction to
Fuzzy Set Theory
Fuzzy Sets
Types of Uncertainty
Stochastic uncertainty
E.g., rolling a dice

Linguistic uncertainty
E.g., low price, tall people, young age

Informational uncertainty
E.g., credit worthiness, honesty
Crisp or Fuzzy Logic
Crisp Logic
A proposition can be true or false only.
Bob is a student (true)
Smoking is healthy (false)
The degree of truth is 0 or 1.
Fuzzy Logic
The degree of truth is between 0 and 1.
William is young (0.3 truth)
Ariel is smart (0.9 truth)
Crisp Sets
Classical sets are called crisp sets
either an element belongs to a set or not, i.e.,



Member Function of crisp set
x A e
or
x A e
0
( )
1
A
x A
x
x A

{ }
( ) 0,1
A
x e
P
Crisp Sets
P : the set of all people.
Y : the set of all young people.
Y
{ }
( ) 25, age Young y y x x P = = s e
1
y
( )
Young
y
25
Fuzzy Sets
Crisp sets { }
( ) 0,1
A
x e
( ) [0,1]
A
x e
1
y
( )
Young
y
Example
Fuzzy Sets
Lotfi A. Zadeh, The founder of fuzzy logic.
L. A. Zadeh, Fuzzy sets, Information and Control,
vol. 8, pp. 338-353, 1965.
Definition:
Fuzzy Sets and Membership Functions
If U is a collection of objects denoted generically
by x, then a fuzzy set A in U is defined as a set of
ordered pairs:
{ }
( , ( ))
A
A x x x U = e

membership
function
: [0,1]
A
U
U : universe of discourse.
Example (Discrete Universe)
{1, 2, 3, 4, 5, 6, 7,8} U =
# courses a student
may take in a semester.
(1, 0.1) (2, 0.3) (3, 0.8) (4,1)
(5, 0.9) (6, 0.5) (7, 0.2) (8, 0.1)
A

=
`
)
appropriate
# courses taken
0.5
1
0
2 4 6 8
x : # courses
( )
A
x
Example (Discrete Universe)
{1, 2, 3, 4, 5, 6, 7,8} U =
# courses a student
may take in a semester.
(1, 0.1) (2, 0.3) (3, 0.8) (4,1)
(5, 0.9) (6, 0.5) (7, 0.2) (8, 0.1)
A

=
`
)
appropriate
# courses taken
Alternative Representation:
1 2 3 4 0.1/ 0.3/ 0.8/ 1.0/ 0.9/ 0.5/ 0.2/ 0.1/ 5 6 7 8 A= + + + + + + +
Example (Continuous Universe)
possible ages U : the set of positive real numbers
{ }
( , ( ))
B
B x x x U = e
4
1
( )
50
1
5
B
x
x
=

| |
+
|
\ .
about 50 years old

0
0.2
0.4
0.6
0.8
1
1.2
0 20 40 60 80 100
x : age
( )
B
x
( )
4
50
5
1
1
x
R
B x

+ +
=
}
Alternative
Representation:
Alternative Notation
{ }
( , ( ))
A
A x x x U = e
U : discrete universe
U : continuous universe
( ) /
i
A i i
x U
A x x
e
=

( ) /
A
U
A x x =
}
Note that and integral signs stand for the union of
membership grades; / stands for a marker and does not imply
division.
M
e
m
b
e
r
s
h
i
p

v
a
l
u
e

height
1
0
Membership Functions (MFs)
A fuzzy set is completely characterized by
a membership function.
a subjective measure.
not a probability measure.
tall in Asia
tall in USA
tall in NBA
510
Fuzzy Partition
Fuzzy partitions formed by the linguistic
values young, middle aged, and old:
x
1
0
0.5
MF
MF Terminology
cross points
core
width
o
o-cut
support
More Terminologies
Normality
core non-empty
Fuzzy singleton
support one single point
Fuzzy numbers
fuzzy set on real line R that satisfies convexity and
normality
Symmetricity

Open left or right, closed
( ) ( ),
A A
c x c x x U + = e
lim ( ) 1, lim ( ) 0
A A
x x
x x
+
= =
Convexity of Fuzzy Sets
A fuzzy set A is convex if for any in [0, 1].
1 2 1 2
( (1 ) ) min( ( ), ( ))
A A A
x x x x + >
Introduction to
Fuzzy Set Theory
Set-Theoretic
Operations
Set-Theoretic Operations
Subset

Complement

Union

Intersection
( ) ( ),
A B
A B x x x U _ s e
( ) max( ( ), ( )) ( ) ( )
C A B A B
C A B x x x x x = = = v
( ) min( ( ), ( )) ( ) ( )
C A B A B
C A B x x x x x = = = .
( ) 1 ( )
A
A
A U A x x = =
Set-Theoretic Operations
A B c
A B
A
A B
Properties
A A =
Involution
A B B A =
Commutativity
A B B A =
( ) ( )
A B C A B C =
Associativity
( ) ( )
A B C A B C =
( ) ( ) ( )
A B C A B A C =
Distributivity
( ) ( ) ( )
A B C A B A C =
A A A =
Idempotence
A A A =
( )
A A B A =
Absorption
( )
A A B A =
A B A B =
De Morgans laws
A B A B =
Properties
The following properties are invalid for
fuzzy sets:
The laws of contradiction


The laws of excluded middle
A A = C
A A U =
Other Definitions for Set Operations
Union


Intersection
( )
( ) min 1, ( ) ( )
A B A B
x x x

= +
( ) ( ) ( )
A B A B
x x x

=
Other Definitions for Set Operations
Union


Intersection
( ) ( ) ( ) ( ) ( )
A B A B A B
x x x x x

= +
( ) ( ) ( )
A B A B
x x x

=
Generalized Union/Intersection
Generalized Intersection


Generalized Union
t-norm
t-conorm
T-Norm
:[0,1] [0,1] [0,1] T
Or called triangular norm.
1. Symmetry
2. Associativity
3. Monotonicity
4. Border Condition
( , ) ( , ) T x y T y x =
( ( , ), ) ( , ( , )) T T x y z T x T y z =
1 2 1 2 1 1 2 2
, ( , ) ( , ) x x y y T x y T x y s s s
( ,1) T x x =
T-Conorm
:[0,1] [0,1] [0,1] S
Or called s-norm.
1. Symmetry
2. Associativity
3. Monotonicity
4. Border Condition
( , ) ( , ) S x y S y x =
( ( , ), ) ( , ( , )) S S x y z S x S y z =
1 2 1 2 1 1 2 2
, ( , ) ( , ) x x y y S x y S x y s s s
( , 0) S x x =
Examples: T-Norm & T-Conorm
Minimum/Maximum:


Lukasiewicz:


Probabilistic:
( , ) min( , ) T a b a b a b = = .
( , ) max( , ) S a b a b a b = = v
( , ) max( 1, 0) ( , ) T a b a b LAND a b = + =
( , ) min( ,1) ( , ) S a b a b LOR a b = + =
( , ) ( , ) T a b ab PAND a b = =
( , ) ( , ) S a b a b ab POR a b = + =
Introduction to
Fuzzy Set Theory
MF Formulation
MF Formulation
Triangular MF

Trapezoidal MF

Gaussian MF

Generalized bell MF

( ; , , ) max min , , 0
x a c x
x a b c
b a c b
trimf
| |
| |
=
| |

\ .
\ .
( ; , , , ) max min ,1, , 0
x a d x
x a b c d
b a d c
trapmf
| |
| |
=
| |

\ .
\ .
2
1
( ; , , )
1
b
x a b c gbellmf
x c
b
=

+
2
1
2
( ; , , )
x c
gau x a b c e ssmf
o
| |

|
\ .
=
MF Formulation
Manipulating Parameter of the
Generalized Bell Function
2
1
( ; , , )
1
b
x a b c gbellmf
x c
a
=

+
Sigmoid MF
( )
1
( ; , )
1
a x c
sig x a
e
mf c

=
+
Extensions:
Abs. difference
of two sig. MF
Product
of two sig. MF
L-R MF
,
( ; , , )
,
L
R
c x
F x c
x c
x c
L
F x c
R
o
o |
|

| |
<
|
\ .

| |

>
|

\ .

Example:
2
( ) max(0,1 )
L
F x x =
( )
3
( ) exp
R
F x x =
c=65
o=60
|=10
c=25
o=10
|=40
Introduction to
Fuzzy Set Theory
Extension Principle
Functions Applied to Crisp Sets
x
y = f(x)
x

A
(x)
y

B
(y)
A
B
( ) B f A =
Functions Applied to Fuzzy Sets
x
y = f(x)
x

A
(x)
y

B
(y)
( ) B f A =
A
B
Functions Applied to Fuzzy Sets
x
y = f(x)
x

A
(x)
y

B
(y)
( ) B f A =
A
B
The Extension Principle
Assume a fuzzy set A and a function f.
How does the fuzzy set f(A) look like?
x
y = f(x)
x

A
(x)
y

B
(y)
A
B
( )
( ) ( )
B f A
y y =
1
( )
max ( )
A
x f y
x

=
=
1
( )
sup ( )
A
x f y
x

=
=
The Extension Principle
1
n
A
A
fuzzy sets
defined on
1
n
X
X
1
:
n
f X X V
The extension of f operating on A
1
, , A
n
gives a
fuzzy set F with membership function
( )
( )
1 1
1
1
, , ( )
( ) max min ( ), , ( )
n
n
F A A n
x x f v
v x x

=
=
( )
( )
1
1
1
1
, , ( )
sup min ( ), , ( )
n
n
A A n
x x f v
x x

=
=
Introduction to
Fuzzy Set Theory
Fuzzy Relations
A
a
1
a
2
a
3
a
4
B
b
1
b
2
b
3
b
4
b
5
Binary Relation (R)
R A B _
A
a
1
a
2
a
3
a
4
B
b
1
b
2
b
3
b
4
b
5
Binary Relation (R)
R A B _
1 1 1 3 2 5
3 1 3 4 4 2
( , ), ( , ), ( , )
( , ), ( , ), ( , )
a b a b a b
R
a b a b a b

=
`
)
1 0 1 0 0
0 0 0 0 1
1 0 0 1 0
0 1 0 0 0
R
M
(
(
(
=
(
(

1 1
a Rb
1 3
a Rb
2 5
a Rb
3 1
a Rb
3 4
a Rb
4 2
a Rb
The Real-Life Relation
x is close to y
x and y are numbers
x depends on y
x and y are events
x and y look alike
x and y are persons or objects
If x is large, then y is small
x is an observed reading and y is a
corresponding action
Fuzzy Relations
A fuzzy relation R is a 2D MF:
( )
{ }
( , , ( , ) ( , ) ) |
R
x y x y x y R X Y = e
Example (Approximate Equal)
( ) { }
( , , ( , ) ( , ) ) |
R
x y x y x y R X Y = e
{1, 2, 3, 4, 5} X Y U = = =
1 0.8 0.3 0 0
0.8 1 0.8 0.3 0
0.3 0.8 1 0.8 0.3
0 0.3 0.8 1 0.8
0 0 0.3 0.8 1
R
M
(
(
(
( =
(
(
(

1 0
0.8 1
( , )
0.3 2
0
R
u v
u v
u v
u v
otherwise

=

=

A fuzzy relation defined on X an Z.
Max-Min Composition
X Y Z
R: fuzzy relation defined on X and Y.
S: fuzzy relation defined on Y and Z.
RS: the composition of R and S.
( )
( , ) max min ( , ), ( , )
R S y R S
x z x y y z =
( )
( , ) ( , )
y R S
x y y z =v .
Example
1 0.1 0.2 0.0 1.0
2 0.3 0.3 0.0 0.2
3 0.8 0.9 1.0 0.4
R a b c d
0.9 0.0 0.3
0.2 1.0 0.8
0.8 0.0 0.7
0.4 0.2 0.3
S
a
b
c
d
o |
1 0.4 0.2 0.3
2 0.3 0.3 0.3
3 0.8 0.9 0.8
R S o |
0.1 0.2 0.0 1.0
0.9 0.2 0.8 0.4 min
0.1 0.2 0.0 0.4 max
( )
( , ) max min ( , ), ( , )
S R v R S
x y x v v y =
Max-Product Composition
( )
( , ) max ( , ) ( , )
R S y R S
x z x y y z =


A fuzzy relation defined on X an Z.
X Y Z
R: fuzzy relation defined on X and Y.
S: fuzzy relation defined on Y and Z.
RS: the composition of R and S.
Max-min composition is not mathematically
tractable, therefore other compositions such as
max-product composition have been suggested.
Projection
R
X
R R X ( = +

Y
R R Y ( = +

Dimension Reduction
Projection
R
X
R R X ( = +

Y
R R Y ( = +

R
X
R R X ( = +

Y
R R Y ( = +

X
R R X
(
= +

Y
R R Y
(
= +

max ( , ) /
R
X
y
x y x =
}
max ( , ) /
R
Y
x
x y y =
}
( ) max ( , )
Y
R R
x
y x y =
( ) max ( , )
X
R R
y
x x y =
Dimension Reduction
Cylindrical Extension
Dimension Expansion
A : a fuzzy set in X.
C(A) = [A|XY] : cylindrical extension of A.
( ) ( ) | ( , )
A
X Y
C A x x y

=
}
( )
( , ) ( )
C A A
x y x =
Introduction to
Fuzzy Set Theory
Linguistic Variables
Linguistic Variables
Linguistic variable is a variable whose
values are words or sentences in a natural
or artificial language.

Each linguistic variable may be assigned
one or more linguistic values, which are in
turn connected to a numeric value through
the mechanism of membership functions.
Motivation
Conventional techniques for system
analysis are intrinsically unsuited for
dealing with systems based on human
judgment, perception & emotion.
Example
if temperature is cold and oil is cheap
then heating is high
Example
if temperature is cold and oil is cheap
then heating is high
Linguistic
Variable








Linguistic
Variable
Linguistic
Variable




Linguistic
Value




Linguistic
Value








Linguistic
Value

cold

cheap

high



Definition [Zadeh 1973]
A linguistic variable is characterized by a quintuple
( )
, ( ), , , x T x U G M
Name
Term Set
Universe
Syntactic Rule
Semantic Rule
Example
A linguistic variable is characterized by a quintuple
( )
, ( ), , , x T x U G M
age
old, very old, not so old,
(age) more or less young,
quite young, very young
G


=
`

)
[0, 100]
( ) { }
old
(old) , ( ) [0,100] M u u u = e
1
2
old
0 [0, 50]
( )
50
1 [50,100]
5
u
u
u
u

= (

| |
+ e
(
|
\ .
(

Example semantic rule:

Example
Linguistic Variable : temperature
Linguistics Terms (Fuzzy Sets) : {cold, warm, hot}
(x)

cold

warm

hot

20
60
1
x
Introduction to
Fuzzy Set Theory
Fuzzy Rules
Classical Implication
A B
A B
A B
T
T
F
F
T
F
T
F
T
F
T
T
A B
A B
A B
T
T
F
F
T
F
T
F
T
F
T
T
A B
A B
1
1
0
0
1
0
1
0
1
0
1
1
A B
A B
1
1
0
0
1
0
1
0
1
0
1
1
Classical Implication
A B
A B
A B
A B
1
1
0
0
1
0
1
0
1
0
1
1
A B
A B
1
1
0
0
1
0
1
0
1
0
1
1
1 ( ) ( )
( , )
( ) otherwise
A B
A B
B
x y
x y
y

( )
( , ) max 1 ( ), ( )
A B A B
x y x x

=
Modus Ponens
A B If A then B
A A is true
B is true B
.
A B
A
B
. .
A B
A B
1
1
0
0
1
0
1
0
1
0
1
1
Fuzzy If-Than Rules
If x is A then y is B.



antecedent
or
premise




consequence
or
conclusion
A B

Examples
If x is A then y is B.

If pressure is high, then volume is small.
If the road is slippery, then driving is dangerous.
If a tomato is red, then it is ripe.
If the speed is high, then apply the brake a little.
A B
Fuzzy Rules as Relations
If x is A then y is B.

( ) ( )
, ,
R A B
x y x y

=


R
A fuzzy rule can be defined
as a binary relation with MF



Depends on how
to interpret A B
A B
Interpretations of A B
A
B
A entails B
x
x
y
A coupled with B
A
B
x
x
y
( ) ( )
, , ?
R A B
x y x y

= =
Interpretations of A B
A
B
A entails B
x
x
y
A coupled with B
A
B
x
x
y
( ) ( )
, , ?
R A B
x y x y

= =
R A B =
( )* ( ) /( , )
A B
X Y
x y x y

=
}
t-norm
A coupled with B (A and B)
Interpretations of A B
A
B
A entails B
x
x
y
A coupled with B
A
B
x
x
y
( ) ( )
, , ?
R A B
x y x y

= =
R A B =
( )* ( ) /( , )
A B
X Y
x y x y

=
}
A coupled with B (A and B)
E.g.,
( ) ( )
, min ( ), ( )
R A B
x y x y =
Interpretations of A B
A
B
A entails B
x
x
y
A coupled with B
A
B
x
x
y
( ) ( )
, , ?
R A B
x y x y

= =
A entails B (not A or B)
Material implication
Propositional calculus
Extended propositional calculus
Generalization of modus ponens
R A B A B =
( ) R A B A A B =
( ) R A B A B B =
1 ( ) ( )
( , )
( ) otherwise
A B
R
B
x y
x y
y

Interpretations of A B
( ) ( )
, , ?
R A B
x y x y

= =
A entails B (not A or B)
Material implication
Propositional calculus
Extended propositional calculus
Generalization of modus ponens
R A B A B =
( ) R A B A A B =
( ) R A B A B B =
1 ( ) ( )
( , )
( ) otherwise
A B
R
B
x y
x y
y

( )
( , ) max 1 ( ), ( )
R A B
x y x x =
( ) ( )
( , ) max 1 ( ), min ( ), ( )
R A A B
x y x x x =
( ) ( )
( , ) max 1 max ( ), ( ) , ( )
R A B B
x y x x x =
Introduction to
Fuzzy Set Theory
Fuzzy Reasoning
Generalized Modus Ponens
Single rule with single antecedent
Rule:
Fact:
Conclusion:
if x is A then y is B
x is A
y is B
Fuzzy Reasoning
Single Rule with Single Antecedent
Rule:
Fact:
Conclusion:
if x is A then y is B
x is A
y is B
( ) x
x
A
A
y
( ) y
B
Fuzzy Reasoning
Single Rule with Single Antecedent
Rule:
Fact:
Conclusion:
if x is A then y is B
x is A
y is B
( ) x
x
A
A
y
( ) y
B
( )
( ) max min ( ), ( , )
B x A R
y x x y
' '
=
( )
( ) ( , )
x A R
x x y
'
=v .
( , ) ( ) ( )
R A B
x y x y = .
( )
( ) ( ) ( )
x A A B
x x y
'
=v . .
( )
( ) ( ) ( )
x A A B
x x y
'
= v . . (

B
'
Firing
Strength


Firing Strength
Max-Min Composition
Fuzzy Reasoning
Single Rule with Single Antecedent
Rule:
Fact:
Conclusion:
if x is A then y is B
x is A
y is B
( ) x
x
A
A
y
( ) y
B
( )
( ) max min ( ), ( , )
B x A R
y x x y
' '
=
( )
( ) ( , )
x A R
x x y
'
=v .
( ) B A A B
' '
=
( , ) ( ) ( )
R A B
x y x y = .
( )
( ) ( ) ( )
x A A B
x x y
'
=v . .
( )
( ) ( ) ( )
x A A B
x x y
'
= v . . (

B
'
Max-Min Composition
Fuzzy Reasoning
Single Rule with Multiple Antecedents
Rule:
Fact:
Conclusion:
if x is A and y is B then z is C
x is A and y is B
z is C
Fuzzy Reasoning
Single Rule with Multiple Antecedents
Rule:
Fact:
Conclusion:
if x is A and y is B then z is C
x is A and y is B
z is C
( ) x
x
A
A
y
( ) y
B
B
z
( ) z
C
Fuzzy Reasoning
Single Rule with Multiple Antecedents
( ) x
x
A
A
y
( ) y
B
B
z
( ) z
C
Rule:
Fact:
Conclusion:
if x is A and y is B then z is C
x is A and y is B
z is C
( )
, ,
( ) max min ( , ), ( , , )
C x y A B R
y x y x y z
' ' '
=
R A B C =
( )
( , , ) ( , , )
R A B C
x y z x y z

=
( ) ( ) ( )
A B C
x y z = . .
( )
, ,
( , ) ( , , )
x y A B R
x y x y z
' '
= v .
( )
,
( ) ( ) ( ) ( ) ( )
x y A B A B C
x y x y z
' '
=v . . . .
( ) ( )
( ) ( ) ( ) ( ) ( )
x A A y B B C
x x y y z
' '
( = v . . v . . (


Firing Strength
C
'
Max-Min Composition
Fuzzy Reasoning
Single Rule with Multiple Antecedents
( ) x
x
A
A
y
( ) y
B
B
z
( ) z
C
Rule:
Fact:
Conclusion:
if x is A and y is B then z is C
x is A and y is B
z is C
( )
, ,
( ) max min ( , ), ( , , )
C x y A B R
y x y x y z
' ' '
=
R A B C =
( )
( , , ) ( , , )
R A B C
x y z x y z

=
( ) ( ) ( )
A B C
x y z = . .
( )
, ,
( , ) ( , , )
x y A B R
x y x y z
' '
= v .
( )
,
( ) ( ) ( ) ( ) ( )
x y A B A B C
x y x y z
' '
=v . . . .
( ) ( )
( ) ( ) ( ) ( ) ( )
x A A y B B C
x x y y z
' '
( = v . . v . . (


Firing Strength
C
'
( ) ( )
C A B A B C
' ' '
=
Max-Min Composition
Fuzzy Reasoning
Multiple Rules with Multiple Antecedents
Rule1:
Fact:
Conclusion:
if x is A
1
and y is B
1
then z is C
1
x is A and y is B
z is C
Rule2: if x is A
2
and y is B
2
then z is C
2
Fuzzy Reasoning
Multiple Rules with Multiple Antecedents
Rule1:
Fact:
Conclusion:
if x is A
1
and y is B
1
then z is C
1
x is A and y is B
z is C
Rule2: if x is A
2
and y is B
2
then z is C
2
( ) x
x
A
1
A
( ) z
z
C
1
( ) y
y
B
1
( ) x
x
A
2
( ) y
y
B
2
( ) z
z
C
2
A
B
B
Fuzzy Reasoning
Multiple Rules with Multiple Antecedents
Rule1:
Fact:
Conclusion:
if x is A
1
and y is B
1
then z is C
1
x is A and y is B
z is C
Rule2: if x is A
2
and y is B
2
then z is C
2
( ) x
x
A
1
A
( ) z
z
C
1
( ) y
y
B
1
( ) x
x
A
2
( ) y
y
B
2
( ) z
z
C
2
A
B
B
( ) z
z
M
a
x

1
C
'
2
C
'
1 2
C C C
' ' '
=
( ) ( )
1 2
C A B R R
' ' '
=
( ) ( )
1 2
A B R A B R
' ' ' '
= ( (

1 2
C C
' '
=
Max-Min Composition