Introduction to Fuzzy Logic and

Neural Networks
 ARTIFICIAL NEURAL NETWORK (ANN)

• Artificial neural network (ANN) is a network of efficient computing systems the

central theme of which is borrowed from the analogy of biological neural
networks.
• ANNs are also named as “artificial neural systems” , “parallel distributed
processing systems,” “connectionist systems.”
• ANN acquires large collection of units that are interconnected in some pattern
to allow communications between units.
• These units also referred to as nodes or neurons, are simple processors which
operate in parallel.
• Every neuron is connected with other neuron through a connection link.
• Each connection link is associated with a weight having the information about
the input signal.
• This is the most useful information for neurons to solve a particular problem
because the weight usually inhibits the signal that is being communicated.
• Each neuron is having its internal state which is called the activation signal.
• Output signals, which are produced after combining the input signals and the
activation rule, may be sent to other units.
• It also consists of a bias ‘b’ whose weight is always 1
NEURAL NETWORK MODEL
 Why to use Fuzzy Logic in Neural Network

•Every neuron in ANN is connected with other neuron

through a connection link and that link is associated
with a weight having the information about the input
signal.
•Hence we can say that weights have the useful
information about input to solve the problems.
Following are some reasons to use fuzzy logic in
neural networks

•Fuzzy logic is largely used to define the weights, from

fuzzy sets, in neural networks.
•When crisp values are not possible to apply, then fuzzy
values are used.
•We know that training and learning help neural
networks perform better in unexpected situations. At that
time fuzzy values would be more applicable than crisp
values.
•When we use fuzzy logic in neural networks then the
values must not be crisp and the processing can be done
in parallel.
 Fuzzy Cognitive Map

• It is a form of fuzziness in neural networks.

Basically FCM is like a dynamic state machine
with fuzzy states (not just 1 or 0).
• Difficulty in using Fuzzy Logic in Neural
Networks
Difficulty in using Fuzzy Logic in Neural Networks

Despite having numerous advantages, there is also some difficulty while using
fuzzy logic in neural networks. The difficulty is related with membership rules, the
need to build fuzzy system, because it is sometimes complicated to deduce it with
the given set of complex data.
Neural-Trained Fuzzy Logic
The reverse relationship between neural network and fuzzy logic, i.e., neural
network used to train fuzzy logic is also a good area of study. Following are two
major reasons to build neural trained fuzzy logic −
New patterns of data can be learned easily with the help of neural networks
hence, it can be used to preprocess data in fuzzy systems.
Neural network, because of its capability to learn new relationship with new input
data, can be used to refine fuzzy rules to create fuzzy adaptive system.
 Neural-Trained Fuzzy Logic

The reverse relationship between neural network and fuzzy logic, i.e.,
neural network used to train fuzzy logic is also a good area of study.
Following are two major reasons to build neural trained fuzzy logic

•New patterns of data can be learned easily with the help of neural
networks hence, it can be used to preprocess data in fuzzy systems.
•Neural network, because of its capability to learn new relationship
with new input data, can be used to refine fuzzy rules to create fuzzy
adaptive system.
 Applications
Aerospace
In aerospace, fuzzy logic is used in the following areas

•Altitude control of spacecraft

•Satellite altitude control
•Flow and mixture regulation in aircraft deicing
vehicles
Automotive

In automotive, fuzzy logic is used in the following areas −

•Trainable fuzzy systems for idle speed control

•Shift scheduling method for automatic transmission
•Intelligent highway systems
•Traffic control
•Improving efficiency of automatic transmissions
 Business

In business, fuzzy logic is used in the

following areas −
•Decision-making support systems
•Personnel evaluation in a large company
 Defense

In defense, fuzzy logic is used in the following areas −

•Underwater target recognition
•Automatic target recognition of thermal infrared images
•Naval decision support aids
•Control of a hypervelocity interceptor
•Fuzzy set modeling of NATO decision making
 Electronics

In electronics, fuzzy logic is used in the following areas −

Control of automatic exposure in video cameras
•Humidity in a clean room
•Air conditioning systems
•Washing machine timing
•Microwave ovens
•Vacuum cleaners
 Finance

In the finance field, fuzzy logic is used in the

following areas
•Banknote transfer control
•Fund management
•Stock market predictions
 Industrial Sector

In industrial, fuzzy logic is used in following areas

•Cement kiln controls heat exchanger control
•Activated sludge wastewater treatment process control
•Water purification plant control
•Quantitative pattern analysis for industrial quality assurance
•Control of constraint satisfaction problems in structural
design
•Control of water purification plants
 Manufacturing

In the manufacturing industry, fuzzy logic is used in following

areas −
•Optimization of cheese production
•Optimization of milk production
 Marine

In the marine field, fuzzy logic is used in the following areas

•Autopilot for ships
•Optimal route selection
•Control of autonomous underwater vehicles
•Ship steering
 Medical

In the medical field, fuzzy logic is used in the following areas −

•Medical diagnostic support system
•Control of arterial pressure during anesthesia
•Multivariable control of anesthesia
•Modeling of neuropathological findings in Alzheimer's patients
•Radiology diagnoses
•Fuzzy inference diagnosis of diabetes and prostate cancer
 Securities

In securities, fuzzy logic is used in

following areas −
•Decision systems for securities trading
•Various security appliances
 Transportation

In transportation, fuzzy logic is used in the

following areas −
•Automatic underground train operation
•Train schedule control
•Railway acceleration
•Braking and stopping
 Pattern Recognition and Classification

Pattern Recognition and Classification

In Pattern Recognition and Classification, fuzzy logic is used in the following areas −
•Fuzzy logic based speech recognition
•Fuzzy logic based
•Handwriting recognition
•Fuzzy logic based facial characteristic analysis
•Command analysis
•Fuzzy image search
 Psychology

In Psychology, fuzzy logic is used in following

areas −
•Fuzzy logic based analysis of human behavior
•Criminal investigation and prevention based on
fuzzy logic reasoning
UNIT I INTRODUCTION TO FUZZY LOGIC Fuzzy
sets – properties of fuzzy sets – operations on
fuzzy sets. Fuzzy relations linguistic variables –
Linguistic approximation. Fuzzy statements:
Assignments, Conditional and unconditional
statements fuzzy rule base – fuzzy algorithm
What is Fuzzy Logic?

Fuzzy Logic resembles the human decision-making methodology. It deals with vague
and imprecise information. This is gross oversimplification of the real-world problems
and based on degrees of truth rather than usual true/false or 1/0 like Boolean logic.
Take a look at the following diagram. It shows that in fuzzy systems, the values are
indicated by a number in the range from 0 to 1. Here 1.0 represents absolute
truth and 0.0 represents absolute falseness. The number which indicates the value
in fuzzy systems is called the truth value.
• In other words, we can say that fuzzy logic is not
logic that is fuzzy, but logic that is used to describe
fuzziness. There can be numerous other examples
like this with the help of which we can understand
the concept of fuzzy logic.
• Fuzzy Logic was introduced in 1965 by Lofti A.
Zadeh in his research paper “Fuzzy Sets”. He is
considered as the father of Fuzzy Logic.
 Fuzzy Logic - Classical Set Theory

• A set is an unordered collection of different

elements. It can be written explicitly by listing
its elements using the set bracket. If the order
of the elements is changed or any element of
a set is repeated, it does not make any
changes in the set.
• Example
• A set of all positive integers.
• A set of all the planets in the solar system.
• A set of all the states in India.
• A set of all the lowercase letters of the
alphabet.
 Mathematical Representation of a Set

• Sets can be represented in two ways −

Roster or Tabular Form

• In this form, a set is represented by listing all the elements
comprising it. The elements are enclosed within braces
and separated by commas.
• Following are the examples of set in Roster or Tabular
Form −
• Set of vowels in English alphabet, A = {a,e,i,o,u}
• Set of odd numbers less than 10, B = {1,3,5,7,9}
• Set Builder Notation
• In this form, the set is defined by specifying a property that elements
of the set have in common. The set is described as A = {x:p(x)}

• Example 1 − The set {a,e,i,o,u} is written as

• A = {x:x is a vowel in English alphabet}
• Example 2 − The set {1,3,5,7,9} is written as
• B = {x:1 ≤ x < 10 and (x%2) ≠ 0}
• If an element x is a member of any set S, it is denoted by x∈S and if
an element y is not a member of set S, it is denoted by y∉S.
• Example − If S = {1,1.2,1.7,2},1 ∈ S but 1.5 ∉ S
Cardinality of a Set

• Cardinality of a set S, denoted by |S||S|, is the

number of elements of the set. The number is also
referred as the cardinal number. If a set has an infinite
number of elements, its cardinality is ∞∞.
• Example − |{1,4,3,5}| = 4,|{1,2,3,4,5,…}| = ∞
• If there are two sets X and Y, |X| = |Y| denotes two
sets X and Y having same cardinality. It occurs when
the number of elements in X is exactly equal to the
number of elements in Y. In this case, there exists a
bijective function ‘f’ from X to Y.
• |X| ≤ |Y| denotes that set X’s cardinality is less than or
equal to set Y’s cardinality. It occurs when the number
of elements in X is less than or equal to that of Y. Here,
there exists an injective function ‘f’ from X to Y.
• |X| < |Y| denotes that set X’s cardinality is less than
set Y’s cardinality. It occurs when the number of
elements in X is less than that of Y. Here, the function
‘f’ from X to Y is injective function but not bijective.
• If |X| ≤ |Y| and |X| ≤ |Y| then |X| = |Y|. The sets X
and Y are commonly referred as equivalent sets.
 Types of Sets

• Sets can be classified into many types; some

of which are finite, infinite, subset, universal,
proper, singleton set, etc.
• Finite Set
• A set which contains a definite number of
elements is called a finite set.
• Example − S = {x|x ∈ N and 70 > x > 50}
Infinite Set
• A set which contains infinite number of elements is called an infinite
set.
• Example − S = {x|x ∈ N and x > 10}

Subset
• A set X is a subset of set Y (Written as X ⊆ Y) if every element of X
is an element of set Y.
• Example 1 − Let, X = {1,2,3,4,5,6} and Y = {1,2}. Here set Y is a
subset of set X as all the elements of set Y is in set X. Hence, we can
write Y⊆X.
• Example 2 − Let, X = {1,2,3} and Y = {1,2,3}. Here set Y is a
subset (not a proper subset) of set X as all the elements of set Y is in
set X. Hence, we can write Y⊆X.
Proper Subset

• The term “proper subset” can be defined as

“subset of but not equal to”. A Set X is a proper
subset of set Y (Written as X ⊂ Y) if every
element of X is an element of set Y and |X| < |
Y|.
• Example − Let, X = {1,2,3,4,5,6} and Y = {1,2}.
Here set Y ⊂ X, since all elements in Y are
contained in X too and X has at least one
element which is more than set Y.
Universal Set
• It is a collection of all elements in a particular context or application. All the sets in that
context or application are essentially subsets of this universal set. Universal sets are
represented as U.
• Example − We may define U as the set of all animals on earth. In this case, a set of all
mammals is a subset of U, a set of all fishes is a subset of U, a set of all insects is a subset
of U, and so on.

Empty Set or Null Set

• An empty set contains no elements. It is denoted by Φ. As the number of elements in an
empty set is finite, empty set is a finite set. The cardinality of empty set or null set is zero.
• Example – S = {x|x ∈ N and 7 < x < 8} = Φ

Singleton Set or Unit Set

• A Singleton set or Unit set contains only one element. A singleton set is denoted by {s}.
• Example − S = {x|x ∈ N, 7 < x < 9} = {8}
Equal Set
• If two sets contain the same elements, they are said to be equal.
• Example − If A = {1,2,6} and B = {6,1,2}, they are equal as
every element of set A is an element of set B and every element of
set B is an element of set A.
Equivalent Set
• If the cardinalities of two sets are same, they are called equivalent
sets.
• Example − If A = {1,2,6} and B = {16,17,22}, they are equivalent
as cardinality of A is equal to the cardinality of B. i.e. |A| = |B| = 3
Overlapping Set
• Two sets that have at least one common element are
called overlapping sets. In case of overlapping sets −
• Example − Let, A = {1,2,6} and B = {6,12,42}.
There is a common element ‘6’, hence these sets
are overlapping sets.
 Disjoint Set

Two sets A and B are called disjoint sets if they do not have even one element in
common. Therefore, disjoint sets have the following properties −

n(A∩B)=ϕn(A∩B)=ϕ
n(A∪B)=n(A)+n(B)n(A∪B)=n(A)+n(B)

Example − Let, A = {1,2,6} and B = {7,9,14}, there is not a single common element,
hence these sets are overlapping sets.
 Operations on Classical Sets

• Set Operations include Set Union, Set

Intersection, Set Difference, Complement of
Set, and Cartesian Product.
 Union

• The union of sets A and B (denoted by A ∪ BA

∪ B) is the set of elements which are in A, in B,
or in both A and B. Hence, A ∪ B = {x|x ∈ A
OR x ∈ B}.
 Intersection

• The intersection of sets A and B (denoted by A

∩ B) is the set of elements which are in both A
and B. Hence, A ∩ B = {x|x ∈ A AND x ∈ B}.
 Difference/ Relative Complement

• The set difference of sets A and B (denoted by

A–B) is the set of elements which are only in A
but not in B. Hence, A − B = {x|x ∈ A AND x ∉
B}.
• Example − If A = {10,11,12,13} and B =
{13,14,15}, then (A − B) = {10,11,12} and (B − A)
= {14,15}. Here, we can see (A − B) ≠ (B − A)
 Complement of a Set

• The complement of a set A (denoted by A′) is

the set of elements which are not in set A.
Hence, A′ = {x|x ∉ A}.
• More specifically, A′ = (U−A) where U is a
universal set which contains all objects.
• Example − If A = {x|x belongs to set of add
integers} then A′ = {y|y does not belong to set
of odd integers}
 Cartesian Product / Cross Product

• The Cartesian product of n number of sets A1,A2,…

An denoted as A1 × A2...× An can be defined as all
possible ordered pairs (x1,x2,…xn) where x1 ∈ A1,x2
∈ A2,…xn ∈ An
• Example − If we take two sets A = {a,b} and B = {1,2},
• The Cartesian product of A and B is written as − A ×
B = {(a,1),(a,2),(b,1),(b,2)}
• And, the Cartesian product of B and A is written as −
B × A = {(1,a),(1,b),(2,a),(2,b)}
 Properties of Classical Sets

• Properties on sets play an important role for

obtaining the solution. Following are the
differe
• nt properties of classical sets −
Commutative Property
Having two sets A and B, this property states −
A∪B=B∪AA∪B=B∪A
A∩B=B∩A

Associative Property
Having three sets A, B and C, this property states −
A∪(B∪C)=(A∪B)∪CA∪(B∪C)=(A∪B)∪C
A∩(B∩C)=(A∩B)∩C

Distributive Property
Having three sets A, B and C, this property states −
A∪(B∩C)=(A∪B)∩(A∪C)A∪(B∩C)=(A∪B)∩(A∪C)
A∩(B∪C)=(A∩B)∪(A∩C)
Idempotency Property
For any set A, this property states −
A∪A=AA∪A=A
A∩A=AA∩A=A

Identity Property
For set A and universal set X, this property states −
A∪φ=AA∪φ=A
A∩X=AA∩X=A
A∩φ=φA∩φ=φ
A∪X=X
Transitive Property
Having three sets A, B and C, the property states −
If A⊆B⊆CA⊆B⊆C, then A⊆C
Fuzzy Logic - Set Theory
• Fuzzy sets can be considered as an extension and gross
oversimplification of classical sets. It can be best
understood in the context of set membership.
• Basically it allows partial membership which means that it
contain elements that have varying degrees of
membership in the set.
• From this, we can understand the difference between
classical set and fuzzy set. Classical set contains elements
that satisfy precise properties of membership while fuzzy
set contains elements that satisfy imprecise properties of
membership.
 Representation of fuzzy set

• Let us now consider two cases of universe of

information and understand how a fuzzy set
can be represented.
Operations on Fuzzy Sets
Properties of Fuzzy Sets
Associative Property
 Fuzzy Logic - Membership Function

• This fuzziness is best characterized by its

membership function. In other words, we can
say that membership function represents the
degree of truth in fuzzy logic.
Following are a few important points relating to the
membership function −

• Membership functions were first introduced in 1965 by

Lofti A. Zadeh in his first research paper “fuzzy sets”.
• Membership functions characterize fuzziness (i.e., all the
information in fuzzy set), whether the elements in fuzzy
sets are discrete or continuous.
• Membership functions can be defined as a technique to
solve practical problems by experience rather than
knowledge.
• Membership functions are represented by graphical forms.
• Rules for defining fuzziness are fuzzy too.
Fuzzification

• It may be defined as the process of

transforming a crisp set to a fuzzy set or a
fuzzy set to fuzzier set. Basically, this operation
translates accurate crisp input values into
linguistic variables.
• Following are the two important methods of
fuzzification −
Defuzzification

• It may be defined as the process of reducing a fuzzy set into

