Module III
Fuzzy logic - fuzzy sets - properties - operations on
fuzzy sets, fuzzy relations - operations on fuzzy
relations.
1
FUZZY LOGIC
Fuzzy logic is a form of multi-valued logic to deal with reasoning that is
approximate rather than precise. Fuzzy logic variables may have a truth value that
ranges between 0 and 1.
Fuzzy logic offers soft computing paradigm the important concept of
computing with words. It provides a technique to deal with imprecision and
information granularity.
The fuzzy theory provides a mechanism for representing linguistic
constructs such as "high," "low," "medium," "tall," "many." In general, fuzzy logic
provides an inference structure that enables appropriate human reasoning
capabilities. The theory of Fuzzy logic is based upon the notion of relative graded
membership and so are the functions of cognitive processes. The utility of fuzzy
sets lies in their ability to model uncertain or ambiguous data and to provide
suitable decisions as in Figure:
In fuzzy systems, values are indicated by a number (called a truth value)
ranging from 0 to l, where 0.0 represents absolute falseness and 1.0 represents
absolute truth.
Fuzzy sets that represent fuzzy logic provide means to model the uncertainty
associated with vagueness, imprecision and lack of information regarding a
problem or a plant or a system, etc.
Consider the meaning of a "short person". For an individual X, a short
person may be one whose height is below 4' 25". For other individual Y, a short
person may be one whose height is below or equal to 3'90". The word "short" is
called a linguistic descriptor. The term "short" provides the same meaning to
individuals X and Y, but it can be seen that they both do not provide a unique
definition. This variable "short" is called as linguistic variable which represents
the imprecision existing in the system.
The basis of the theory lies in making the membership function lie over a
range of real numbers from 0.0 to 1.0. The fuzzy set is characterized by (0.0, 0, and
1.0). The membership value is "1" if it belongs to the set and "0" if it is not a
member of the set. Thus membership in a set is found to be binary, that is, either
the element is a member of a set or not. It can be indicated as
2
is the membership of element x in the set A and A is the entire set on the
universe.
Fuzzy logic operates on the concept of membership. In Figure below, the
objective term "tall" has been assigned fuzzy values. At 150 cm and below, a
person does not belong to the fuzzy class while for above 180, the person certainly
belong to category "tall." However, between 150 and 180 cm, the degree of
membership for the class "tall" can be assigned from the curve linearly between 0
and 1.
The fuzzy concept "tallness" can be extended into "short," "medium" and
“tall” as shown in figure below:
3
The membership was extended to possess various "degrees of membership"
on the real continuous interval [0, l]. The degree of membership of any particular
element of a fuzzy set expresses the degree of compatibility of the element with a
concept represented by fuzzy set.
It means that a fuzzy set A contains an object x to degree a(x), that is, a(x) =
Degree(x ϵ A), and the map a: X --> {Membership degree} is called a set function
or a membership function. The fuzzy set A can be expressed as A = {(x, a(x))}.
Fuzziness describes the ambiguity of an event and randomness describes the
uncertainty in the occurrence of an event.
Boundary Region of a fuzzy set
From Figure below it can be noted that "a" is clearly a member of fuzzy set
P, "c" is clearly not a member of fuzzy set P and the membership of "b" is found to
be vague. Hence "a" can take membership value 1, "c" can take membership value
0 and "b" can take membership value between 0 and 1 [0 to 1], say 0.4, 0.7, etc.
This is said to be a partial membership of fuzzy set P.
The membership function for a set maps each element of the set to a
membership value between 0 and 1 and uniquely describes that set. The value 0
and 1 describes not belonging to and belonging to a set, respectively; values in
between represents "fuzziness."
Fuzzy sets form the building blocks for fuzzy IF-THEN rules which have the
general form "IF X is A THEN Y is B, "where A and B are fuzzy sets. The term
"fuzzy systems" refers mostly to systems that are governed by fuzzy IF-THEN
rules.
The IF part of an implication is called the antecedent whereas the THEN
part is called a consequent. A fuzzy system is a set of fuzzy rules that converts
4
inputs to outputs. The basic configuration of a pure fuzzy system is shown in
figure below.
FUZZY SETS
Fuzzy sets may be viewed as an extension and generalization of the basic
concepts of crisp sets.
Fuzzy set it allows partial membership. A fuzzy set is a set having degrees of
membership between 1 and 0. The membership in a fuzzy set need not be
complete, i.e., member of one fuzzy set a1so be member of other fuzzy sets in the
same universe.
Vagueness is introduced in fuzzy set by eliminating the sharp boundaries
that divide members from nonmembers in the group. There is a gradual transition
between full membership and non membership, not abrupt transition.
A fuzzy set in the universe of discourse U can be defined as a set of ordered
pairs and it is given by,
is the degree of membership of x in A and it indicates the degree that x
belongs to A.
The degree of membership assumes values in the range from 0
to 1, i.e., the membership is set to unit interval [0, 1] or ε [0, 1].
5
The universe of discourse U is discrete and finite fuzzy set A is given as follows:
A fuzzy set is universal fuzzy set if and only if the value of the membership
function is 1 for all the members under consideration. Any fuzzy set A defined on
a universe U is a subset of that universe.
Two fuzzy sets A and B are said to be equal fuzzy sets if μA(x) = μB(x) for
all x ϵ U.
A fuzzy set A is said to be empty fuzzy set if and only if the value of the
membership function is 0 for all possible members considered. The universal fuzzy
set can also be called whole fuzzy set.
The collection of all fuzzy sets and fuzzy subsets on universe U is called,
fuzzy power set P(U). Since all the fuzzy sets can overlap, the cardinaliry of the
fuzzy power set, nP(U) is infinite. i.e.) nP(U) = ∞.
PROPERTIES OF FUZZY SETS
1. Commutativity
2. Associativity
3. Distributivity
6
4. ldempotency
5. Identity
6. Involution (double negation)
7. Transitivity
8. De Morgan's law
FUZZY SET OPERATIONS
Let A and B be fuzzy sets in the universe of discourse U. For a given element
x on the universe, the following function theoretic operations of union, intersection
and complement are defined for fuzzy sets and on U.
1) Union
The union of fuzzy sets and , denoted by U , is defined as
7
Where V indicates max operation.
The Venn diagram for union operation of fuzzy sets and is
shown in Figure below:
2) lntersection
The intersection of fuzzy sets and , denoted by ∩ , is defined by
where ^ indicates min operator. The Venn diagram for intersection
operation of fuzzy sets and is shown in Figure below.
8
3) Complement
When μA(x) ϵ [0,1] , the complement of , denoted as is defined by
The Venn diagram for complement operation of fuzzy set is shown in
Figure below.
4) Algebraic sum
The algebraic sum ( + ) of fuzzy sets, fuzzy set and is
defined as
5) Algebraic product
The algebraic product ( . ) of two fuzzy sets and is defined as
9
6) Bounded sum
The bounded sum ( ) of two fuzzy sets and is defined as
7. Bounded difference
The bounded difference ( ʘ ) of two fuzzy sets and is defined as
FUZZY RELATIONS
Fuzzy relations relate elements of one universe (say X) to those of another
universe (say Y) through the Cartesian product of the two universes. These can
also be referred to as fuzzy sets defined on universal sets, which are Cartesian
products.
A fuzzy relation is based on the concept that everything is related to some
extent or unrelated.
A fuzzy relation is a fuzzy set defined on the Cartesian product of classical
sets {X1, X2, ... ·: Xn} where tuples (x1,x2,…, xn) may have varying degrees of
membership μR(x1,x2,…, xn) within the relation. That is,
A fuzzy relation between two sets X and Y is called binary fuzzy relation and
is denoted by R(X, Y). A binary relation R(X, Y) is referred to as bipartite graph
when X ≠ Y. The binary relation on a single set X is called directed graph or
digraph. This relation occurs when X=Y and is denoted as R(X,X) or R(X2).
10
Fuzzy Matrix
Let
Fuzzy relation R(X, Y) can be expressed by an n x m matrix as follows:
The matrix representing a fuzzy relation is called fuzzy matrix. A fuzzy
relation R is a mapping from Cartesian space X x Y to the interval [0, 1].
Fuzzy Graph
A fuzzy graph is a graphical representation of a binary fuzzy relation. Each
element in X and Y corresponds to a node in the fuzzy graph. The connection links
are established between the nodes by the elements of with nonzero
membership grades in R(X, Y).The links may also be present in the form of arcs.
When X ≠ Y, the link connecting the two nodes is an undirected binary graph
called bipartite graph.
When X= Y, a node is connected to itself and directed links are used; in such
a case, the fuzzy graph is called directed graph.
The domain of a binary fuzzy relation R(X ,Y) is the fuzzy set, dom R(X, Y),
having the membership function as
Consider a universe X= {x1,x2,x3, x4} and the binary fuzzy relation on X as
11
The bipartite graph and simple fuzzy graph of is shown in Figures
below:
Fig: Bipartite graph
Fig: Simple fuzzy graph.
12
Let
Let be a relation from given by
The corresponding fuzzy matrix for relation is
The graph of the above relation is shown below:
13
OPERATIONS ON FUZZY RELATIONS
The basic operations on fuzzy sets also apply on fuzzy relations.
Let and be fuzzy relations on the Cartesian space X x Y. The operations
that can be performed on these fuzzy relations are described below:
1. Union
2. Intersection
3. Complement
4. Containment
5.Inverse
The inverse of a fuzzy relation R on X x Y is denoted by R-1. It is a relation
on Y x X defined by,
6. Projection
For a fuzzy relation R(X,Y), let (R ↓Y) denote the projection of R onto Y.
Then (R ↓Y) is a fuzzy relation in Y whose membership function is defined by:
14