CBS3006 Machine Learning L T P J C
2 0 2 4 4
Pre-requisite Nil Syllabus version
1.0
Course Objectives:
1. Ability to comprehend the concept of supervised and unsupervised learning techniques
2. Differentiate regression, classification and clustering techniques and to implement their
algorithms.
3. To analyze the performance of various machine learning techniques and to select appropriate
features for training machine learning algorithms.
Course Outcome:
1. Understand the concepts of various machine learning strategies.
2. Handle computational data and learn ANN learning models.
3. Solve real world applications by selecting suitable learning model.
4. Boost the performance of the model by combining results from different approaches.
5. Recognize and classify sequencing patterns using HMM.
6. Infer the association and relationship between the data objects.
7. Construct machine learning model for unseen data and can solve real world application.
Student Learning Outcomes (SLO): 2,6,17
Module:1 Introduction to Machine Learning 3 hours
Introduction to Machine Learning (ML); Feature engineering; Learning Paradigm, Generalization
of hypothesis, VC Dimension, PAC learning, Applications of ML.
Module:2 Data Handling and ANN 4 hours
Feature selection Mechanisms, Imbalanced data, Outlier detection- Artificial neural networks
including backpropagation- Applications
Module:3 ML Models and Evaluation 6 hours
Regression: Multi-variable regression; Model evaluation; Least squares regression;
Regularization; LASSO; Applications of regression, Classification – KNN, Naïve Bayes, SVM,
Decision Tree; Training and testing classifier models; Cross-validation; Model evaluation
(precision, recall, F1-mesure, accuracy, area under curve); Statistical decision theory including
discriminant functions and decision surfaces
Module:4 Model Assessment and Inference 4 hours
Model assessment and Selection – Ensemble Learning – Boosting, Bagging, Model Inference and
Averaging, Bayesian Theory, EM Algorithm
Module:5 Hidden Markov Models 3 hours
Hidden Markov Models (HMM) with forward-backward and Vierbi algorithms; Sequence
classification using HMM; Conditional random fields; Applications of sequence classification
such as part-of-speech tagging
Module:6 Association Rules 3 hours
Mining Association Rules in Large Databases. Mining Frequent Patterns-- basic concepts -
Efficient and scalable frequent item set mining -methods, Apriori algorithm, FP-Growth
algorithm
Module:7 Clustering 5 hours
K Means, Hierarchical Clustering – Single, complete, Average linkage; Ward’s algorithm;
Minimum spanning tree clustering; BIRCH clustering
Module:8 Recent Trends 2 hours
Recent Trends and case study
Total Lecture hours: 30 hours
Lab Experiments
1. Implement Decision Tree learning 2 hours
Proceedings of the 61st Meeting of the Academic Council [18.02.2021] 94
2. Implement Logistic Regression 2 hours
3. Implement classification using Multilayer perceptron 2 hours
4. Implement classification using SVM 2 hours
5. Implement Adaboost 2 hours
6. Implement Bagging using Random Forests 2 hours
7. Implement K‐means Clustering to Find Natural Patterns in Data 2 hours
8. Implement Hierarchical clustering 2 hours
9. Implement K‐mode clustering 2 hours
10 Implement Association Rule Mining using FP Growth 2 hours
11. Classification based on association rules 2 hours
12. Implement Gaussian Mixture Model Using the Expectation Maximization 2 hours
13 Evaluating ML algorithm with balanced and unbalanced datasets 2 hours
14 Comparison of Machine Learning algorithms 2 hours
15 Implement k‐nearest neighbour algorithm 2 hours
Total Lecture hours: 30 hours
Text Book(s)
1. Ethem Alpaydin, Introduction to Machine Learning , MIT Press, Pearson ,
Third Edition, 2014.
2. Friedman Jerome, Trevor Hastie, and Robert Tibshirani. The Elements of Statistical
Learning. Springer-Verlag, 2nd Edition, 2013.
Reference Books
1. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press,
2. 2012.
Peter Flach, “Machine Learning: The Art and Science of Algorithms that Make Sense
of Data”, Cambridge University Press, 2012.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Lab
Recommended by Board of Studies 29-01-2021
Approved by Academic Council No. 61 Date 18-02-2021
Proceedings of the 61st Meeting of the Academic Council [18.02.2021] 95