a crisp set or to convert a fuzzy member into a crisp member.
• We have already studied that the fuzzification process
involves conversion from crisp quantities to fuzzy quantities.
In a number of engineering applications, it is necessary to
defuzzify the result or rather “fuzzy result” so that it must be
converted to crisp result. Mathematically, the process of
Defuzzification is also called “rounding it off”.
• The different methods of Defuzzification are described below
−
 Fuzzy Logic - Approximate Reasoning

• Fuzzy Logic Rule Base

It is a known fact that a human being is always comfortable making conversations in
natural language. The representation of human knowledge can be done with the help
of following natural language expression −
IF antecedent THEN consequent
The expression as stated above is referred to as the Fuzzy IF-THEN rule base.
Canonical Form
Following is the canonical form of Fuzzy Logic Rule Base −
Rule 1 − If condition C1, then restriction R1
Rule 2 − If condition C1, then restriction R2
.
.
.
Rule n − If condition C1, then restriction Rn
 Interpretations of Fuzzy IF-THEN Rules

Fuzzy IF-THEN Rules can be interpreted in the following four forms −

• Assignment Statements
These kinds of statements use “=” (equal to sign) for the purpose of assignment. They are of
the following form −
a = hello
climate = summer
• Conditional Statements
These kinds of statements use the “IF-THEN” rule base form for the purpose of condition.
They are of the following form −
IF temperature is high THEN Climate is hot
IF food is fresh THEN eat.
• Unconditional Statements
They are of the following form −
GOTO 10
turn the Fan off
LINGUISTICS
 Linguistic Variable

• We have studied that fuzzy logic uses

linguistic variables which are the words or
sentences in a natural language.
• For example, if we say temperature, it is a
linguistic variable; the values of which are
very hot or cold, slightly hot or cold, very
warm, slightly warm, etc. The words very,
slightly are the linguistic hedges.
 Characterization of Linguistic Variable

• Following four terms characterize the linguistic

variable −
 Name of the variable, generally represented by x.
Term set of the variable, generally represented by
t(x).
Syntactic rules for generating the values of the
variable x.
Semantic rules for linking every value of x and its
significance.
 Propositions in Fuzzy Logic

• As we know that propositions are sentences expressed in any language

which are generally expressed in the following canonical form −
s as P
• Here, s is the Subject and P is Predicate.
• For example, “Delhi is the capital of India”, this is a proposition
where “Delhi” is the subject and “is the capital of India” is the
predicate which shows the property of subject.
• We know that logic is the basis of reasoning and fuzzy logic extends
the capability of reasoning by using fuzzy predicates, fuzzy-predicate
modifiers, fuzzy quantifiers and fuzzy qualifiers in fuzzy propositions
which creates the difference from classical logic.
 Fuzzy Predicate

• Almost every predicate in natural language is

fuzzy in nature hence, fuzzy logic has the
predicates like tall, short, warm, hot, fast, etc.
 Fuzzy-predicate Modifiers

• We discussed linguistic hedges above; we also

have many fuzzy-predicate modifiers which
act as hedges.
• They are very essential for producing the
values of a linguistic variable. For example,
the words very, slightly are modifiers and the
propositions can be like “water is slightly hot.”
 Fuzzy Quantifiers

• It can be defined as a fuzzy number which

gives a vague classification of the cardinality
of one or more fuzzy or non-fuzzy sets.
• It can be used to influence probability within
fuzzy logic. For example, the words many,
most, frequently are used as fuzzy quantifiers
and the propositions can be like “most people
are allergic to it.”
 Fuzzy Qualifiers

• Let us now understand Fuzzy Qualifiers. A Fuzzy

Qualifier is also a proposition of Fuzzy Logic.
Fuzzy qualification has the following forms −
• Fuzzy Qualification Based on Truth
• It claims the degree of truth of a fuzzy proposition.
• Expression − It is expressed as x is t. Here, t is a
fuzzy truth value.
• Example − (Car is black) is NOT VERY True.
 Fuzzy Qualification Based on Probability

• It claims the probability, either numerical or an

interval, of fuzzy proposition.
• Expression − It is expressed as x is λ.
Here, λ is a fuzzy probability.
• Example − (Car is black) is Likely.
 Fuzzy Qualification Based on Possibility

• It claims the possibility of fuzzy proposition.

• Expression − It is expressed as x is π. Here, π is
a fuzzy possibility.
• Example − (Car is black) is Almost Impossible.
Fuzzy algorithm
Thank you!