Course Plan

Duration of Session: 1 No. of Sessions : 45

Faculty Name: Deepa.T.P. Course Name : INTELLIGENT CONTROL Course Code:18RADE55X Hr

Nature of Pedagogy/Prior Program Outcomes Course Outcomes

Sessions Modul Session Reading/Links Achieved Achieved
Description No. of Sessions Learning Outcomes
e No /Resources

1 Linear Algebra, Graph theory, calculus, Problem Solving (1 .5

probability Hrs) & Lecture with
Bridge Set Theory, fundamentals of programming 2 PPT(30 Mins)
2 and algorithms with prior formative
assessment
Introduction – Biological neuron 1 Case Discussion (30
Mins) Lecture with
3 PPT(30 Mins)

4 Artificial neuron – Neuron model 2 Case Discussion (30

Mins) Lecture with
5 PPT(1 .5Hrs)
6 Supervised and unsupervised learning 2 Case Discussion (30
Architectures-ANN 1 Mins) Lecture with
7
PPT(1 .5Hrs)
8 Single layer – Multi layer feed forward 2 PPT (1.5hrs),
network Examples(30 Mins)
9

10 Learning algorithm- Back propagation PPT (1,5 hour), case

network. 2 studies,
11 programming
Feedback networks PPT(20 Mins),
12 1 Problem solving (35
mins)
Discrete time Hopfield networks PPT(20 Mins),
Problem solving (35
13 1 mins)

Neural Network for 16 Lecture (1 hr), case

2
control study (1 hr)
17
18 Lecture (1 hr), case
study (1 hr)
19
20 1 Lecture (1 hr)
21 Lecture (1 hr)
22
Assessment 14 1
Group Activity Group
15 1
Activity
Lecture(30 min),
4 22 1 Case study (20 min)

Bayes Classifier
 Lecture (20 min),
23 1 Problem solving (30
min)
Bayes Classifier problem
24 1 solving(40min),
Lecture(10mins)
25 PPT(1hr), case
2 studies(1hr)
26
PPT (30mins),
27 1
Example(20)mins
5 PPT(1hr), case
28 2 studies(1hr)

Hidden Markov PPT (1hr), case

Models 29 2 studies(1hr)

30 1 PPT (!hr)
PPT(30min),
6 31 1
examples(30mins)
PPT(1hr), case
32 2 studies(1hr)
Clustering
PPT(1hr), case
33 Partitional clustering 2 studies(1hr)

PPT(30mins), case
34 clustering large data sets. 1
studies(20mins)
Group Activity Students present different scenario which Survey &
35 can be solved using Naïve Bayes theorem 1 presentation
and clustering
Class discussion: Based on student
Assessment 36 performance in quiz, MCQs and Assignment 1
using Google Classroom
7 37 Introduction 1 PPT(1hr)

38 Methods for constructing ensembles of PPT(1.5hrs), case

Combination of 2
classifiers study(30mins)
Classifiers 39
40 PPT(1.5hrs), case
methods for combining classifiers. 2
41 study(30mins)

8 42
PPT(1hr),
43 Case Study: Handwritten Digit Recognition 3
Demonstration(2hrs)
44
Case Studies
45 Use of the nearest
Case Study:
PPT(1hr),
46 neighbor algorithm for 3
Demonstration(2hrs)
47 transaction databases
Class Discussion: Based on student
Assessment 48 performance in quiz, MCQs and case 1
analysis using Google Classroom
Discussion of Previous year sample Question
Revision 49 1
papers
 Nature of Pedagogy/Prior Program Outcomes Course Outcomes
Sessions Modul Session Reading/Links Achieved Achieved
Description No. of Sessions Learning Outcomes
e No /Resources

Course Name : INTELLIGENT Course Code:18RADE55X No. of Sessions : 45

Faculty Name:
48 CONTROL 1
Deepa.T.P.
Group Activity Students Groups present their analysis of Analysis & Program Outcomes
49-50 financial statements of select companies 2 Presentation Achieved

