G.

NARAYANAMMA INSTITUTE OF TECHNOLOGY & SCIENCE

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
COURSE PLAN
Academic year: 2021-22 Semester: 2 Instruction period from: 28-02-2022 to 25-06-2022
Name of the Total no.
Subject: Class and No. of
Name of the subject faculty with of periods
code section students
designation / Sem
III B.Tech. Dr. M. Seetha
PE116DD Machine Learning Prof. & HoD 68 48
II Sem-A

Teaching Teachi References

Lec. ng
Name of the Topic Method## (Resources)
no. Aid$$ used
Introduction: Well posed learning problems, Designing a learning S/P P TB1
1
system Perspectives
2 Issues in machine learning, Types of learning. S/P, MM P TB1,TB2
Concept Learning: Concept learning task, Concept Learning as search S/P P TB1
3
through a hypothesis space
4 Finding maximally specific hypotheses S/P P TB1
5 Version spaces and the candidate elimination algorithm C&T B TB1
6 Problems solving using candidate elimination algorithm C&T B TB1
7 Remarks on them, Inductive Bias S/P P TB1
8 Revision S/P P TB1
9 Sample Question Paper Discussion C&T B --
Decision Tree Learning: Decision Tree representation and learning C&T,RTCS B TB1,W1
10
algorithm
Appropriate problems for Decision Tree Learning, Hypothesis space S/P P TB1
11 search in Decision Tree Learning, Inductive bias in Decision Tree:
Occam’s razor
12 Issues in Decision Tree Learning S/P P TB1
13 Learning with active queries. S/P P TB1
Neural Network Learning: Introduction, Neural Network S/P P TB1
14
representation
15 Appropriate problems for NN Learning S/P,GD P TB1
16 Perceptron S/P P TB1
Multi-layer networks S/P,DEMO P TB1,W2
17
and the back propagation algorithm, Remarks.
18 Revision & Sample Question papers Discussion C&T B --
19 Computational Learning Theory: PAC Hypothesis S/P P TB1
20 Sample complexity for finite hypothesis spaces S/P P TB1
21 Sample complexity for infinite hypothesis spaces S/P P TB1
22 Mistake bound model S/P P TB1
23 Irrelevant features: Multiplicative rules for weight tuning. S/P,JAR P TB1
24 Revision S/P P TB1
25 Bayesian Learning: Bayes theorem and concept learning S/P P TB1
Minimum Description Length Principle, Bayes optimal classifier, S/P P TB1
26
Gibbs Algorithm
27 Naïve Bayes Classifier S/P P TB1,TB2
28 Problem solving using Naïve Bayes Classifier C&T,RTSC B TB1
29 The EM algorithm S/P P TB1
30 Revision & Sample Question papers Discussion C&T B --
31 Instance – Based Techniques: K-nearest neighbor Learning S/P,DEMO P,B TB1
32 Locally Weighted Regression, Radial Basis Function S/P P,B TB1
33 Radial Basis Function, Case Based reasoning S/P P TB1
34 Remarks on Lazy vs Eager learning S/P,GD P TB1
35 Regression Techniques: Linear, Multiple & Logistic S/P P W3
36 Analytic Learning: Introduction ,Learning with perfect Domain S/P P TB1
 Teaching Teachi References
Lec. ng
Name of the Topic Method## (Resources)
no. Aid$$ used
Theories: PROLOG-EBG
37 Learning with perfect Domain Theories: S/P P TB1
PROLOG-EBG
38 Remarks on Explanation-Based Learning S/P P TB1
39 Revision & Sample Question papers Discussion C&T B --
40 Genetic Algorithm: Biological motivation S/P P TB1
41 Representing Hypothesis S/P P TB1
42 Genetic Operators, Fitness function and selection S/P P TB1
43 Hypothesis space search S/P P TB1
44 Genetic Programming S/P, JAR P TB1
45 Models of Evolution and Learning V P TB1
46 Parallelizing Genetic Algorithms S/P P TB1
47 Revision S/P P TB1
48 Sample Question papers Discussion C&T B --
##
Teaching Methods:C&T:-Chalk & Talk; S/P:-Slides/PPT;Videos; SEM: Seminar; DEMO; CHART;
ET/GL: Expert Talk/Guest Lecture; QUIZ; GD:-Group discussion; RTCS: Real time case studies; JAR:-
Journal article review; PD:-Poster design; OL:-Online lecture/Google class room

Experiential Learning: Hackathons(HK), Workshops(WS), Seminars(SEM), Virtual Lab(VL),

Simulation(SM), Role play(RP), Review web literature(RWL)

Practical Learning: Video(V), Demonstration(DEMO), Activity-based learning(ABL), Jigsaw(JS), Think-

Pair-Share(TPS), Flipped Classroom(FC), Plicker (P), Guest lecture(GL), Professional practice school(PPS),
GD/ debate(DB), Peer learning groups(PLG), MOOCs(OL) , Google Classroom(GC), PPT, Kahoot(KH) ,
Mind map(MM), Pogil(P), Language games(LG) , Poster presentation(PP)

Problem Solving: Project- based learning(PBL) , Real-time case studies(RTCS), Worksheets(WSH), Open
book test(OBT) , Proto-type model(PTM) , Cross words(CW), Research projects(RP) , Viva(V), Public
Speaking(PS)
$$
Teaching Aids: Projector(P) ; Board(B); etc

TEXT BOOKS:
TB1: Tom M. Mitchell, Machine Learning, McGraw Hill Education, Edition2013.
TB2: Kevin Murphy, Machine Learning: A Probabilistic Perspective, MITPress, 2012.

REFERENCES BOOKS:
RB1: Trevor Hasti, Robert Tibshirani and Jerome Friedman, The Elementsof Statistical Learning,
2nd Edition, Springer Series in Statistics, 2001.
RB2: Stephen Marsland, Machine Learning - An Algorithmic Perspective, CRC Press, 2009.

Online Resources
W1:http://ndl.iitkgp.ac.in/document/TVBkSVpKTGZKMXhTTXJaYkIyeisrWEo3MzJCZzlYTUx5d
TRMOEJ0WWNnZzh2N3N5Ui9JZWljYk1zODlsTm9NWUQxaERjVHBWZmUwUDY2c2lWMnExRWc9PQ

W2:https://cse22-iiith.vlabs.ac.in/exp/forward-neural-networks/

W3:http://ndl.iitkgp.ac.in/document/
SitNSUNNU0MxTmxYeTZzbUo5Q0F2N1dkczVVSW1pK2g5NGZhNTB5dnA0WGpwdzNZWFEwTnNCc
WRNdm45bUd4TWJWVmErRWx5Yk1VSHg5cHV4N2xHbWc9PQ

Signature of the Faculty

Date: