Sca L1
Sca L1
Traditional Functional
Symbolic Numerical Approximate Approximation
Logic Modeling and Reasoning and Randomized
Reasoning Search Search
In 1994, Prof Zadeh introduced the term “Soft Computing“
According to him
"...in contrast to traditional hard computing, soft computing exploits
the tolerance for
-imprecision,
-uncertainty,
-and partial truth
to achieve tractability, robustness, low solution-cost, and better
rapport with reality”
Introduction to Fuzzy Logic
A question?
• Are you tired?
• Rate on the scale
– 0 (no)
– 1 (Yes)
Fuzzy logic : it uses linguistic terms which humans often use to describe their
actions. E.g. John is tall.
Crisp set vs. fuzzy set ( Graphical Representation)
Someone over 190 cm is almost universally considered to be tall. Someone who is 180
cm may be considered to be sort of tall , while someone who is under 160 cm is not
usually considered to be tall.
Fuzzy sets
• A membership function:
– A characteristic function: the values assigned to the elements of the universal
set fall within a specified range and indicate the membership grade of these
elements in the set.
– To express imprecision quantitatively, a set membership function maps
elements to real values between zero and one (inclusive).
– Larger values denote higher degrees of set membership.
• A set defined by membership functions is a fuzzy set.
• The most commonly used range of values of membership functions is the unit
interval [0,1].
• The universal set X is always a crisp set.
• Notation:
– The membership function of a fuzzy set A is denoted by : A : X → [0,1]
15
OPERATIONS ON FUZZY SETS
Operations on Fuzzy Sets: Intersection [ Graphical representation ]
30
Operations on Fuzzy Sets: Union and Complement
31
Example
⚫ A = {1.0, 0.20, 0.75}
⚫ B = {0.2, 0.45, 0.50}
Fuzzy set whose support is a single point in X with µA(x) =1 is called fuzzy
singleton
➢ CORE:
➢ SUPPORT:
➢ BOUNDARY:
FEATURES OF MEMBERSHIP FUNCTIONS
Nonconvex fuzzy set: possessing the characteristics opposite to the convex fuzzy set.
Intersection of two convex fuzzy sets
Fuzzification
➢ Use crisp inputs from the user.
•
• Dilations (or dilution) stretches or dilates a fuzzy set by increasing the membership
of elements that are ‘‘partly’’ in the set.
80
Inference : Example
• In the identification of a triangle
– Let A, B, C be the inner angles of a triangle
• Where A ≥ B ≥ C ≥ 0
– Let U be the universe of triangles, i.e.,
• U = {(A,B,C) | A ≥ B ≥ C ≥ 0; A+B+C = 180°}
– Let’s define a number of geometric shapes
• I Approximate isosceles triangle
• R Approximate right triangle
• IR Approximate isosceles and right triangle
• E Approximate equilateral triangle
• T Other triangles
81
Inference : Example
• We can infer membership values for all of these
triangle types through the method of inference
• For Isosceles,
– µi (A,B,C) = 1- (1/60)* min(A-B, B-C)
83
Inference : Example
• For equilateral triangle
– µE (A,B,C) = 1 - 1/180° * (A-C)
– When A = B = C then µE (A,B,C) = 1,
– A = 180° then µE (A,B,C) = 0
84
Inference : Question
• Find the membership values for the fuzzy triangle
as isosceles , right, equilateral and other triangle
85
Note : Neural Networks and Genetic
later on.
Fuzzy Set Theory so far
• Fuzzy Set
• Membership Functions
• Fuzzy Relations and compositions
Fuzzy Relations (R)
How to compute Fuzzy Relation
Operations on Fuzzy Relation
Note:
1. Let X, Y, Z are assumed to be universe of discourse for fuzzy sets for relation R & S..
2.Union and Intersection operations are defined over same set of elements of Relation R and
S.
Application of Fuzzy Relation