Lovely Professional University, Punjab

Course Code Course Title Course Planner

INT417 MACHINE LEARNING ALGORITHMS 23360::Dr. Rahul

Course Outcomes :Through this course students should be able to

CO1 :: categorize the machine learning problems based on learning rules.

CO2 :: apply the key concepts that form the core of machine learning.
CO3 :: develop the key algorithms for the system that are intelligent enough to make the decisions.
CO4 :: contrast the statistical, computational and game-theoretic models for learning.

TextBooks ( T )
Sr No Title Author Publisher Name
T-1 MACHINE LEARNING THOMAS MITCHELL MCGRAW HILL EDUCATION
Reference Books ( R )
Sr No Title Author Publisher Name
R-1 PATTERN CLASSIFICATION RICHARD O. DUDA, WILEY
PETER E. HART, DAVID
G. STORK

Relevant Websites ( RW )
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 https://towardsdatascience.com/measuring-the-power-of-a-classifier-c765a7446c1c VC Dimension

RW-2 https://link.springer.com/chapter/10.1007/11776420_8 Rademacher complexity

RW-3 https://www.sciencedirect.com/science/article/pii/S0097316500931601 Natarajan Dimension

RW-4 https://towardsdatascience.com/learning-theory-agnostic-probably-approximately- PAC learning

correct-learning-dfd0d7c76467
RW-5 https://www.datascienceblog.net/post/machine-learning/performance-measures-multi- Performance Measures for Multi-Class Problems
class-problems/
RW-6 http://mathworld.wolfram.com/MaximumLikelihood.html Maximum Likelihood

RW-7 https://www.sciencedirect.com/topics/mathematics/structural-risk-minimization Structural Risk Minimization

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 RW-8 https://www.geeksforgeeks.org/q-learning-in-python/ Q learning

RW-9 https://www.hackerearth.com/practice/machine-learning/machine-learning- Decision Tree Learning

algorithms/ml-decision-tree/tutorial/
RW-10 https://sebastianraschka.com/Articles/2014_kernel_density_est.html Kernel density estimation

RW-11 https://www.sciencedirect.com/topics/computer-science/minimum-description-length Minimum Description Length

Audio Visual Aids ( AV )

Sr No (AV aids) (only if relevant to the course) Salient Features
AV-1 https://www.coursera.org/lecture/guided-tour-machine-learning-finance/the-no-free- No free lunch theorem
lunch-theorem-a0rXt

LTP week distribution: (LTP Weeks)

Weeks before MTE 7
Weeks After MTE 7
Spill Over (Lecture) 7

Detailed Plan For Lectures

