Professional Documents
Culture Documents
06 Fuzzy Set Theory PDF
06 Fuzzy Set Theory PDF
.in
rs
de
ea
yr
ab
or
ty
,w
.m
Fuzzy Set Theory : Soft Computing Course Lecture 29 34, notes, slides
ha
kr
www.myreaders.info
Return to Website
crisp
and
non-crisp
Sets
representation,
capturing
sets - small,
union,
intersection,
difference;
Fuzzy
properties
of
contradiction,
and
cartesian
product.
Fuzzy
relations
projections of fuzzy
fo
.in
rs
de
ea
,w
.m
yr
ab
or
ty
Soft Computing
ha
kr
Topics
29, 30, 31, 32, 33, 34
6 hours)
Slides
(Lectures
03-10
What is
and
2. Fuzzy set
Idempotence,
properties
Commutativity,
Distributivity,
Law
of
Associativity;
excluded
middle,
Additional
Law
of
3. Fuzzy Relations
Fuzzy
Relations
Membership
matrix,
Graphical
form;
42
fo
.in
rs
de
ea
yr
ha
kr
ab
or
ty
,w
.m
Fuzzy sets
have
been
introduced
Classical set theory allows the membership of the elements in the set
in binary terms, a bivalent condition - an element either belongs or
does not belong to the set.
Fuzzy set theory permits the gradual assessment of the membership
of elements in a set, described with
Example:
Words like young, tall, good, or high are fuzzy.
There is no single quantitative value which defines the term young.
For some people, age 25 is young, and for others, age 35 is young.
The concept young has no clean boundary.
Age 1 is definitely young and age 100 is definitely not young;
Age 35
fo
.in
rs
de
ea
or
ty
,w
.m
yr
1. Introduction
In real world, there exists much fuzzy knowledge;
kr
ab
Knowledge
that
is
vague,
imprecise,
uncertain,
ambiguous,
inexact,
or
ha
probabilistic in nature.
Human
thinking
originating
from
and
reasoning
inherently
frequently
inexact
human
involve fuzzy
concepts.
information,
Humans,
can
give
our
systems
most systems
are
are
designed
based
upon
classical
set theory
and
have
been
fo
.in
rs
de
ea
or
ty
,w
.m
yr
ha
kr
ab
particular
element
having
certain
describing
property
whether a
belongs
to
that
particular set.
Classical set
theory
enumerates
A = { a 1 , a2 , a3 , a4 , . . . . a n }
If the elements ai (i = 1, 2, 3, . . . n) of a set A are subset of
universal set X,
elements
set
is
well
x X
if
otherwise
described
by
function
called
characteristic
function.
This function, defined on the universal space X, assumes :
a value of 1 for those elements x that belong to set A,
and
Eq.(1)
if
otherwise
Eq.(2)
fo
.in
rs
de
ea
or
ty
,w
.m
yr
set
kr
ab
elements
theory
have
is
varying
an
extension
degrees
of
of
classical
membership.
set
A
theory
logic
where
based on
ha
the two truth values, True and False, is sometimes inadequate when
describing human reasoning. Fuzzy logic uses the whole interval between
0 (false) and 1 (true) to describe human reasoning.
A Fuzzy Set is any set that allows its members to have different
fo
.in
rs
de
ea
or
ty
,w
.m
yr
the
characteristic function
ha
kr
ab
function
A(x) of
of
Eq.(2)
is called
membership function.
fo
.in
rs
de
ea
or
ty
,w
.m
yr
kr
ab
ha
Not Tall
Tall
1.8 m
Height x
Crisp logic
Not Tall
Tall
1.8 m
Height x
Non-crisp logic
A student of height 1.79m would belong to both tall and not tall sets
with a particular degree of membership.
As the height increases the membership grade within the tall set would
increase whilst the membership grade within the not-tall set would
decrease.
08
fo
.in
rs
de
ea
or
ty
,w
.m
yr
Capturing Uncertainty
Instead of avoiding or ignoring uncertainty, Lotfi Zadeh introduced Fuzzy
ha
kr
ab
This
membership
function
associates
to
of A.
each element x X
: [0, 1]
Each membership function maps elements of a given universal base
1
0.5
c (x)
F (x)
Crisp Sets
Fuzzy Sets
fo
.in
rs
de
ea
ab
or
ty
,w
.m
yr
ha
kr
If we consider space X
fo
.in
rs
de
ea
or
ty
,w
.m
yr
2. Fuzzy Set
A Fuzzy Set is any set that allows its members to have different degree
ha
kr
ab
is a function defined
x in the set X
SMALL(2) = 1,
{9, 0 }, {10, 0 },
{11, 0},
{12, 0}}
fo
.in
rs
de
ea
or
ty
,w
.m
yr
ha
kr
ab
defined only on the integers. Now, the universal space for fuzzy sets
the
This gives the user more flexibility in choosing the universal space.
Example : The fuzzy set of numbers, defined in the universal space
X = { xi } = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}
is presented as
fo
.in
rs
de
ea
or
ty
,w
.m
yr
ha
kr
ab
x in the set X
The
value
A(x)
is
the
degree of membership
of
the
element
in a fuzzy set A.
The Graphic Interpretation of fuzzy membership for the fuzzy sets :
Small,
Prime
Numbers,
Universal-space,
Finite
and
Infinite
fo
.in
rs
de
ea
or
ty
,w
.m
yr
kr
ab
is presented as
ha
{8, 0.1},
{9, 0 }, {10, 0 },
{11, 0},
{12, 0}}
1
.8
.6
.4
.2
0
10
11
12
fo
.in
rs
de
ea
PRIME Numbers
or
ty
,w
.m
yr
kr
ab
is presented as
ha
1
.8
.6
.4
.2
0
10
11
12
fo
.in
rs
de
ea
UNIVERSALSPACE
or
ty
,w
.m
yr
In any application of sets or fuzzy sets theory, all sets are subsets of
kr
ab
ha
in
the
universal
{8, 1}, {9, 1}, {10, 1}, {11, 1}, {12, 1}}
1
.8
.6
.4
.2
0
10
11
12
fo
.in
rs
de
ea
or
ty
,w
.m
yr
kr
ab
ha
elements, that is, if in counting the different elements of the set, the
N is finite.
2. Let
M = {1, 3, 5, 7, 9, ...}.
M is infinite.
3. Let
L = {u | u is a lake in a city }.
L is finite.
fo
.in
rs
de
ea
EMPTY
or
ty
,w
.m
yr
kr
ab
membership equal to 0.
ha
in
the
universal space
is presented as
10
11
12
fo
.in
rs
de
ea
or
ty
,w
.m
yr
ha
kr
ab
Complement,
Union,
Intersection,
and
Difference.
the
following
fuzzy set terms and the Fuzzy Logic operations are illustrated:
19
Inclusion :
Equality :
Complement :
Union :
Intersection :
standard
fo
.in
rs
de
ea
ty
,w
.m
yr
Inclusion
Let A and B be fuzzy sets defined in the same universal space X.
kr
ab
or
The fuzzy set A is included in the fuzzy set B if and only if for every x in
ha
Example :
in
the
universal
{8, 0.1},
{9, 0 }, {10, 0 },
{11, 0},
{12, 0}}
{8, 0 },
{9, 0 }, {10, 0 },
{11, 0},
{12, 0}}
Inclusion
Membership Grade
1
.8
.6
.4
.2
0
10
11
12
fo
.in
rs
de
ea
ty
,w
.m
yr
Comparability
Two fuzzy sets A and B are comparable
kr
ab
or
ha
if one of the fuzzy sets is a subset of the other set, they are comparable.
Two fuzzy sets A and B are incomparable
If the condition A B or B A holds.
Example 1:
Let
and
a subset of B.
Example 2 :
Let
fo
.in
rs
de
ea
or
ty
,w
.m
yr
Equality
Let
kr
ab
Then A
and
and B
ha
A(x) = B(x).
Example.
{8, 0.1},
{9, 0 }, {10, 0 },
{11, 0},
{12, 0}}
Membership Grade
1
.8
.6
.4
.2
0
10
11
12
Note : If equality A(x) = B(x) is not satisfied even for one element x in
the set X, then we say that A is not equal to B.
22
fo
.in
rs
de
ea
or
ty
,w
.m
yr
Complement
Let A be a fuzzy set defined in the space X.
ha
kr
ab
Then the fuzzy set B is a complement of the fuzzy set A, if and only if,
B(x) = 1 - A(x).
Ac(x) = 1 A(x)
Example 1.
{8, 0.1},
{9, 0 }, {10, 0 },
{11, 0},
{12, 0}}
Membership Grade
Ac
1
.8
.6
.4
.2
0
10
11
12
fo
.in
rs
de
ea
yr
.m
w
w
,w
ty
Example 2.
and
the
universal set X,
ab
or
ha
kr
' = X
{8, 0},
{9, 0 }, {10, 0 },
{11, 0},
{12, 0}}
{8, 1},
{9, 1 }, {10, 1 },
{11, 1},
{12, 1}}
Membership Grade
1
.8
.6
.4
.2
0
10
11
12
fo
.in
rs
de
ea
ty
,w
.m
yr
Union
Let A and B be fuzzy sets defined in the space X.
kr
ab
or
The union is defined as the smallest fuzzy set that contains both A and B.
ha
for
x X
all
and
B(x) = 0.4
= 0.6
{8, 0.1},
{9, 0 }, {10, 0 },
{11, 0},
{12, 0}}
{12, 0}}
Union
Membership Grade
1
.8
.6
.4
.2
0
10
11
12
The notion of the union is closely related to that of the connective "or".
Let A is a class of "Young" men, B is a class of "Bald" men.
If "David is Young" or "David is Bald," then David is associated with the
union of A and B.
25
fo
.in
rs
de
ea
or
ty
,w
.m
yr
Intersection
Let A and B be fuzzy sets defined in the space X. Intersection is defined
ha
kr
ab
as the greatest fuzzy set that include both A and B. Intersection of A and
B is denoted by A B.
intersection operation :
for all x in the set X,
for
all
x X
and
B(x) = 0.4
= 0.4
{8, 0.1},
{9, 0 }, {10, 0 },
{11, 0},
{12, 0}}
{12, 0}}
Membership Grade
1
.8
.6
.4
.2
0
10
11
12
fo
.in
rs
de
ea
or
ty
,w
.m
yr
Difference
Let A and B be fuzzy sets defined in the space X.
ha
kr
ab
x X
all
{12, 0}}
Fuzzy Complement :
{12, 0}}
Bc(x) = 1 B(x)
{8, 0.9},
{9, 1 }, {10, 1 },
{11, 1},
{12, 1}}
Membership Grade
1
.8
.6
.4
.2
0
10
11
12
fo
.in
rs
de
ea
ab
or
ty
,w
.m
yr
ha
kr
A =A
input
output = True
AX=X
input
output = True
Idempotence :
AA=A
input
output = True
Commutativity :
AB =BA
input
output = True
28
fo
.in
rs
de
ea
yr
.m
w
w
,w
ty
kr
ab
or
A (B C) = (A B) C
ha
output = True
Fuzzy Set Small , Medium , Big
Small
= FuzzySet {{1, 1 }, {2, 1 }, {3, 0.9}, {4, 0.6}, {5, 0.4}, {6, 0.3},
{7, 0.2}, {8, 0.1}, {9, 0.7 }, {10, 0.4 }, {11, 0}, {12, 0}}
Medium = FuzzySet {{1, 0 }, {2, 0 }, {3, 0}, {4, 0.2}, {5, 0.5}, {6, 0.8},
{7, 1},
Big
{8, 1},
{9, 0 }, {10, 0 },
{11, 0.1},
{12, 0}}
fo
.in
rs
de
ea
ab
or
ty
,w
.m
yr
ha
kr
A =
input
output = True
Identity :
A X=A
input
output = True
Idempotence :
A A=A
input
output = True
Commutativity :
A B=B A
input
output = True
Associativity :
A (B C) = (A B) C
input = Equality [Small (Medium Big), (Small Medium) Big]
output = True
30
fo
.in
rs
de
ea
ab
or
ty
,w
.m
yr
Additional Properties
ha
kr
Distributivity:
A (B C) = (A B) (A C)
input = Equality [Small (Medium Big) ,
(Small Medium) (Small Big)]
output = True
Distributivity:
A (B C) = (A B) (A C)
input = Equality [Small (Medium Big) ,
(Small Medium) (Small Big)]
output = True
Law of excluded middle :
A A' = X
input = Equality [Small NotSmall , UnivrsalSpace ]
output = True
Law of contradiction
A A' =
input = Equality [Small NotSmall , EmptySpace ]
output = True
31
fo
.in
rs
de
ea
or
ty
,w
.m
yr
ha
kr
ab
Let A and B be two crisp sets in the universe of discourse X and Y..
A x B = { (a , b) a A , b B }
Note : Generally
AxB BxA
Graphic representation of A x B
Example :
then A x B = { (a , 1) , (a , 2) ,
(b , 1) , (b , 2) ,
(c , 1) , (c , 2) }
A
a
A x B (x , y) =
for all
A (x) B (y)
and y
in
fo
.in
rs
de
ea
or
ty
,w
.m
yr
3. Fuzzy Relations
Fuzzy Relations describe the degree of association of the elements;
ha
kr
ab
Fuzzy relations offer the capability to capture the uncertainty and vagueness
terms
of
Later the
properties of fuzzy relations and operations that can be performed with fuzzy
relations are illustrated.
33
fo
.in
rs
de
ea
or
ty
,w
.m
yr
is
generalization
of
the
definition
of
fuzzy
set
ha
kr
ab
A, y
B}
in A x B
real
number
in
the
interval [0 , 1].
The degree of membership indicates
relation to y.
Note :
Definition of fuzzy relation is a generalization of the definition of fuzzy
set from the 2-D space (x , , R (x)) to 3-D space ((x , y) , R (x , y)).
Cartesian product A x B is a relation by itself between x and y .
A fuzzy relation R is a sub set of R3 namely
fo
.in
rs
de
ea
.m
yr
or
ty
,w
kr
ab
ha
y1
Y2
Y3
x
x1
X2
X3
0.1 0.2
0.6 0.2
where symbol
and
R (x3 , y1) = 1
in 3-D space
(X, Y, ) as :
1
.8
.6
.4
.2
1
2
matrix
are
fo
.in
rs
de
ea
or
ty
,w
.m
yr
kr
ab
ha
The first item is a list containing element and membership grade pairs,
{{v1, w1}, R11}, {{ v1, w2}, R12}, ... , {{ vn, wm}, Rnm}}.
where { v1, w1}, { v1, w2}, ... , { vn, wm} are the elements of the relation
are defined as ordered pairs, and { R11 , R12 , ... , Rnm} are the membership
grades of the elements of the relation that range from 0 to 1, inclusive.
The second item is the universal space; for relations, the universal space
This relation can be represented in the following two forms shown below
Membership matrix form
Graph form
.8
v
v1
w w1
w2
w3
.6
w4
.4
0.2 0.7 0
v2
0.7 1
v3
.2
0.4 0.8
4w
1
2
3
Vertical lines represent membership grades
Elements of fuzzy relation are ordered pairs {vi , wj}, where vi is first and
wj is second element. The membership grades of the elements are
represented by the heights of the vertical lines.
36
fo
.in
rs
de
ea
.m
yr
or
ty
,w
kr
ab
ha
and
the total
projections
of
fuzzy
First Projection of R :
R
(1)
= {(x) ,
R(1) (x , y))}
= {(x) , max
Y
R (x , y))
Second Projection of R :
R
(2)
= {(y) ,
= {(y) ,
defined as
(T)
AxB}
defined as
R(2) (x , y))}
max
X
R (x , y))
Total Projection of R :
R
| (x , y)
max max
X
Y
| (x , y)
AxB}
defined as
{ R (x , y) | (x , y)
AxB}
max
X
fo
.in
rs
de
ea
or
ty
,w
.m
yr
kr
ab
y3
y4
Y5
0.1
0.3
0.5
0.3
x2
0.2
0.5
0.7
0.9
0.6
0.9
x3
0.3
0.6
0.8
0.2
0.3
0.6
0.9
0.6
ha
C
C
(1)
y1
x
x1
(2)
R(T)
Note :
For R
(1)
For R(2) select max means max with respect to x while y is considered fixed
x
For R(T)
R(1)
1
.8
.8
.6
.6
.4
.4
.2
1
.2
R(2)
1
(1)
(2)
fo
.in
rs
de
ea
or
ty
,w
.m
yr
ha
kr
ab
yB,
zC.
= { ((y , y) , R1 (y , z)) | (y , z) B x C }
The domain of R1
is A x B
Max-Min Composition
Definition : The Max-Min composition denoted by R1 R2 with membership
function R1 R2 defined as
R1 R2 = { ((x , z) ,
max(min
Y
(R1 (x , y) , R2 (y , z))))} ,
(x , z)
AxC,
fo
.in
rs
de
ea
ab
or
ty
,w
.m
yr
ha
kr
R1
x
x1
y1
y2
y3
0.1
0.3
x2
0.8
0.3
R2
y
y1
z1
z2
z3
0.8
0.2
y2
0.2
0.6
y3
0.5
0.4
Note : Number of columns in the first table and second table are equal.
Compute max-min composition denoted by R1 R2 :
Step -1
Consider row x1 and column z1 , means the pair (x1 , z1) for all yj ,
j = 1, 2, 3, and perform min operation
min (R1 (x1 , y1) , R2 (y1 , z1)) = min (0.1, 0.8) = 0.1,
min (R1 (x1 , y2) , R2 (y2 , z1)) = min (0.3, 0.2) = 0.2,
min (R1 (x1 , y3) , R2 (y3 , z1)) = min ( 0, 0.5) = 0,
For x = x1 ,
Calculate
z = z1 ,
y = yj , j = 1, 2, 3,
{ (x1 , z1) , max ( (min (0.1, 0.8), min (0.3, 0.2), min (0, 0.5) )
i.e.
i.e.
x
x1
z1
z2
z3
0.1
0.3
x2
0.8
0.3
Note : If tables R1
and
R2
fo
.in
rs
de
ea
ty
,w
.m
yr
ha
kr
ab
or
is defined by
(x , z)
AxC, y
R1(x , y)
R1
y2
y1
y3
x
x1
0.1
0.3
x2
0.8
0.3
z1
z2
z3
y1
0.8
0.2
y2
0.2
0.6
y3
0.5
0.4
y
R2
R1 R2 =
x
x1
z1
z2
z3
0.3
0.1
x2
0.5
0.4
0.4
R1 R2
fo
.in
rs
de
ea
1. "Neural
ha
kr
ab
or
ty
,w
.m
yr
4. References : Textbooks
2. "Soft Computing and Intelligent Systems Design - Theory, Tools and Applications",
4. "Fuzzy Sets and Fuzzy Logic: Theory and Applications", by George J. Klir and
Bo Yuan, (1995), Prentice Hall, Chapter 1-9, page 1-278.
6. "Fuzzy Logic: Intelligence, Control, and Information", by John Yen, Reza Langari,
(1999 ), Prentice Hall, Chapter 1-7, page 1-167.
7. "Fuzzy Logic with Engineering Applications", by Timothy Ross, (2004), John Wiley
& Sons Inc, Chapter 1-4 , page 1-114.
8. "Fuzzy Logic and Neuro Fuzzy Applications Explained", by Constantin Von Altrock,
(1995), Prentice Hall, Chapter 1-2, page 1-28.
42