Scribd
Upload
26 views

ML Syllabus - Sem VII - Mumbai University

The document outlines the course CSC701: Machine Learning, which is a 3-credit course requiring prerequisites in Engineering Mathematics, Data Structures, and Algorithms. It covers fundamental concepts, supervised and unsupervised algorithms, ensemble techniques, and dimensionality reduction, with a total of 39 hours of instruction divided into six modules. Assessment includes two internal tests and an end-semester examination, with resources provided for further learning.

Uploaded by

ankit.try23
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views

ML Syllabus - Sem VII - Mumbai University

The document outlines the course CSC701: Machine Learning, which is a 3-credit course requiring prerequisites in Engineering Mathematics, Data Structures, and Algorithms. It covers fundamental concepts, supervised and unsupervised algorithms, ensemble techniques, and dimensionality reduction, with a total of 39 hours of instruction divided into six modules. Assessment includes two internal tests and an end-semester examination, with resources provided for further learning.

Uploaded by

ankit.try23
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Course Code: Course Title Credit

CSC701 Machine Learning 3

Prerequisite: Engineering Mathematics, Data Structures, Algorithms


Course Objectives:
1 To introduce the basic concepts and techniques of Machine Learning.
2 To acquire in depth understanding of various supervised and unsupervised algorithms
3 To be able to apply various ensemble techniques for combining ML models.
4 To demonstrate dimensionality reduction techniques.
Course Outcomes:

1 To acquire fundamental knowledge of developing machine learning models.

2 To select, apply and evaluate an appropriate machine learning model for the given
application.
3 To demonstrate ensemble techniques to combine predictions from different models.

4 To demonstrate the dimensionality reduction techniques.

Module Content Hrs


1 Introduction to Machine Learning 04
Machine Learning, Types of Machine Learning, Issues in Machine
1.1 Learning, Application of Machine Learning, Steps in developing a
Machine Learning Application.
Training Error, Generalization error, Overfitting, Underfitting, Bias-
1.2
Variance trade-off.
2 Learning with Regression and Trees 09
Learning with Regression: Linear Regression, Multivariate Linear
2.1
Regression, Logistic Regression.

Learning with Trees: Decision Trees, Constructing Decision Trees using


2.2
Gini Index (Regression), Classification and Regression Trees (CART)

Performance Metrics: Confusion Matrix, [Kappa Statistics], Sensitivity,


2.3
Specificity, Precision, Recall, F-measure, ROC curve
3 Ensemble Learning 06
Understanding Ensembles, K-fold cross validation, Boosting, Stumping,
3.1
XGBoost
Bagging, Subagging, Random Forest, Comparison with Boosting,
3.2
Different ways to combine classifiers
4 Learning with Classification 08
Support Vector Machine
Constrained Optimization, Optimal decision boundary, Margins and
4.1
support vectors, SVM as constrained optimization problem, Quadratic
Programming, SVM for linear and nonlinear classification, Basics of
Kernel trick.
4.2 Support Vector Regression, Multiclass Classification
5 Learning with Clustering 07
Introduction to clustering with overview of distance metrics and major
5.1
clustering approaches.
Graph Based Clustering: Clustering with minimal spanning tree
5.2 Model based Clustering: Expectation Maximization Algorithm,
Density Based Clustering: DBSCAN
6 Dimensionality Reduction 05
Dimensionality Reduction Techniques, Principal Component Analysis,
6.1
Linear Discriminant Analysis, Singular Valued Decomposition.
Total 39

Textbooks:

1 Peter Harrington, ―Machine Learning n Action‖, DreamTech Press

2 Ethem Alpaydın, ―Introduction to Machine Learning‖, MIT Press

3 Tom M. Mitchell, ―Machine Learning‖ McGraw Hill

4 Stephen Marsland, ―Machine Learning An Algorithmic Perspective‖, CRC Press

References:

1 Han Kamber, ―Data Mining Concepts and Techniques‖, Morgan Kaufmann Publishers
Margaret. H. Dunham, ―Data Mining Introductory and Advanced Topics, Pearson
2
Education
3 Kevin P. Murphy , Machine Learning ― A Probabilistic Perspective‖

4 Samir Roy and Chakraborty, ―Introduction to soft computing‖, Pearson Edition.


Richard Duda, Peter Hart, David G. Stork, ―Pattern Classification‖, Second Edition, Wiley
5
Publications.
Assessment:

Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first class test is to be conducted
when approximately 40% syllabus is completed and the second class test when an additional 40%
syllabus is completed. Duration of each test shall be one hour.
End Semester Theory Examination:

1 Question paper will comprise a total of six questions.

2 All question carries equal marks


Questions will be mixed in nature (for example supposed Q.2 has part (a) from module 3
3
then part (b) will be from any module other than module 3)
4 Only Four questions need to be solved.
In question paper weightage of each module will be proportional to number of respective
5
lecture hours as mentioned in the syllabus.

Useful Digital Links


1 Data sets for Machine Learning algorithms: https://www.kaggle.com/datasets
2 Machine Learning repository- https://archive.ics.uci.edu/ml/index.php
3 Machine Learning from Coursera
4 https://towardsdatascience.com/machine-learning/home
5 https://onlinecourses.nptel.ac.in/noc21_cs85/preview

You might also like