Soft Computing

Dr. Lekshmi R. R.
Asst. Prof.
Department of Electrical & Electronics
Engineering
Amrita School of Engineering 1
Crisp & Fuzzy Sets
 Crisp/Classical set
• Described by crisp A X
boundaries
a
– No uncertainty in the
b
location of
boundaries of set
𝑥∈𝑋
• A – collection of
A is clearly a member of A
elements with some
B is clearly not a member of A
characteristics
𝐴= 𝑎 Boundary is an unambiguous line

For a universe of discourse X with elements x, crsip set defines collection of objects
having some characteristics
 Notations
x ∈ X; x belongs to X
x ∈ A; x does not belong to A
A ⊂ B; A is fully contained in B; if x ∈ 𝐴, 𝑡ℎ𝑒𝑛 𝑥 ∈ 𝐵
A ⊆ B ; A is contained in or equivalent to B
A ↔ B; A is equivalent to B; A ⊆ B & B ⊆ A
Null set Ф: Set containing no elements
Whole set X: Set of all elements in the universe
Power set P X : Allpossible sets of X
X = 𝑎, 𝑏, 𝑐
P(X) = Ф, 𝑎 , 𝑏 , 𝑐 , 𝑎, 𝑏 , 𝑏, 𝑐 , 𝑎, 𝑐 , 𝑎, 𝑏, 𝑐
 Crisp set operation
Union

A ∪ B = x|x ∈ A or x ∈ B
X
A

𝐀∪𝐁 B
 Crisp set operation
Intersection

A ∩ B = x|x ∈ A and x ∈ B
X
A

𝐀∩
A ∩ 𝐁B B
 Crisp set operation
Complement

ഥ = x|x ∉ A
A
X
A ഥ
A
ഥ
𝐀
 Crisp set operation
Difference

A|B = x|x ∈ A and x ∉ B

X
A
𝐀|𝐁
A|B
B
 Properties of crisp set
Commutatively Involution
• A∪B=B∪A ഥ=A
• A
• A∩B=B∩A Idempotancy
Associativity • A∪A=A
• A∪ B∪C = A∪B ∪C • A∩A=A
• A∩ B∩C = A∩B ∩C Identity
Distributive • A∪Ф=A
• A∪ B∩C = A∪B ∩ A∪C • A∩Ф=Ф
• A∩ B∪C = A∩B ∪ A∩C • A∪X=X
• A∩X=A
 Properties of crisp set
Transitivity
• If A ⊆ B & B ⊆ C, Then A ⊆ C
Axiom of excluded middle
• A∪A ഥ=X
Axiom of contradiction
• A∩A ഥ=Ф
De-Morgan’s Law
• A∪B=A ഥ∩B
ഥ
• A∩B=A ഥ∪B
ഥ
 Properties of crisp set
Commutatively

• A∪B=B∪A • A∩B=B∩A

χ𝐴 (x) χ𝐴 (x)

A B A B

x x
 Properties of crisp set
Associativity
• A∪ B∪C = A∪B ∪C

χ𝐴 (x) χ𝐴 (x)

A B C A B C

x x
 Properties of crisp set
Associativity
• A∩ B∩C = A∩B ∩C

χ𝐴 (x) χ𝐴 (x)

A B C A B C

x x
 Properties of crisp set
Distributive
• A∪ B∩C = A∪B ∩ A∪C

χ𝐴 (x) χ𝐴 (x)

A B C A B C

x x
 Properties of crisp set
Distributive
• A∩ B∪C = A∩B ∪ A∩C

χ𝐴 (x) χ𝐴 (x)

A B C A B C

x x
 Mapping of classical sets
• An element x contained in X corresponds to an element y in
Y
– Termed as mapping from X to Y
– 𝑓: 𝑋 → 𝑌
• Used to map elements in one universe of discourse to
elements in another universe of discourse.
• Mapping – relates set theoretic form to function theoretic
representation.
A X
𝐴= 𝑎 Set theoretic form
a
λA a = 1 λA b = 0
b
Function theoretic form
 Operations in function theoretic form
Union A∪B
• χA∪B(x)=χA(x) V χB(x) = max (χA(x), χB(x))

Intersection A∩B
• χA B(x)=χA(x) χB(x) = min (χA(x), χB(x))
∪
V

Complement A ഥ
• χ Aҧ (x)=1-χA(x)
 Fuzzy set
• Described by ෩
A ෩
X
– vague, ambiguous boundary
boundaries a

– Uncertainty in the location b c

of boundaries of set
𝑎, 𝑏, 𝑐 ∈ 𝑋
Element c? ෩
a is clearly a member of A
• Point c approaches ෩
• value of 1 as it moves
b is clearly not a member of A
closer to centre Boundary is an ambiguous line
• approaches to zero as it
𝜇𝐴෨ (𝑥1 ) 𝜇𝐴෨ (𝑥2 ) 𝜇𝐴෨ (𝑥𝑛 )
leaves boundary. ෩=
A + …
𝑥1 𝑥2 𝑥𝑛

Set having elements with various degrees of membership.

 Fuzzy set operation
Union

μA෩ (x)
෩
A ෩
B

x
 Fuzzy set operation
Intersection

μA෩ (x)
෩
A ෩
B

x
 Fuzzy set operation
Complement

μA෩ (x)
෩
A ഥ
෩
A

x
 Properties of Fuzzy set
