1

Classical Relations And Fuzzy Relations

Baran Kaynak

Relations
This chapter introduce the notion of relation. The notion of relation is the basic idea behind numerous operations on sets such as Cartesian products, composition of relations , difference of relations and intersections of relations and equivalence properties In all engineering , science and mathematically based fields, relations is very important

Relations
Similarities can be described with relations. In this sense, relations is a very important notion to many different technologies like graph theory, data manipulation.

Graph theory

Data manipulations

In classical relations (crisp relations), Relationships between elements of the sets are only in two degrees; completely related and not related. Fuzzy relations take on an infinitive number of degrees of relationships between the extremes of completely related and not related

Crisp system
-Crisp, exact - Based on models (i.e. differential equations) - Requires complete set of data - Typically linear

Fuzzy system
- Fuzzy, qualitative, vague - Uses knowledge (i.e. rules) - Requires fuzzy data - Nonlinear method

Crisp system -Complex systems hard to model -incomplete information leads to inaccuracy -numerical

Fuzzy logic system -No traditional modeling, inferences based on knowledge - can handle incomplete information to some degree -linguistic

Cartesian Product
Example 3.1. The elements in two sets A and B are given as A ={0, 1} and B ={a,b, c}. Various Cartesian products of these two sets can be written as shown: A B ={(0,a),(0,b),(0,c),(1,a),(1,b),(1,c)} B A ={(a, 0), (a, 1), (b, 0), (b, 1), (c, 0), (c, 1)} A A = A2={(0, 0), (0, 1), (1, 0), (1, 1)} B B = B2={(a, a), (a, b), (a, c), (b, a), (b, b), (b, c), (c, a), (c, b), (c, c)}

Crisp Relations
Cartesian product is denoted in form A1 x A2 x..x Ar The most common case is for r=2 and represent with A1 x A2 The Cartesian product of two universes X and Y is determined as X Y = {(x, y) | x X,y Y} This form shows that there is a matching between X and Y , this is a unconstrained matching.

10

Crisp Relations
Every element in universe X is related completely to every element in universe Y This relationships strenght is measured by the characteristics function XY(x, y) = 1, (x,y) X Y 0, (x,y) X Y Complete relationship is showed with 1 and no relationship is showed with 0

11

When the universes, or sets, are nite the relation can be conveniently represented by a matrix, called a relation matrix.

X ={1, 2, 3} and Y ={a, b, c}

Sagittal diagram of an unconstrained relation

12

Special cases of the constrained Cartesian product for sets where r=2 are called identity relation denoted IA
IA ={(0, 0), (1, 1), (2, 2)}

Special cases of the unconstrained Cartesian product for sets where r=2 are called universal relation denoted UA
UA ={(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)}

13

Cardinality Of Crips Relations

The Cardinality of the relation r between X and Y is n X x Y = nx * ny Power set (P(X x Y)), nP(XY) = 2(nXnY)

14

Operations On Crips Relations

Dene R and S as two separate relations on the Cartesian universe X Y Union: R S RS(x, y) : RS(x, y) = max[R(x, y), S(x, y)] Intersection: R S RS(x, y) : RS(x, y) = min[R(x, y), S(x, y)] Complement: R R(x, y) : R(x, y) = 1 R(x, y) Containment: R S R(x, y) : R(x, y) S(x, y)

15

Properties Of Crips Relations

Commutativity Associativity Distributivity Involution Idempotency
2 (1 + 3) = (2 1) + (2 3).

16

Composition

17

Crisp Binary Relation

18

Composition
For these two relations lets make a composition named T
R = {(x1, y1), (x1, y3), (x2, y4)} S = {(y1, z2), (y3, z2)}

19

There are two common forms of the composition operation;

maxmin composition T = R.S T(x, z)= (R(x, y) S(y, z)) maxproduct composition T = R.S T(x, z)= (R(x, y) . S(y, z))

20

A chain is only as strong as its weakest link

21

Example
Using the maxmin composition operation, relation matrices for R and S would be expressed as

T(x1, z1) = max[min(1, 0), min(0, 0), min(1, 0), min(0, 0)] = 0

22

Example
Using the maxmin composition operation, relation matrices for R and S would be expressed as

T(x1, z1) = max[min(1, 0), min(0, 0), min(1, 0), min(0, 0)] = 0 T(x1, z2) = max[min(1, 1), min(0, 0), min(1, 1), min(0, 0)] = 1

23

Fuzzy Relations
A fuzzy relation R is a mapping from the Cartesian space X x Y to the interval [0,1], where the strength of the mapping is expressed by the membership function of the relation R(x,y)
R : A B [0, 1] R = {((x, y), R(x, y))| R(x, y) 0 , x A, y B}

24

25

Crisp relation vs. Fuzzy relation

Crisp relation

Fuzzy relation

26

Cardinality of Fuzzy Relations

Since the cardinality of fuzzy sets on any universe is infinity, the cardinality of a fuzzy relation between two or more universes is also infinity.

27

Operations on Fuzzy Relations

Let R and S be fuzzy relations on the Cartesian space X Y. Then the following operations apply for the membership values for various set operations:
Union: RS (x, y) = max(R (x, y),S(x, y)) Intersection: RS (x, y) = min(R (x, y),S (x, y)) Complement:R(x, y) = 1 R(x, y) Containment:R S R (x, y) S (x, y)

28

Fuzzy Cartesian Product and Composition

A fuzzy relation R is a mapping from the Cartesian space X x Y to the interval [0,1], where the strength of the mapping is expressed by the membership function of the relation R(x,y)
R : A B [0, 1] R = {((x, y), R(x, y))| R(x, y) 0 , x A, y B}