Concept Linear Algebra, Graph theory, calculus, Problem Solving (1 .5

6 51-52 2
Essentials probability Hrs) & Lecture with
Engaged Learning Set Theory, fundamentals of programming PPT(30 Mins)
53-57 and algorithms 5 with prior formative
assessment
What is Pattern recognition? Data sets for 1 Case Discussion (30
58 pattern recognition,paradigms for pattern Mins) Lecture with
recognition. PPT(30 Mins)

4 Data structures for pattern representation 2 Case Discussion (30

Mins) Lecture with POs: 1,2
PPT(1 .5Hrs) Explain and define concepts
PSO:2 1
of pattern recognition
5
Pattern
Representation-1 6 Representation of clusters 2 Case Discussion (30
Mins) Lecture with
PPT(1 .5Hrs)
7

8 proximity measures, size of pattern Problem Solving (30

Mins)
PPT (20 Mins)
2 9 Abstractions of the data set PPT (40 mins),
1 Examples(10 Mins) Perform feature POs: 1,2,3,4,5,6 3
PSO:2
extraction and selection
### Feature selection and extraction 2 PPT (1 hour), case
through various
studies,
### programming algorithms
Pattern
Representation-2 12 Evaluation of Classifiers PPT(20 Mins),
Problem solving (35
mins)
13 Evaluation of clustering PPT(20 Mins),
Problem solving (35
1 mins)
3 16 Nearest neighbor algorithm 2 Lecture (1 hr), case Understand the Bayesian POs: 1,2 2
study (1 hr) PSO:2
17 approach to pattern
18 variants of NN Algorithm 2 Lecture (1 hr), case recognition
Nearest Neighbor study (1 hr)
19
20 Efficient algorithms Lecture (1 hr)

21 data reduction Lecture (1 hr)

14 Class discussion: Based on student performance in quiz, MCQs and Assignment using Google Classroom

15 Team activity to practise classification using Feature selection an Group Activity

4 22 Bayes theorem 1
Lecture(30 min), To apply Markov’s POs: 1,2,3,4,5,6 5
Case study (20 min) PSO:2
approach and clustering
for pattern recognition

Bayes Classifier
 4 To apply Markov’s POs: 1,2,3,4,5,6 5
PSO:2
approach and clustering
23 Lecture (20 min),
for pattern recognition
Minimum error rate classifier 1 Problem solving (30
min)
24 problem
Bayes Classifier estimation of probabilities 1 solving(40min),
Lecture(10mins)
25 PPT(1hr), case
Naïve Bayes classifier 2 studies(1hr)
26
27 Bayesian belief network 1
PPT (30mins),
Example(20)mins
5 28 PPT(1hr), case To combine various POs: 1,2,3,4,5,6 4
Markov models for classification 2 studies(1hr) PSO:2
classifiers and boost their
Hidden Markov Models 29 PPT (1hr), case performance
Hidden markov models 2 studies(1hr)

30 classification using HMM 1 PPT (!hr)

6 31 Why is clustering important? 1

PPT(30min), To apply Markov’s POs: 1,2,3,4,5,6 5
examples(30mins) PSO:2
approach and clustering
32 PPT(1hr), case
for pattern recognition
Hierarchical algorithm 2 studies(1hr)
Clustering
33 PPT(1hr), case
Partitional clustering 2 studies(1hr)

34 clustering large data sets. 1

PPT(30mins), case
studies(20mins)
35 Students present different scenario which can be solved using Naïve Bayes theorem and clustering

36 Class discussion: Based on student performance in quiz, MCQs and Assignment using Google Classroom

7 37 Introduction 1 PPT(1hr) To combine various POs: 1,2,3,4,5,6 4

PSO:2
38 Methods for constructing ensembles of classif 2 PPT(1.5hrs), classifiers and boost their
case performance
Combination of Classifiers
39 study(30mins)
40 methods for combining classifiers. 2 PPT(1.5hrs),
41 case
8 42 Case Study: Handwritten Digit Recognition 3 study(30mins)
PPT(1hr), Perform feature extraction and POs: 1,2,3,4,5,6 3
selection through various PSO:2
43 Demonstration( algorithms
44 2hrs)
Case Studies
45 3
Case Study: Use of the nearest neighbor algorithm PPT(1hr),
for transaction databases
46 Demonstration(
47 2hrs)
48
Revision 49 Discussion of Previous year sample Question 1