Commutatively Involution
෩∪B
• A ෩=B ෩
෩∪A ഥ ෩
෩
• A=A
෩∩B
• A ෩=B ෩
෩∩A
Idempotancy
Associativity ෩∪A
• A ෩=A෩
෩∪ B
• A ෩ ∪ C෨ = A
෩∪B
෩ ∪ C෨ ෩∩A ෩=A෩
• A
෩∩ B
• A ෩ ∩ C෨ = A
෩∩B
෩ ∩ C෨ Identity
Distributive ෩∪Ф=A
• A ෩
෩∪ B
• A ෩ ∩ C෨ = ෩∪B
A ෩ ∪ C෨
෩ ∩ A ෩∩Ф=Ф
• A
෩∩ B
• A ෩ ∪ C෨ = ෩∩B
A ෩ ∩ C෨
෩ ∪ A ෩∪X=X
• A
෩∩X=A
• A ෩
 Properties of crisp set
Axiom of excluded middle
෩∪A
• A ഥ≠X
෩
Axiom of contradiction
෩∩A
• A ഥ≠Ф
෩
De-Morgan’s Law
෩∪B
• A ෩=A ഥ∩B
෩ ഥ
෩
෩∩B
• A ෩=A ഥ∪B
෩ ഥ
෩
 Properties of Fuzzy set
Commutatively
෩∪B
• A ෩=B ෩
෩∪A ෩∩B
• A ෩=B ෩
෩∩A

μA෩ (x)
෩
A ෩
B ෩ ෩
A B
μA෩ (x)

x x
 Properties of Fuzzy set
Associativity
෩∪ B
• A ෩ ∪ C෨ = A
෩∪B
෩ ∪ C෨

A ෩ C෨
෩ B ෩ C෨
෩ B
A
μA෩ (x) μA෩ (x)
μB෩ (x) μB෩ (x)
μC෩ (x) μC෩ (x)

x x
 Properties of Fuzzy set
Associativity
෩∩ B
• A ෩ ∩ C෨ = A
෩∩B
෩ ∩ C෨

෩B
A ෩ C෨ ෩B
A ෩ C෨
μA෩ (x) μA෩ (x)
μB෩ (x) μB෩ (x)
μC෩ (x) μC෩ (x)

x x
 Properties of Fuzzy set
Involution
ഥ ෩
෩
• A=A

ഥ
෩ ഥ
෩
A
μA෩ (x)
A
μB෩ (x)
μC෩ (x)

x
 Properties of Fuzzy set
Axiom of excluded middle
• A ഥ≠X
෩∪A
෩

෩
A ഥ
෩
A
μA෩ (x)
μB෩ (x)
μC෩ (x)

x
 Properties of Fuzzy set
De-Morgan’s Law
෩∪B
• A ഥ∩B
෩
෩=A ഥ
෩

μA෩ (x)
෩
A ෩
B ෩ ෩
A B
μA෩ (x)

x x
 Problem#1
Given
1 0.5 0.3 0.2 0.5 0.7 0.2 0.4
෩=
A + + + ෩=
B + + +
2 3 4 5 2 3 4 5
Perform
1) Complement
2) Union
3) Intersection
4) Difference
5) Demorgan’s Law
 Problem#1
Given
1 0.5 0.3 0.2 0.5 0.7 0.2 0.4
෩=
A + + + ෩=
B + + +
2 3 4 5 2 3 4 5
Perform
1) Complement
ഥ 1 0 0.5 0.7 0.8
෩
A= + + + +
1 2 3 4 5
ത 1 0.5 0.3 0.8 0.6
෨
𝐵= + + + +
1 2 3 4 5
2) Union
0 1 0.7 0.3 0.4
෩∪B
A ෩= + + + +
1 2 3 4 5
3) Intersection
0 0.5 0.5 0.2 0.2
෩∩B
A ෩= + + + +
1 2 3 4 5
 Problem#1
Given
1 0.5 0.3 0.2 0.5 0.7 0.2 0.4
෩=
A + + + ෩=
B + + +
2 3 4 5 2 3 4 5
4) Difference
ഥ 0 0.5 0.3 0.3 0.2
෩
A∩B= ෩ + + + +
1 2 3 4 5
ҧ 0 0 0.5 0.2 0.4
𝐵෨ ∩ 𝐴ሚ = + + + +
1 2 3 4 5
5)De-Morgan’s Law
1 0 0.3 0.7 0.6
෩ ∪ 𝐵෨ =
A + + + +
1 2 3 4 5
1 0.5 0.5 0.8 0.8
෩ ෨
A∩𝐵 = + + + +
1 2 3 4 5
 Problem # 2
Selection of an analyser
Analysers A, B and C are considered
0.7 0.3 0.9
෩
P= + + represents Fuzzy set showing pressure range suitability
A B C
0.5 0.9 0.4
෪
OT = + + represents Fuzzy set showing dead time suitability
A B C
Determine the
ഥ෨
P
Analysers not suitable for pressure range
Analysers not suitable for either pressure range or dead time
෪ ∪ 𝑃ത෨ ∩ 𝑂𝑇
𝑃෨ ∩ 𝑂𝑇 ෪
𝑃ത෨ ∩ 𝑂𝑇
෪
Analysers not suitable for both pressure range and dead time
෨ ෪
Analysers suitable for both pressure range and dead time 𝑃 ∩ 𝑂𝑇
 Problem # 3
෩ = Large spenders ; B
Let A ෩ = Profitabe clients
Find the properties for
• All clients deemed profitable or who are large spenders
෩∪B
A ෩
• All clients deemed profitable & larger spenders
෩∩B
A ෩
• Deemed not profitable
ഥ
෩
B
• Deemed profitable but not large spenders
෩
෩/A
B
Thank you