Fuzzy Set Theory
Dr.N.Herald Anantha Rufus, AP/ECE
Vel Tech Rangarajan Dr.Sagunthala R &
D Institute of Science and Technology
Neuro-Fuzzy and Soft Computing: Fuzzy Sets
Fuzzy Sets
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
2
Neuro-Fuzzy and Soft Computing: Fuzzy Sets
Membership Functions (MFs)
Characteristics of MFs:
• Subjective measures
• Not probability functions
“tall” in Asia
Membership
.8
.5 “tall” in the US
“tall” in NBA
.1
5’10’’ Height
3
Neuro-Fuzzy and Soft Computing: Fuzzy Sets
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 Universe or
Fuzzy set
function universe of discourse
(MF)
A fuzzy set is totally characterized by a
membership function (MF).
4
Neuro-Fuzzy and Soft Computing: Fuzzy Sets
Fuzzy Sets
A fuzzy set is totally characterized by a
membership function (MF).
a membership function for a fuzzy set A
on the universe of discourse X is defined as µA:X → [0,1],
where each element of X is mapped to a
value between 0 and 1.
This value, called membership value or degree of
membership,
quantifies the grade of membership
of the element in X to the fuzzy set A.
5
Neuro-Fuzzy and Soft Computing: Fuzzy Sets
Fuzzy Sets with Discrete Universes
Fuzzy set C = “desirable city to live in”
X = {SF, Boston, LA} (discrete and nonordered)
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 universe)
A = {(0, .1), (1, .3), (2, .7), (3, 1), (4, .6), (5, .2), (6, .1)}
6
Neuro-Fuzzy and Soft Computing: Fuzzy Sets
Fuzzy Sets with Cont. Universes
Fuzzy set B = “about 50 years old”
X = Set of positive real numbers (continuous)
B = {(x, mB(x)) | x in X}
1
B(x) 2
x 50
1
10
7
BASIC DEFINITIONS AND TERMINOLOGY
• Let X be a space of objects and z be a generic
element of A. A classical set A, is
defined as a collection of elements or objects
such that each z can either belong or not belong
to the set A. By defining a characteristic function
for each element z in A, we can represent a
classical set A by a set of ordered pairs (z, 0) or (z,
1), which indicates respectively.