Soft Computing Unt 2
Soft Computing Unt 2
Here, are certain situations when you better not use Fuzzy
Logic:
Rule Base:
It contains all the rules and the if-then conditions offered by the
experts to control the decision-making system. The recent
update in fuzzy theory provides various methods for the design
and tuning of fuzzy controllers. This updates significantly
reduce the number of the fuzzy set of rules.
Fuzzification:
Fuzzification step helps to convert inputs. It allows you to
convert, crisp numbers into fuzzy sets. Crisp inputs measured by
sensors and passed into the control system for further
processing. Like Room temperature, pressure, etc.
Inference Engine:
It helps you to determines the degree of match between fuzzy
input and the rules. Based on the % match, it determines which
rules need implment according to the given input field. After
this, the applied rules are combined to develop the control
actions.
Defuzzification:
At last the Defuzzification process is performed to convert the
fuzzy sets into a crisp value. There are many types of techniques
available, so you need to select it which is best suited when it is
used with an expert system.
Summary
● The term fuzzy mean things which are not very clear or
vague
● The term fuzzy logic was first used with 1965 by Lotfi
Zadeh a professor of UC Berkeley in California
● Fuzzy logic is a flexible and easy to implement machine
learning technique
● Fuzzy logic should not be used when you can use common
sense
● Fuzzy Logic architecture has four main parts 1) Rule
Basse 2) Fuzzification 3) Inference Engine 4)
Defuzzification
● Fuzzy logic takes truth degrees as a mathematical basis on
the model of the vagueness while probability is a
mathematical model of ignorance
● Crisp set has strict boundary T or F while Fuzzy boundary
with a degree of membership
● A classical set is widely used in digital system design
while fuzzy set Used only in fuzzy controllers
● Auto transmission, Fitness management, Golf diagnostic
system, Dishwasher, Copy machine are some areas of
Fuzzy Logic applications
● Fuzzy logic in Soft Computing helps you to control
machines and consumer products
Membership Function
To learn about classical and Fuzzy set theory, firstly you have to
know about what is set.
Set
Types of Set:
Classical Set
The elements in the set are enclosed within the brackets and
separated by the commas.
Following are the two examples which describes the set in
Roaster or Tabular form:
Example 1:
Example 2:
Set of Prime Numbers less than 50: X={2, 3, 5, 7, 11, 13, 17, 19,
23, 29, 31, 37, 41, 43, 47}.
2. Set Builder Form: Set Builder form defines a set with the
common properties of an element in a set. In this form, the set is
represented in the following way:
A = {x:p(x)}
The set {2, 4, 6, 8, 10, 12, 14, 16, 18} is written as:
B = {x:2 ≤ x < 20 and (x%2) = 0}
1. Union:
This operation is denoted by (A U B). A U B is the set of those
elements which exist in two different sets A and B. This
operation combines all the elements from both the sets and make
a new set. It is also called a Logical OR operation.
It can be described as:
A ∪ B = { x | x ∈ A OR x ∈ B }.
Example:
Set A = {10, 11, 12, 13}, Set B = {11, 12, 13, 14, 15}, then A ∪
B = {10, 11, 12, 13, 14, 15}
2. Intersection
This operation is denoted by (A ∩ B). A ∩ B is the set of those
elements which are common in both set A and B. It is also
called a Logical OR operation.
It can be described as:
A ∩ B = { x | x ∈ A AND x ∈ B }.
Example:
Set A = {10, 11, 12, 13}, Set B = {11, 12, 14} then A ∩ B =
{11, 12}
3. Difference Operation
This operation is denoted by (A - B). A-B is the set of only
those elements which exist only in set A but not in set B.
It can be described as:
A - B = { x | x ∈ A AND x ∉ B }.
A′ = {x|x ∉ A}.
A ∪ B = B ∪ A
A∩B=B∩A
2. Associative Property:
This property also provides the following two states but these
are obtained by three different finite sets A, B, and C:
A ∪ (B ∪ C) = (A ∪ B) ∪ C
A ∩ (B ∩ C) = (A ∩ B) ∩ C
3. Idempotency Property:
This property also provides the following two states but for a
single finite set A:
A ∪ A = A
A∩A=A
4. Absorption Property
This property also provides the following two states for any two
finite sets A and B:
A ∪ (A ∩ B) = A
A ∩ (A ∪ B) = A
5. Distributive Property:
This property also provides the following two states for any
three finite sets A, B, and C:
A∪ (B ∩ C) = (A ∪ B)∩ (A ∪ C)
A∩ (B ∪ C) = (A∩B) ∪ (A∩C)
6. Identity Property:
This property provides the following four states for any finite set
A and Universal set X:
A ∪ φ =A
A ∩ X = A
A ∩ φ = φ
A∪X=X
7. Transitive property
This property provides the following state for the finite sets A,
B, and C:
If A ⊆ B ⊆ C, then A ⊆ C
8. Ivolution property
This property provides following state for any finite set A:
9. De Morgan's Law
This law gives the following rules for providing the
contradiction and tautologies:
Fuzzy Set
Given à and B are the two fuzzy sets, and X be the universe of
discourse with the following respective member functions:
The operations of Fuzzy set are as follows:
1. Union Operation: The union operation of a fuzzy set is
defined by:
μA∪B(x) = max (μA(x), μB(x))
Example:
Let's suppose A is a set which contains following elements:
then,
For X2
For X3
For X4
μA∪B(X4) = max (μA(X4), μB(X4))
μA∪B(X4) = max (0.4, 0.9)
μA∪B(X4) = 0.9
then,
For X2
For X3
μA∩B(X3) = min (μA(X3), μB(X3))
μA∩B(X3) = min (0.5, 0.4)
μA∩B(X3) = 0.4
For X4
then,
μĀ(X1) = 1-μA(X1)
μĀ(X1) = 1 - 0.3
μĀ(X1) = 0.7
For X2
μĀ(X2) = 1-μA(X2)
μĀ(X2) = 1 - 0.8
μĀ(X2) = 0.2
For X3
μĀ(X3) = 1-μA(X3)
μĀ(X3) = 1 - 0.5
μĀ(X3) = 0.5
For X4
μĀ(X4) = 1-μA(X4)
μĀ(X4) = 1 - 0.1
μĀ(X4) = 0.9