0% found this document useful (0 votes)
510 views2 pages

Soft Computing Composition of Fuzzy Relation

The document discusses fuzzy set composition operations. It defines composition of fuzzy relations R and S as combining the relations such that they map from universe X to Y for R, and Y to Z for S, denoted as ROS. It provides an example of relations R and S defined on universes X, Y, and Z, and calculates the composition ROS. The document also describes two methods for fuzzy set composition - max-min and max product. It provides an example of applying each method to sample relations R and S defined on inputs x1, x2 and outputs z1, z2, z3. The conclusion states that fuzzy set compositions have been studied and implemented.

Uploaded by

Sainath Parkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
510 views2 pages

Soft Computing Composition of Fuzzy Relation

The document discusses fuzzy set composition operations. It defines composition of fuzzy relations R and S as combining the relations such that they map from universe X to Y for R, and Y to Z for S, denoted as ROS. It provides an example of relations R and S defined on universes X, Y, and Z, and calculates the composition ROS. The document also describes two methods for fuzzy set composition - max-min and max product. It provides an example of applying each method to sample relations R and S defined on inputs x1, x2 and outputs z1, z2, z3. The conclusion states that fuzzy set compositions have been studied and implemented.

Uploaded by

Sainath Parkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

EXPERIMENT NO AIM- Implementation of Fuzzy Compositions.

THEORYComposition of Fuzzy relations:


The operation execuated on two compitable binary relation to get a single binary relation
is the composition of the relations.
Let R be the relation which map the relation from universe X and Y. Let S be the relation
which map the relations from universe Y and Z.
It is denoted by ROS.
There has to be common elements in Y for the relations R and S to be compatible.
Consider,
X={a1,a2,a3}
Y={b1,b2,b3}
Z={c1,c2,c3}
Find RoS.
R={ (a1,b1), (a1,b2), (a1,b3), (a2,b2), (a3,b3) }
S={ (b1,c1), (b1,c2), (b1,c3), (b2,c2), (b3,c3) }
Now, ROS={(a1,c1), (a3,c3), (a1,c2), (a1,c3)}

Composition Operations:

R=
x1
x2

S=
y1
0.6
0.2

y2
0.3
0.9

y1
y2

z1
1
0.8

z2
0.5
0.4

z3
0.3
0.7

1. Max- Min
T(X,Z)= max[ min[R(X,Y), S(Y,Z)] ]
Hence,
T=
x1
x2

z1
0.6
0.8

z2
0.5
0.4

z3
0.3
0.7

2. Max Product
T(X,Z)= max[ R(X,Y) . S(Y,Z) ]
Hence,
T=
x1
x2

z1
0.6
0.72

z2
0.3
0.36

z3
0.21
0.63

CONCLUSIONHence, we have studied and implemented the fuzzy set compositions.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy