ISC_Unit_I_Topic-1
ISC_Unit_I_Topic-1
Lesson Plan
Prerequisites
Text Books:
1. J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, Pearson, 2015.
2. Samir Roy, Udit Chakraborty, “Introduction to Soft Computing Neuro-Fuzzy and Genetic Algorithms”, Pearson, 2013
Reference Books:
1. Davis E.Goldberg, “Genetic Algorithms: Search, Optimization and Machine Learning”, Addison Wesley, 2009
2. Kumar S.Ray, “Soft Computing and Its Applications, Volume Two: Fuzzy Reasoning and Fuzzy Control”, CRC Press, 2014
3. Saroj Kaushik Sunita Tiwari, “ Soft Computing : Fundamentals Techniques & Applications”, Tata McGrawHill, 2018
4. Nunes Silva, I., Hernane Spatti, D., Andrade Flauzino, R., Liboni, L.H.B., dos Reis Alves, S.F.,“Artificial Neural Networks - A Practical Course”,
Springer, 2017
5. N.P.Padhy, S.P.Simon, “Soft Computing with MATLAB Programming”, Oxford University Press, 2015
UNIT –I
INTRODUCTION
Topics/Subtopics Lecture
Page No.
1 1.1 Introduction: What is Soft Online [CO1][ PO1] TB1:11,
Computing? Brief descriptions
of different components of
soft computing, Difference
between Hard and soft
computing,
References
Detail Description of Mode of
Unit-
Hour
No.
Topics/Subtopics Lecture
I
Page No.
3 1.3 Neural Networks: Basic Online [CO1][ PO1] TB1:11-13
Concept of Neural Networks
4 1.4 Models of an artificial Online [CO1][ PO1] TB1:13-16
Neuron, Various activation
functions
5 1.5 Neural Network Architecture Online [CO1][ PO1] TB1:16-19
& Characteristics, Different
Learning methods
6 1.6 Introduction to Early ANN Online [CO1][ PO1] TB1:19-20
architectures (basics only)
McCulloch & Pitts Model
7 1.7 Perceptron, ADALINE, Online [CO1][ PO1] TB1:22-24
MADALINE
8 1.8 Back Propagation Neural Online [CO1][ PO1] TB1:25-27
Network
Unit-
Hour
No.
Topics/Subtopics Lecture
I
Page No.
9 1.9 Back propagation Learning Online [CO1][ PO1] TB1:28-30
Algorithm
10 1.10 Example of BPN , Effect of Online [CO1][ PO1] TB1:
Tuning parameters of the
BPN Network,
11 1.11 Associative Memory: Online [CO1][ PO1] TB1:
Autocorrelators,
Hetrocorrelators
12 1.12 Energy function for BAM, Online [CO1][ PO1] TB1:
Exponential BAM.
References
Detail Description of Mode of
Unit-
Hour
No.
II
Topics/Subtopics Lecture
Page No.
13 2.1 Fuzzy set Vs Crisp sets Online [CO2][ PO1] TB1:
14 2.2 Fuzzy Sets – Properties Online [CO2][ PO1] TB1:
15 2.3 Fuzzy Membership Online [CO2][ PO1] TB1:
Functions
16 2.4 Fuzzy Set Operations Online [CO2][ PO1] TB1:
17 2.5 Crisp and Fuzzy Relations Online [CO2][ PO1] TB1:
18 2.6 Fuzzy Relation Operations Online [CO2][ PO1] TB1:
19 2.7 Crisp logic, Propositional Online [CO2][ PO1] TB1:
logic, Predicate Logic
20 2.8 Fuzzy logic – Quantifier – Online [CO2][ PO1] TB1:
Inference
21 2.9 Fuzzy Rule based system Online [CO2][ PO1] TB1:
22 2.10 Defuzzification Methods Online [CO2][ PO1] TB1:
References
Sl. No.
Unit-
Hour
Date COs &POs Text Book
III
Topics/Subtopics Lecture
Page No.
23 3.1 Fundamentals of genetic Online [CO1][ PO1] TB1:
algorithms
24 3.2 Encoding, Fitness functions Online [CO1][ PO1] TB1:
25 3.3 Reproduction Online [CO1][ PO1] TB1:
26 3.4 Genetic Modeling: Cross Online [CO1][ PO1] TB1:
over
27 3.5 Different Cross overs Online [CO1][ PO1] TB1:
28 3.6 Inversion and deletion Online [CO1][ PO1] TB1:
29 3.7 Mutation operator Online [CO1][ PO1] TB1:
30 3.8 Bit-wise operators & its Online [CO1][ PO1] TB1:
uses in GA.
31 3.9 Convergence of Genetic Online [CO1][ PO1] TB1:
algorithm
32 3.10 Applications, Real life Online [CO1][ PO1] TB1:
Problems.
References
Sl. No.
Unit-
Hour
Date COs &POs Text Book
IV
Topics/Subtopics Lecture
Page No.
33 4.1 Hybrid system Online [CO1][ PO1] TB1:
34 4.2 Neural Networks Hybrid Online [CO1][ PO1] TB1:
system
35 4.3 Fuzzy Hybrid system Online [CO1][ PO1] TB1:
36 4.4 Genetic Algorithm Hybrid Online [CO1][ PO1] TB1:
system
37 4.5 Genetic Algorithm based Online [CO1][ PO1] TB1:
Back propagation Networks
38 4.6 GA based weight Online [CO1][ PO1] TB1:
determination
39 4.7 Fuzzy Back Propagation Online [CO1][ PO1] TB1:
Networks
40 4.8 Fuzzy logic controller Online [CO1][ PO1] TB1:
Concept of Computation
Soft Computing Techniques
Hard computing
Soft computing
How soft computing?
Hard computing vs. Soft computing
Computin
Antecedent g Consequent
y = f(x)
Control Action
Figure: Basic of computing
Antecedent: A thing that existed before or logically precedes another.
y = f(x), f is a mapping function, f is also called formal methods
or an Algorithm to solve the problem
Control Action should an unambiguous and accurate.
Consequent: Following as a result or effect.
It should provide precise solution.
It is suitable for problem, which is easy to model mathematically.
19 Department of CSE, GIET University, Gunupur Thursday, February 27, 20
Soft Computing Soft Computing Techniques
Neural
Neuro Fuzzy Network Neuro Genetic
Neuro Fuzzy
Genetic
Fuzzy Genetic
Logic Algorithm
Fuzzy Genetic
Soft computing
Bank with
Soft computing maximum
return
Answer: a
a) Charles Darwin
b) Lofti A Zadeh
c) Rechenberg
d) Mc_Culloch
Answer: b
a) Neural Network
b) Fuzzy Logic
c) Genetic Algorithm
d) Evolutionary Computing
Answer: a