Introduction to Soft Computing

By:
Piyush Agnihotri
Electrical and Electronics Engineering
 Introdution
Soft Computing refers to a consortium (Union) of
computational methodologies.
It was first introduced by Lofti A. Zadeh of
university of California, Berkley, U.S.A..
Some of its principal components include,
1. Fuzzy Logic (FL)
2. Neural Networks (NN) ;and
3. Genetic Algorithms (GA).
All having their roots in Artificial Intelligence.
 Introduction
In Todays highly integrated world, when
solutions to problems are cross-disciplinary in
nature, soft computing promises to become a
powerful means for obtaining solutions to
problems,
1. Quickly,
2. Yet Accurately,
3. Acceptably.
 Hybrid Systems
1. Neuro-Fuzzy System
2. Fuzzy-Genetic System
3. Neuro-Genetic System

Their healthy integration has resulted in

extending the capabilities of the technologies
to more effective and efficient problem
solving methodologies used in the design of
intelligent systems.
Introduction to Artificial
Intelligence Systems
 Artificial Intelligence
AI is an area of computer science
concerned with the designing
intelligent computer Systems,
i.e., systems that exhibit the
characteristics we associate with
the intelligence in human
behaviour. (Avron Barr &
Feigenbaum, 1981)
AI is a branch of computer
science that is concerned with
the automation of intelligent
behavior. (Luger and
Stubblefield, 1993)
 Artificial Intelligence
How ever the intelligence is not very well defined
and therefore has been less understood.
Consequently, tasks associated with the
intelligence such as,
1. Learning
2. Intuition (an ability to understand or know something immediately based on your feelings rather than facts)

3. Creativity
4. Inference, (a conclusion reached on the basis of evidence and reasoning)
> all seem to have been partially understood.
 Some of the technology in its Fold
1. Expert Systems
2. Neural Networks
3. Fuzzy logic Soft
Computing
4. Cellular Automata
5. Probabilistic Reasoning.
Neural Networks
 Introduction to Neural Networks
NN are simplified models of the biological
nervous system and therefore have drawn their
motivation from the kind of computing
performed by a human brain.
An NN, in general, is a highly interconnected
network of a large number of processing
elements called Neurons in an architecture
inspired by the brain.
An NN can be massively parallel and therefore is
said to exhibit parallel distributed processing.
 Introduction to Neural Networks
Few Characteristics of NN are:-
1. Mapping capabilities
2. Pattern Association
3. Generalization
4. Robustness
5. Fault Tolerance
6. Parallel and High Speed Information Processing.
 Introduction to Neural Networks
Neural Network learns by examples.
They can be trained with the known examples of
a problem to acquire knowledge about it.
Once trained, the network can be put to effective
use in solving unknown or untrained
instances of the problem.
Neural Network adopts various learning
mechanisms of which supervised learning and
unsupervised learning methods.
 Introduction to Neural Networks
Supervised learning Un-supervised learning
In this method, a teacher However in this method,
is assumed to be present there is no teacher
during the learning process, present to hand over the
i.e., the network aims to desired output and the
minimize the error
between the target network therefore tries to
(desired) output presented learn by itself, organizing
by the teacher and the the input instances of the
computed output, to problem.
achieve better
performance.
Neural Network Architectures
Single Layer Feed-
Forward Networks

Multi Layer Feed-

Forward Networks

Recurrent Networks
Some well known Neural Network
Architectures
Back-propagation Network

Perceptron

ADALINE( Adaptive Linear Elements)

Associative Memory

Boltzmann Machine

Adaptive Resonance Theory (ART)

SOFM (Self organizing feature map)

Hopfield Network
Fuzzy Logic
 Introduction to Fuzzy logic
Fuzzy Set theory was proposed in 1965 by sir
Lofti A. Zadeh, is a generalization of classical set
theory.
Fuzzy logic deals with Uncertainty.
Uncertainty could arise due to :-
1. Generality
2. Vagueness
3. Ambiguity
4. Chance
5. Incomplete Knowledge
 Introduction to Fuzzy logic
Def:- A Fuzzy Set can be defined
mathematically by assigning to each possible
individual in the universe of discourse, a value
representing its grade of membership.
This grade corresponds to the degree to which
that individual is similar or compatible with
the concept represented by the fuzzy set.
In other words, fuzzy set support a flexible
sense of membership of elements to a set.
 Introduction to Fuzzy logic
Classical Set Theory
In this, an element either
belongs to or does not
belong to a set and hence,
such set are termed as crisp
sets.
Just as crisp set theory has
influenced symbolic logic,
i.e., such as True or False.
Fuzzy Set Theory
But in this, many degrees of
membership (between 0
and 1) are allowed.
In Fuzzy logic multivalued
truth values such as true,
absolutely true, fairly true,
false, absolutely false, partly
false and so forth are
supported.
Genetic Algorithm
 Introduction to Genetic Algorithm
Genetic Algorithm initiated and developed in
the early 1970s by John Holland.
GAs perform directed random searches
through a given set of alternatives with the
aim of finding the best alternative with
respect to the given criteria of goodness.
These criteria are required to be expressed in
terms of an objective function which is usually
referred to as a fitness function.
 Introduction to Genetic Algorithm
Fitness is defined as a figure of merit, which is to be
either maximized or minimized.
It is further required that the alternative to be coded in
some specific finite length which consist of symbols
from some finite alphabet. These strings are called
CHROMOSOMES and the symbols that form the
chromosomes are known as Genes.
In the case of binary alphabet (0,1) the chromosomes
are binary strings and in the case of real alphabet (0-9)
the chromosome are decimal strings.
 Introduction to Genetic Algorithm
GAs is similar to human chance of bringing offspring's.
The genetic inheritance operators are used such as:-
1. Reproduction
2. Cross over
3. Mutation
4. Inversion
5. Dominance
6. Deletion
7. Duplication
8. Translocation
9. Segregation
10. Speciation
11. Migration
12. Sharing
13. Mating