C++ Neural Networks and Fuzzy Logic by Valluru B. Rao M&T Books, IDG Books Worldwide, Inc. ISBN: 1558515526 Pub Date: 06/01/95 |

Previous | Table of Contents | Next |

A relation on a set, that is a subset of a Cartesian product of some set with itself, may have some interesting properties. It may be *reflexive*. For this you need to have 1 for the degree of membership of each main diagonal entry. Our example here is evidently not reflexive.

A relation may be *symmetric*. For this you need the degrees of membership of each pair of entries symmetrically situated to the main diagonal to be the same value. For example (Jeff, Mike) and (Mike, Jeff) should have the same degree of membership. Here they do not, so our example of a relation is not symmetric.

A relation may be *antisymmetric*. This requires that if a is different from b and the degree of membership of the ordered pair (*a*, *b*) is not 0, then its mirror image, the ordered pair (*b*, *a*), should have 0 for degree of membership. In our example, both (Steve, Mike) and (Mike, Steve) have positive values for degree of membership; therefore, the relation much_more_educated over the set {Jeff, Steve, Mike} is not antisymmetric also.

A relation may be *transitive*. For transitivity of a relation, you need the following condition, illustrated with our set {Jeff, Steve, Mike}. For brevity, let us use r in place of much_more_educated, the name of the relation:

min (m_{r}(Jeff, Steve) , m_{r}(Steve, Mike) )[le]m_{r}(Jeff, Mike) min (m_{r}(Jeff, Mike) , m_{r}(Mike, Steve) )[le]m_{r}(Jeff, Steve) min (m_{r}(Steve, Jeff) , m_{r}(Jeff, Mike) )[le]m_{r}(Steve, Mike) min (m_{r}(Steve, Mike) , m_{r}(Mike, Jeff) )[le]m_{r}(Steve, Jeff) min (m_{r}(Mike, Jeff) , m_{r}(Jeff, Steve) )[le]m_{r}(Mike, Steve) min (m_{r}(Mike, Steve) , m_{r}(Steve, Jeff) )[le]m_{r}(Mike, Jeff)

In the above listings, the ordered pairs on the left-hand side of an occurrence of [le] are such that the second member of the first ordered pair matches the first member of the second ordered pair, and also the right-hand side ordered pair is made up of the two nonmatching elements, in the same order.

In our example,

min (m_{r}(Jeff, Steve) , m_{r}(Steve, Mike) ) = min (0.2, 0.3) = 0.2 m_{r}(Jeff, Mike) = 0.7 > 0.2

For this instance, the required condition is met. But in the following:

min (m_{r}(Jeff, Mike), m_{r}(Mike, Steve) ) = min (0.7, 0.6) = 0.6 m_{r}(Jeff, Steve) = 0.2 < 0.6

The required condition is violated, so the relation much_more_educated is not transitive.

NOTE:If a condition defining a property of a relation is not met even in one instance, the relation does not possess that property. Therefore, the relation in our example is not reflexive, not symmetric, not even antisymmetric, and not transitive.

If you think about it, it should be clear that when a relation on a set of more than one element is symmetric, it cannot be antisymmetric also, and vice versa. But a relation can be both not symmetric and not antisymmetric at the same time, as in our example.

An example of reflexive, symmetric, and transitive relation is given by the following matrix:

1 0.4 0.8 0.4 1 0.4 0.8 0.4 1

A reflexive, symmetric, and transitive fuzzy relation is said to be a *fuzzy equivalence relation*. Such a relation is also called a *similarity relation*. When you have a similarity relation *s*, you can define the *similarity class* of an element *x* of the domain as the fuzzy set in which the degree of membership of *y* in the domain is *m _{s}*(

Do you think similarity and resemblance are one and the same? If x is similar to y, does it mean that x resembles y? Or does the answer depend on what sense is used to talk of similarity or of resemblance? In everyday jargon, Bill may be similar to George in the sense of holding high office, but does Bill resemble George in financial terms? Does this prompt us to look at a ‘resemblance relation’ and distinguish it from the ‘similarity relation’? Of course.

Recall that a fuzzy relation that is reflexive, symmetric, and also transitive is called similarity relation. It helps you to create similarity classes. If the relation lacks any one of the three properties, it is not a similarity relation. But if it is only not transitive, meaning it is both reflexive and symmetric, it is still not a similarity relation, but it is a resemblance relation. An example of a resemblance relation, call it *t*, is given by the following matrix.

Let the domain have elements *a*, ** b**, and

1 0.4 0.8t= 0.4 1 0.5 0.8 0.5 1

This fuzzy relation is clearly reflexive, and symmetric, but it is not transitive. For example:

min (m_{t}(a, c) , m_{t}(c, b) ) = min (0.8, 0.5) = 0.5 ,

but the following:

m_{t}(a, b) = 0.4 < 0.5 ,

is a violation of the condition for transitivity. Therefore, ** t** is not a similarity relation, but it certainly is a resemblance relation.

One last definition is that of a *fuzzy partial order*. A fuzzy relation that is reflexive, antisymmetric, and transitive is a fuzzy partial order. It differs from a similarity relation by requiring antisymmetry instead of symmetry. In the context of crisp sets, an equivalence relation that helps to generate *equivalence* classes is also a reflexive, symmetric, and transitive relation. But those *equivalence* classes are disjoint, unlike similarity classes with fuzzy relations. With crisp sets, you can define a partial order, and it serves as a basis for making comparison of elements in the domain with one another.

Previous | Table of Contents | Next |

Copyright © IDG Books Worldwide, Inc.

C++ Neural Networks and Fuzzy Logic

ISBN: 1558515526

EAN: 2147483647

EAN: 2147483647

Year: 1995

Pages: 139

Pages: 139

Authors: Valluru B. Rao, Hayagriva Rao

Similar book on Amazon

- Chapter VI Web Site Quality and Usability in E-Commerce
- Chapter VIII Personalization Systems and Their Deployment as Web Site Interface Design Decisions
- Chapter IX Extrinsic Plus Intrinsic Human Factors Influencing the Web Usage
- Chapter X Converting Browsers to Buyers: Key Considerations in Designing Business-to-Consumer Web Sites
- Chapter XVII Internet Markets and E-Loyalty

flylib.com © 2008-2017.

If you may any questions please contact us: flylib@qtcs.net

If you may any questions please contact us: flylib@qtcs.net