Course Course

Name of Course L T P Credit

Type Code
DE ECE17105 Machine Learning 3 0 0 6

Course Objective
The objective of the course is to introduce Machine Learning, focusing on the core mathematical concepts of
supervised and unsupervised learning, to understand how to apply and analyze some popularly used ML algorithms.
Learning Outcomes
Upon successful completion of this course, students will:

 Be able to understand the mathematical theories and concepts behind the ML algorithms
 Be able to design and implement various ML algorithms in a range of real-world applications
 Be able to use commercial ML software based on these algorithms in a useful way for different datasets.

Unit
Topics to be Covered
No.
Introduction: concept of machine learning; Supervised,
unsupervised and reinforcement learning; Types of ML
1 problems: classification and regression;. Design of a
general learning system. Concept of Linear and Non-linear
Classifiers.
Evaluation Metrics Practical formulations/training,
testing and validation data, Overfitting and underfitting
2 2
Confusion matrix, precision, recall and K-fold cross-
validation
Bayesian Learning: Concepts of Conditional
independence and conditional probability. The use of
3 Naïve Bayes Classifier, method of Laplace correction,
Gaussian NBC .
Logistic Regression: Log-likelihood function and its
Gradient Descent optimization. Batch and stochastic GD,
4 Cross entropy loss, softmax activation function.
ANN: Use of Perceptrons to learn Boolean functions
Multilayer Perceptrons and Non-linearly separable data.
5 6
Back-propagation training.
Lecture
Learning Outcome
Hours
Will be able to identify any problem
to its type and formulate its
2 appropriate ML model. Have a
broad idea of the type of applications
Will have an idea of how to evaluate
and compare classifiers and ML
models at the end of training.
Practical use of Baeyes Theorem and
given any dataset (discrete and
6 continuous) , will be able to
construct the probabilistic model and
predict the class of a new feature set.
The concept of maximum Likelihood
estimation and gradient based
6 searching in weight space will be
clear for deriving linear decision
boundaries.
Will be able to update the weights of
a multi-layer ANN and understand
the concept of how regression

Principal Component Analysis as an approach of Steps of applying PCA to a data,

6 Unsupervised learning, feature extraction, dimensionality 3 computing covariance matrix, Eigen
reduction features.
Support Vector Machines: The concept of Maximum Hyperplane geometry in developing
margin and support vectors. The use of Kernel mapping a discriminative optimal classifier,
7 for non-linear decision boundaries. 6 hard and soft margin, feature
mapping to higher dimensions,
handling of noisy data.
Deep learning : A brief overview of CNN and RNN The motivation of current
architectures (if time permits) application domains in using
8 3
different types of Deep Learning
models,
9 Class Tests/Quiz/Discussion of Homework solutions etc 4 Continuous evaluation
10 Tutorial classes 2 Practice of numerical problems

Text Books: Tom M. Mitchell, Machine Learning, McGraw Hill Publication (For S. No 1-5) (notes, derivations,
lecture slides etc and illustrative examples will be provided for most of the topics)