29

Max-min Composition
Two fuzzy relations R and S are defined on sets A, B and C. That is, R A B, S B C. The composition SR = SR of two relations R and S is expressed by the relation from A to C:
For (x, y) A B, (y, z) B C,
SR (x, z) = max [min (R (x, y), S (y, z))] = [R (x, y) S (y, z)] MSR = MRMS (matrix notation)

30

Max-min Composition

31

Max-product Composition
Two fuzzy relations R and S are defined on sets A, B and C. That is, R A B, S B C. The composition SR = SR of two relations R and S is expressed by the relation from A to C:
For (x, y) A B, (y, z) B C, SR (x, z) = maxy [R (x, y) S (y, z)] = y [R (x, y) S (y, z) MSR = MR MS (matrix notation)

32

33

Example
Suppose we have two fuzzy sets, A defined on a universe of three discrete temperatures, X = {x1, x2, x3}, and B defined on a universe of two discrete pressures, Y = {y1, y2}, and we want to find the fuzzy Cartesian product between them. Fuzzy set A could represent the ambient temperature and fuzzy set B the near optimum pressure for a certain heat exchanger, and the Cartesian product might represent the conditions (temperaturepressure pairs) of the exchanger that are associated with efficient operations.

34

Fuzzy Cartesian product, using

results in a fuzzy relation R (of size 3 2) representing efficient conditions,
SR (x, z) = max [min (R (x, y), S (y, z))]

35

Example
X = {x1, x2}, Y = {y1, y2}, and Z = {z1, z2, z3} Consider the following fuzzy relations:

Then the resulting relation, T, which relates elements of universe X to elements of universe Z,
T(x1, z1) = max[min(0.7, 0.9), min(0.5, 0.1)] = 0.7

36

and by maxproduct composition,

T(x2, z2) = max[(0.8 . 0.6), (0.4 . 0.7)] = 0.48

37

Example
A simple fuzzy system is given, which models the brake behaviour of a car driver depending on the car speed. The inference machine should determine the brake force for a given car speed. The speed is specified by the two linguistic terms "low" and "medium", and the brake force by "moderate" and "strong". The rule base includes the two rules (1) IF the car speed is low THEN the brake force is moderate (2) IF the car speed is medium THEN the brake force is strong

38

http://virtual.cvut.cz/dynlabmodules/ihtml/dynlabmodules/syscontrol/node123.html Short Url: http://goo.gl/T2z5u

39

Crisp Equivalence Relation

A relation R on a universe X can also be thought of as a relation from X to X. The relation R is an equivalence relation and it has the following three properties: Reexivity Symmetry Transitivity

40

Reexivity
(xi ,xi ) R or R(xi ,xi ) = 1 When a relation is reexive every vertex in the graph originates a single loop, as shown in

41

Symmetry
(xi, xj ) R (xj, xi) R

42

Transitivity
(xi ,xj ) R and (xj ,xk) R (xi ,xk) R

43

Crisp Tolerance Relation

A tolerance relation R (also called a proximity relation) on a universe X is a relation that exhibits only the properties of reexivity and symmetry. A tolerance relation, R, can be reformed into an equivalence relation by at most (n 1) compositions with itself, where n is the cardinal number of the set dening R, in this case X

44

Example
Suppose in an airline transportation system we have a universe composed of ve elements: the cities Omaha, Chicago, Rome, London, and Detroit. The airline is studying locations of potential hubs in various countries and must consider air mileage between cities and takeoff and landing policies in the various countries.

45

Example
These cities can be enumerated as the elements of a set, i.e., X ={x1,x2,x3,x4,x5}={Omaha, Chicago, Rome, London, Detroit} Suppose we have a tolerance relation, R1, that expresses relationships among these cities:
This relation is reexive and symmetric.

46

Example
The graph for this tolerance relation

If (x1,x5) R1 can become an equivalence relation

47

Example:
This matrix is equivalence relation because it has (x1,x5)

Five-vertex graph of equivalence relation (reexive, symmetric, transitive)

48

FUZZY TOLERANCE AND EQUIVALENCE RELATIONS

Reflexivity R(xi, xi) = 1 Symmetry R(xi, xj ) = R(xj, xi) Transitivity R(xi, xj ) = 1 and R(xj, xk) = 2 R(xi, xk) = where min[1, 2].

49

Example
Suppose, in a biotechnology experiment, five potentially new strains of bacteria have been detected in the area around an anaerobic corrosion pit on a new aluminum-lithium alloy used in the fuel tanks of a new experimental aircraft. In order to propose methods to eliminate the biocorrosion caused by these bacteria, the five strains must first be categorized. One way to categorize them is to compare them to one another. In a pairwise comparison, the following " similarity" relation,R1, is developed. For example, the first strain (column 1) has a strength of similarity to the second strain of 0.8, to the third strain a strength of 0 (i.e., no relation), to the fourth strain a strength of 0.1, and so on. Because the relation is for pairwise similarity it will be reflexive and symmetric. Hence,

50

is reflexive and symmetric. However, it is not transitive

R(x1, x2) = 0.8, R(x2, x5) = 0.9 0.8 but R(x1, x5) = 0.2 min(0.8, 0.9)

51

One composition results in the following relation:

where transitivity still does not result; for example, R2(x1, x2) = 0.8 0.5 and R2(x2, x4) = 0.5 but R2(x1, x4) = 0.2 min(0.8, 0.5)

52

Finally, after one or two more compositions, transitivity results: