Scribd
Upload
10 views3 pages

WEEK02 Assignment02 Solution

The document provides solutions for Week 2 of a Soft Computing Techniques course, focusing on fuzzy relations and defuzzification methods. It covers concepts such as reflexivity, fuzzy equivalence relations, and various defuzzification techniques, including centroid and weighted average methods. Additionally, it includes calculations and examples related to fuzzy relations and their properties.

Uploaded by

AJ - The PES Lover
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views3 pages

WEEK02 Assignment02 Solution

The document provides solutions for Week 2 of a Soft Computing Techniques course, focusing on fuzzy relations and defuzzification methods. It covers concepts such as reflexivity, fuzzy equivalence relations, and various defuzzification techniques, including centroid and weighted average methods. Additionally, it includes calculations and examples related to fuzzy relations and their properties.

Uploaded by

AJ - The PES Lover
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Soft Computing Techniques

Week-02 Assignment-02 (Solution)

Solutions for Week 2: Fuzzy Relations and Defuzzification

1. (c). The degree of membership of the pair (b,c) corresponds to the number in the second row and the
third column of the given matrix R, which is 0.6.
2. (b). A fuzzy relation R is reflexive if R(x, x) = 1, ∀ x ∈ X.
3. (d). A fuzzy relation R is said to be a fuzzy equivalence relation if R is,

i Reflexive
ii Symmetric
iii Transitive
But here R is not reflexive. So, R is not a valid fuzzy equivalence relation.

4. (c). In the centroid method, the defuzzified value is calculated as the weighted average of all possible
values.
5. (d). The crispification method is not a commonly used defuzzification method.
6. (b). A fuzzy relation maps each pair (x,y) to a degree of membership in the interval [0, 1].

7. (b). According to max-min composition,


 
R3 (x, z) = max min R1 (x, y), R2 (y, z)
 
= max min 0.4, 0.9
=⇒ R3 (x, z) = max(0.4)
=⇒ R3 (x, z) = 0.4

8. 3.2, range is 3.19 to 3.21. Using the centroid defuzzification method, the defuzzified value is given by
n
P
xi µ(xi )
i=1 0 × 0.1 + 1 × 0.3 + 2 × 0.5 + 3 × 0.7 + 4 × 0.8 + 5 × 0.6
n =
P 0.1 + 0.3 + 0.5 + 0.7 + 0.8 + 0.6
µ(xi )
i=1
9.6
=
3
n
P
xi µ(xi )
i=1
=⇒ Pn = 3.2
µ(xi )
i=1
9. (a). For given A and B, A × B is given by
 
min(0.2, 0.8) min(0.2, 0.6) min(0.2, 0.3)
min(0.3, 0.8) min(0.3, 0.6) min(0.3, 0.3)
A×B =
min(0.5, 0.8)

min(0.5, 0.6) min(0.5, 0.3)
min(0.6, 0.8) min(0.6, 0.6) min(0.6, 0.3)
 
0.2 0.2 0.2
0.3 0.3 0.3
=⇒ A × B =  0.5

0.5 0.3
0.6 0.6 0.3

10. (c). In a Mamdani fuzzy inference system, the rule base contains fuzzy rules with fuzzy antecedents
and crisp consequents.
11. (d). We will determine the conclusion by taking the minimum of the membership values of temperature
and humidity.
12. (b). The Cartesian product of the two given fuzzy sets A and B is given by,
R(x, y) = min µA (x), µB (y)

13. 2.782, range is 2.78 to 2.79. The membership value, µA (x), of given fuzzy set A is


 1, if x = 2

0.8, if x = 3
µA (x) =


 0.5, if x = 4
0, otherwise

Using the Weighted Average defuzzification method, the crisp output is


P
(membership value × crisp value)
= P
(membership value)
1 × 2 + 0.8 × 3 + 0.5 × 4 + 0
=
1 + 0.8 + 0.5 + 0
6.4
=
2.3
= 2.782

So the crisp output is approximately 2.782.

14. (b). The diagonal elements are 1, i.e., R is reflexive. Also, the matrix is symmetric so R is symmetric.
For transitivity R must satisfy the following inequality :

R(a, b) ≥ RoR(a, b) ∀(a, b) ∈ X × X

Let us find RoR using the max-min composition method.


 
1 0.7 0.5
RoR = 0.7 1 1
0.5 0.5 1

Clearly, R(b, c) < RoR(b, c) which means that R is NOT transitive.


15. (d). For the given A and B, A × B is given by
 
min(0.0, 0.2) min(0.0, 1.0) min(0.0, 0.8) min(0.0, 0.0)
min(0.8, 0.2) min(0.8, 1.0) min(0.8, 0.8) min(0.8, 0.0)
A×B =
min(0.6, 0.2) min(0.6, 1.0) min(0.6, 0.8) min(0.6, 0.0)

min(1.0, 0.2) min(1.0, 1.0) min(1.0, 0.8) min(1.0, 0.0)


 
0.0 0.0 0.0 0.0
0.2 0.8 0.8 0.0
=⇒ A × B =  
0.2 0.6 0.6 0.0
0.2 1.0 0.8 0.0

You might also like