Week Lecture Broad Topic(Sub Topic) Chapters/Sections of Other Readings, Lecture Description Learning Outcomes Pedagogical Tool Live Examples
Number Number Text/reference Relevant Websites, Demonstration/
books Audio Visual Aids, Case Study /
software and Virtual Images /
Labs animation / ppt
etc. Planned
Week 1 Lecture 1 Introduction to machine T-1 Lecture 1 will be Students will be able Class room
learning(learning) considered as Lecture to understand various discussion using
Zero and Lecture 2 will scenarios about the power point
be having basic learning in any presentation,
introduction to machine machine. demonstration
learning. using videos
Introduction to machine T-1 Lecture 1 will be Students will be able Class room
learning(need of machine considered as Lecture to understand various discussion using
learning) Zero and Lecture 2 will scenarios about the power point
be having basic learning in any presentation,
introduction to machine machine. demonstration
learning. using videos
Introduction to machine T-1 Lecture 1 will be Students will be able Class room
learning(types of learning) considered as Lecture to understand various discussion using
Zero and Lecture 2 will scenarios about the power point
be having basic learning in any presentation,
introduction to machine machine. demonstration
learning. using videos

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 1 Lecture 2 Introduction to machine T-1 Lecture 1 will be Students will be able Class room
learning(learning) considered as Lecture to understand various discussion using
Zero and Lecture 2 will scenarios about the power point
be having basic learning in any presentation,
introduction to machine machine. demonstration
learning. using videos
Introduction to machine T-1 Lecture 1 will be Students will be able Class room
learning(need of machine considered as Lecture to understand various discussion using
learning) Zero and Lecture 2 will scenarios about the power point
be having basic learning in any presentation,
introduction to machine machine. demonstration
learning. using videos
Introduction to machine T-1 Lecture 1 will be Students will be able Class room
learning(types of learning) considered as Lecture to understand various discussion using
Zero and Lecture 2 will scenarios about the power point
be having basic learning in any presentation,
introduction to machine machine. demonstration
learning. using videos
Lecture 3 Introduction to machine T-1 Well posed learning Students will be able Class room Robotic Task,
learning(well-posed learning R-1 problem and designing a to understand discussion using OCR task
problems) learning system. designing a learning power point
system. presentation.
Introduction to machine T-1 Well posed learning Students will be able Class room Robotic Task,
learning(designing a R-1 problem and designing a to understand discussion using OCR task
learning systems) learning system. designing a learning power point
system. presentation.
Week 2 Lecture 4 Introduction to machine T-1 Issues in machine Student will be able Class room
learning(issues in machine learning. to understand discussion using
learning) different issues in power point
machine learning. presentation.
Lecture 5 Formal learning model T-1 Statistical learning Student will able to Class room
(statistical learning framework and learn empirical risk discussion using
framework) empirical risk minimization. power point
minimization. presentation.
Formal learning model T-1 Statistical learning Student will able to Class room
(empirical risk framework and learn empirical risk discussion using
minimization) empirical risk minimization. power point
minimization. presentation.
Lecture 6 Formal learning model T-1 RW-4 PAC learning, Inductive Student will able to Class room
(empirical risk minimization bias included in understand PAC discussion using
with inductive bias) empirical risk learning, Inductive power point
minimization. bias included in presentation,
empirical risk demonstration
minimization. using videos

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 2 Lecture 6 Formal learning model(PAC T-1 RW-4 PAC learning, Inductive Student will able to Class room
learning) bias included in understand PAC discussion using
empirical risk learning, Inductive power point
minimization. bias included in presentation,
empirical risk demonstration
minimization. using videos
Week 3 Lecture 7 Formal learning model T-1 learning model concept. Students will able to Class room
(general learning model) understand discussion using
generalized concept power point
of learning model presentation,
demonstration
using videos.
Lecture 8 Decision tree learning R-1 RW-9 Decision tree learning Students will able to Class room Family tree.
(decision tree concept and appropriate understand Decision discussion using
representation) problems for decision tree learning concept power point
tree. and appropriate presentation,
problems for decision demonstration
tree. using videos.
Decision tree learning R-1 RW-9 Decision tree learning Students will able to Class room Family tree.
(appropriate problem for concept and appropriate understand Decision discussion using
decision tree learning) problems for decision tree learning concept power point
tree. and appropriate presentation,
problems for decision demonstration
tree. using videos.
Lecture 9 Decision tree learning T-1 CART and ID3 Students will able to Class room
(CART) algorithm. Term paper understand discussion using
will be assigned in this mathematical power point
lecture. foundation of presentation and
decision tree model. white board,
problem solving.
Decision tree learning(ID3) T-1 CART and ID3 Students will able to Class room
algorithm. Term paper understand discussion using
will be assigned in this mathematical power point
lecture. foundation of presentation and
decision tree model. white board,
problem solving.
Week 4 Lecture 10 Decision tree learning(C4.5) T-1 Information gain Students will able to Class room
R-1 measure and C4.5 understand discussion using
algorithm. mathematical power point
foundation to presentation and
compute information white board,
gain of various nodes. problem solving.
Decision tree learning T-1 Information gain Students will able to Class room
(information gain measure) R-1 measure and C4.5 understand discussion using
algorithm. mathematical power point
foundation to presentation and
compute information white board,
gain of various nodes. problem solving.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 4 Lecture 11 Decision tree learning T-1 RW-11 MDL principle and Students will able to Class room
(inductive bias in decision inductive bias in understand MDL discussion using
tree) decision tree. principle and power point
inductive bias in presentation.
decision tree.
Decision tree learning T-1 RW-11 MDL principle and Students will able to Class room
(minimum description inductive bias in understand MDL discussion using
length) decision tree. principle and power point
inductive bias in presentation.
decision tree.
Lecture 12 Decision tree learning(Issues R-1 Issues in decision tree Students will able to Class room
in decision tree learning) learning and random understand different discussion using
forest. issues in decision tree power point
learning and random presentation.
forest.
Decision tree learning R-1 Issues in decision tree Students will able to Class room
(random forest) learning and random understand different discussion using
forest.Class test 1 issues in decision tree power point
should be allocated in learning and random presentation.
this lecture. forest.
Week 5 Lecture 13 Generative models(Bayesian T-1 Bayes theorem and Students will able to Class room
learning) R-1 Bayesian learning. learn mathematical discussion using
foundation of power point
Bayesian learning. presentation and
problem solving.
Generative models(Bayes T-1 Bayes theorem and Students will able to Class room
theorem) R-1 Bayesian learning. learn mathematical discussion using
foundation of power point
Bayesian learning. presentation and
problem solving.
Lecture 14 Online Assignment
Lecture 15 Generative models(Bayesian R-1 Bayesian Decision Students will able to Class room
decision theory) theory and MAP understand Bayesian discussion using
algorithm. Decision theory and power point
MAP algorithm. presentation and
problem solving.
Generative models(brute- R-1 Bayesian Decision Students will able to Class room
force concept learning) theory and MAP understand Bayesian discussion using
algorithm. Decision theory and power point
MAP algorithm. presentation and
problem solving.
Week 6 Lecture 16 Generative models T-1 RW-6 MLE and Naive Bayes Student will able to Class room
(maximum likelihood classifier. understand MLE and discussion using
estimator) Naive Bayes power point
classifier. presentation and
problem solving.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 6 Lecture 16 Generative models(naive T-1 RW-6 MLE and Naive Bayes Student will able to Class room
Bayes) classifier. understand MLE and discussion using
Naive Bayes power point
classifier. presentation and
problem solving.
Lecture 17 Generative models T-1 Minimum error rate Students will able to Class room
(minimum error rate classification and understand Minimum discussion using
classification) discriminant function. error rate power point
classification and presentation and
discriminant problem solving.
function.
Generative models T-1 Minimum error rate Students will able to Class room
(discriminant function) classification and understand Minimum discussion using
discriminant function. error rate power point
classification and presentation and
discriminant problem solving.
function.
Lecture 18 Generative models(Bayes T-1 Bayes optimal classifier Students will able to Class room
optimal classifier) and Gibs algorithm. understand Bayes discussion using
optimal classifier and power point
Gibs algorithm. presentation and
problem solving.
Generative models(gibs T-1 Bayes optimal classifier Students will able to Class room
algorithm) and Gibs algorithm. understand Bayes discussion using
optimal classifier and power point
Gibs algorithm. presentation and
problem solving.
Week 7 Lecture 19 Generative models(Bayesian R-1 Bayesian belief Student will able to Class room
belief network) networks understand Bayesian discussion using
belief networks and power point
its application in presentation and
decision theory. problem solving.

SPILL OVER
Week 7 Lecture 20 Spill Over
Lecture 21 Spill Over

MID-TERM
Week 8 Lecture 22 Complex prediction T-1 RW-5 one-versus-all and all- Students will able to Class room Multiclass
problems(one-versus-all) pair algorithm for understand one- discussion using classification
multiclass classification. versus-all and all-pair power point
algorithm for presentation and
multiclass problem solving.
classification.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 8 Lecture 22 Complex prediction T-1 RW-5 one-versus-all and all- Students will able to Class room Multiclass
problems(all-pairs) pair algorithm for understand one- discussion using classification
multiclass classification. versus-all and all-pair power point
algorithm for presentation and
multiclass problem solving.
classification.
Lecture 23 Complex prediction T-1 RW-5 Linear multiclass Student will able to Class room
problems(linear multiclass predictors and understand various discussion using
predictors) multiclass SVM and multiclass algorithm power point
SGD algorithm. for machine learning. presentation.
Complex prediction T-1 RW-5 Linear multiclass Student will able to Class room
problems(multiclass SVM predictors and understand various discussion using
and SGD) multiclass SVM and multiclass algorithm power point
SGD algorithm. for machine learning. presentation.
Lecture 24 Complex prediction T-1 Structured output Student will able to Class room
problems(structured output prediction problem and understand methods discussion using
predictions) ranking. for Structured output power point
prediction problem presentation.
and ranking.
Complex prediction T-1 Structured output Student will able to Class room
problems(ranking) prediction problem and understand methods discussion using
ranking. for Structured output power point
prediction problem presentation.
and ranking.
Week 9 Lecture 25 Complex prediction T-1 Multivariate Student will able to Class room
problems(multivariate performance measure understand discussion using
performance measure) multivariate power point
performance measure presentation,
like accuracy, problem solving.
precision and recall
scores.
Lecture 26 Nonparametric Methods R-1 RW-10 Density estimation and Students will able to Class room
(Density estimation) Parzen window concept. understand discussion using
mathematical power point
foundation of Density presentation,
estimation and problem solving.
Parzen window
concept.
Nonparametric Methods R-1 RW-10 Density estimation and Students will able to Class room
(parzen window) Parzen window concept. understand discussion using
mathematical power point
foundation of Density presentation,
estimation and problem solving.
Parzen window
concept.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 9 Lecture 27 Nonparametric Methods(the R-1 Nearest neighbour ruls Students will able to Class room
nearest neighbour rule) and KNN classifier. understand discussion using
mathematical power point
foundation of nearest presentation,
neighbour rules. problem solving.
Nonparametric Methods(K- R-1 Nearest neighbour ruls Students will able to Class room
Nearest neighbour and KNN classifier. understand discussion using
estimation.) Class test 2 should be mathematical power point
allocated in this lecture. foundation of nearest presentation,
neighbour rules. problem solving.
Week 10 Lecture 28 The bias-complexity T-1 AV-1 Error decomposition and Students will able to Class room
tradeoff(no free lunch No free lunch theorem. understand Error discussion using
theorem) decomposition and power point
No free lunch presentation,
theorem. problem solving.
The bias-complexity T-1 AV-1 Error decomposition and Students will able to Class room
tradeoff(error No free lunch theorem. understand Error discussion using
decomposition) decomposition and power point
No free lunch presentation,
theorem. problem solving.
Lecture 29 The bias-complexity T-1 RW-1 The VC dimension and Students will able to Class room
tradeoff(the VC-Dimension) Surrogate loss function. understand discussion using
mathematical power point
foundation of VC presentation,
dimension and problem solving.
Surrogate loss
function.
The bias-complexity T-1 RW-1 The VC dimension and Students will able to Class room
tradeoff(surrogate loss Surrogate loss function. understand discussion using
functions) mathematical power point
foundation of VC presentation,
dimension and problem solving.
Surrogate loss
function.
Lecture 30 Online Assignment
Week 11 Lecture 31 The bias-complexity T-1 RW-2 The Natarajan Students will able to Class room
tradeoff(the Rademacher RW-3 dimension and The understand discussion using
complexity) Rademacher mathematical power point
complexity. foundation of presentation,
Natarajan dimension demonstration
and Rademacher using videos.
complexity.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 11 Lecture 31 The bias-complexity T-1 RW-2 The Natarajan Students will able to Class room
tradeoff(the Natarajan RW-3 dimension and The understand discussion using
dimension) Rademacher mathematical power point
complexity. foundation of presentation,
Natarajan dimension demonstration
and Rademacher using videos.
complexity.
Lecture 32 Nonuniform learnability T-1 Learning via uniform Students will able to Class room
(learning via uniform convergence and understand Learning discussion using
convergence) nonuniform learnability. via uniform power point
convergence and presentation,
nonuniform demonstration
learnability. using videos.
Nonuniform learnability T-1 Learning via uniform Students will able to Class room
(characterizing nonuniform convergence and understand Learning discussion using
learnability) nonuniform learnability. via uniform power point
convergence and presentation,
nonuniform demonstration
learnability. using videos.
Lecture 33 Online Assignment
Week 12 Lecture 34 Nonuniform learnability T-1 RW-7 Structure risk Students will able to Class room
(structural risk minimization. understand SRM and discussion using
minimization) Occam's Razor power point
principle of MDL. presentation,
demonstration
using videos.
Nonuniform learnability T-1 RW-7 Structure risk Students will able to Class room
(minimum description minimization. understand SRM and discussion using
length) Occam's Razor power point
principle of MDL. presentation,
demonstration
using videos.
Lecture 35 Nonuniform learnability T-1 Discussion on Students will able to Class room
(different notions of computational understand discussion using
learnability) complexity of learning. computational power point
complexity of presentation.
learning.
Nonuniform learnability T-1 Discussion on Students will able to Class room
(computational complexity computational understand discussion using
of learning) complexity of learning. computational power point
complexity of presentation.
learning.
Lecture 36 Reinforcement learning(the T-1 RW-8 Reinforcement learning Students will able to Class room
learning task) tasks and Q-learning. understand discussion using
reinforcement power point
learning tasks and Q- presentation,
learning. demonstration
using videos.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 12 Lecture 36 Reinforcement learning(Q T-1 RW-8 Reinforcement learning Students will able to Class room
learning) tasks and Q-learning. understand discussion using
reinforcement power point
learning tasks and Q- presentation,
learning. demonstration
using videos.
Week 13 Lecture 37 Reinforcement learning T-1 Discussion on learning Students will able to Class room Self driving
(nondeterministic rewards via rewards and action. understand learning discussion using cars.
and action) via rewards and power point
action. presentation.
Reinforcement learning T-1 Discussion on learning Students will able to Class room Self driving
(temporal difference via rewards and action. understand learning discussion using cars.
learning) via rewards and power point
action. presentation.
Lecture 38 Algorithm-Independent T-1 Combining classifiers Students will able to Class room
machine Learning and re-sampling for understand discussion using
(combining classifiers) estimating statistics. Combining classifiers power point
and re-sampling for presentation.
estimating statistics.
Algorithm-Independent T-1 Combining classifiers Students will able to Class room
machine Learning(re- and re-sampling for understand discussion using
sampling for estimating estimating statistics. Combining classifiers power point
statistics) and re-sampling for presentation.
estimating statistics.
Lecture 39 Algorithm-Independent T-1 Lack of inherent Students will able to Class room
machine Learning(lack of superiority of classifier. learn algorithm discussion using
inherent superiority of independent machine power point
classifier) learning algorithm in presentation.
lack of inherent
superiority of
classifier.
Week 14 Lecture 40 Algorithm-Independent T-1 comparing and Students will able to Class room
machine Learning estimating classifiers. compare and estimate discussion using
(comparing and estimating classifiers results. power point
classifiers) presentation.

SPILL OVER
Week 14 Lecture 41 Spill Over
Lecture 42 Spill Over
Week 15 Lecture 43 Spill Over
Lecture 44 Spill Over
Lecture 45 Spill Over

List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 Sr. No. Topic
1 Q-learning
2 Reinforcement Learning
3 Hidden Markov Model
4 Decision Tree Learning
5 Analytical Learning
6 Inductive Learning
7 Computational Learning Theory
8 Maximum Likelihood and Maximum A Posteriori Algorithm
9 Probability and Estimation
10 Naive Bayes and its Types
11 Nonparametric Methods
12 Generative models
13 Algorithm-independent machine learning
14 Computational complexity of learning
15 Minimum description length

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.