SN 23CSH-676 Course Name: Advanced Machine L T P S C CH Course Type

Learning
11 Course Coordinator: 2 0 4 0 4 6 Program Elective
PRE-REQUISITE 23SMT-571, 23CSH-623, 23CSH-622, 23CST-
6**,23CST-6**,23CSN-624
CO-REQUISITE 23CSH-661, 23CSH-662, 23CSH-663, 23CSH-
664, 23CST-666, 23CSR-671, 23CST-65*
ANTI-REQUISITE 23CSR-749, 23CSN-713, 23TDT-713, 23TDP-
712

a. COURSE DESCRIPTION
The primary objective of this course is to equip the students with the fundamentals of Devops, cloud computing,
GIT, Chef ,Puppet and Docker.

b. COURSE OBJECTIVES

● To be familiar with fundamental Machine Learning useful for problem-solving in the engineering domain.
● To understand and analyse various machine learning algorithms
● To recognize and represent problems in a better way to find the optimal solution.

c. COURSE OUTCOMES
On completion of this course, the students are expected to have learnt about the following:
CO1 Extract features that can be used for a particular machine learning approach in various IOT
applications.

CO2 To compare and contrast pros and cons of various machine learning techniques and to get an
insight of when to apply a particular machine learning approach.

CO3 To mathematically analyse various machine learning approaches and paradigms

d. Syllabus

Unit-1 Types of Machine Learning Contact

Hours:15
Types of Machine Supervised Learning (Regression/Classification) Basic methods: Distance-based
Learning methods, Nearest-Neighbours, Decision Trees, Naive Bayes Linear models: Linear
Regression, Logistic Regression, Generalized Linear Models Support Vector
Machines, Nonlinearity and Kernel Methods Beyond Binary Classification: Multi-
class/Structured Outputs, Ranking
Unsupervised Learning Clustering: K-means/Kernel K-means Dimensionality
Reduction: PCA and kernel PCA Matrix Factorization and Matrix Completion
Generative Models (mixture models and latent factor models)

Practicals

57 | P a g e
ME CSE- CS301
 1. Implement and demonstrate the FIND-S algorithm for finding the most specific
hypothesis based on a given set of training data samples. Read the training data from
a .CSV file. 2.
2.For a given set of training data examples stored in a .CSV file, implement and
demonstrate the Candidate-Elimination algorithm to output a description of the set of
all hypotheses consistent with the training examples.
3. Write a program to demonstrate the working of the decision tree based ID3
algorithm. Use an appropriate data set for building the decision tree and apply this
knowledge toclassify a new sample.

Unit-2
Machine Learning Evaluating Machine Learning algorithms and Model Selection, Introduction to
Algorithms Statistical Learning Theory, Ensemble Methods (Boosting, Bagging, Random
Forests)
Sparse Modelling and Estimation, Modelling Sequence/Time-Series Data, Deep
Learning and Feature Representation Learning

Practicals
4. Build an Artificial Neural Network by implementing the
Backpropagationalgorithm and test the same using appropriate data sets.
5. Write a program to implement the naïve Bayesian classifier for a sample training
data set stored as a .CSV file. Compute the accuracy of the classifier, considering few
test data sets.
6. Assuming a set of documents that need to be classified, use the naïve Bayesian
Classifier model to perform this task. Built-in Java classes/API can be used to write
the program. Calculate the accuracy, precision, and recall for your data set.
7. Write a program to construct a Bayesian network considering medical data. Use
this model to demonstrate the diagnosis of heart patients using standard Heart
Disease Data Set. You can use Java/Python ML library classes/API

Unit -3
Scope of Machine Scalable Machine Learning (Online and Distributed Learning) A selection from some
Learning other advanced topics, e.g., Semi-supervised Learning, Active Learning,
Reinforcement Learning, Inference in Graphical Models, Introduction to Bayesian
Learning and Inference
Recent trends in various learning techniques of machine learning and classification
methods for IOT applications. Various models for IOT.
Practicals
8. Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same
data set for clustering using k-Means algorithm. Compare the results of these two
algorithms and comment on the quality of clustering. You can add Java/Python ML
library classes/API in the program.
9. Write a program to implement k-Nearest Neighbour algorithm to classify the iris
data set. Print both correct and wrong predictions. Java/Python ML library classes
can be used for this problem.

58 | P a g e
ME CSE- CS301
 10. Implement the non-parametric Locally Weighted Regression algorithm in order to
fit data points. Select appropriate data set for your experiment and draw graphs.

Self-study topics for Advanced learners:

● Neural network
● IOT
● Pythom

e. Text Books / Reference Books

TEXTBOOKS
T1 Machine Learning: A Probabilistic Perspective, Kevin Murphy, MIT Press, 2012.
T2 The Elements of Statistical Learning, Trevor Hastie, Robert Tibshirani, Jerome Friedman, Springer
2009 (freely available online)
T3 Machine Learning in Action, Peter Harrington, Manning, dreamtech press
REFERENCE BOOKS:
R1 Machine Learning for Big Data, Jason Bell, Wiley
R2 Machine Learning in Python, Michael Bowles, Wiley
PO1 PO2 PO3 PO5 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 2 3 2 0 0 0 0 0 0 0 1 2

CO2 3 2 3 2 2 0 0 0 0 0 0 0 1 2

CO3 2 1 2 3 2 0 0 0 0 0 0 0 2 1

Assessment Pattern

Assessment pattern of Hybrid courses is given below

Weightage of Frequencyofthe
FinalWeighta
S.N Type of Assessment actualcond task
ge
o uct persemest
er
Practical Worksheet/Practical
1 Projects and Practical 20marks 8-10 20
Learning
(Continuous Assessment)
Portfolio/Discussion
2 forum 4Marks 1 4
(Practical’s)
3 Practical MST 10 1 4
Assignment/Presentat
4 10 3 6

59 | P a g e
ME CSE- CS301
 ion/
Group Discussion etc.
5 Time bound Surprise test 12 3 4
6 Theory MST 20marks 2 10
Attendance
7 --- --- 2
Practical End Term Evaluation
8 40 1 20
Theory End term exam 60 1 30

SN 23CSH-671 Course Name: DevOps L T P S C CH Course Type

11 Course Coordinator: 2 0 4 0 4 6 Program Elective
PRE-REQUISITE 23SMT-571, 23CSH-623, 23CSH-622, 23CST-6**,23CST-6**,23CSN-
624
CO-REQUISITE 23CSH-661, 23CSH-662, 23CSH-663, 23CSH-664, 23CST-666, 23CSR-
671, 23CST-65*
ANTI-REQUISITE 23CSR-749, 23CSN-713, 23TDT-713, 23TDP-712

60 | P a g e
ME CSE- CS301