SGBAU · Third Year B.E. Computer Science and Engineering (Data Science) · NEP 2020
Machine Learning
6DS235PE1 · Elective III · Semester VI · 3 credits · IE 40 + ESE 60
One of the Elective III options.
Unit 1: Introduction to Machine Learning
6 hoursMachine-learning concepts, motivation, history and fundamentals, data requirements, an overview of techniques, validation by cross-validation, and supervised, unsupervised and reinforcement learning.
Examined in the 60-mark end-semester paper
- What machine learning is
- Types of learning
- Models of machine learning
- Cross-validation and model evaluation
Unit 2: Mathematics for Machine Learning
6 hoursLinear algebra fundamentals, matrix decompositions, the singular value decomposition and its applications, low-rank approximations, feature and dimensionality reduction, PCA, eigenvalues and eigenvectors, and orthogonality.
Examined in the 60-mark end-semester paper
- Linear algebra in machine learning and data science
- Diagonalisation and spectral decomposition
- Inner product spaces and orthogonality
- Principal component analysis
Unit 3: Optimisation Techniques
6 hoursUnconstrained and constrained optimisation, numerical optimisation, Newton's method, steepest descent and the penalty-function method.
Examined in the 60-mark end-semester paper
- Newton's and secant methods
- Convex and quadratic programming
- Gradient descent variants
Unit 4: Regression Techniques
6 hoursRegression with one variable, covariance and correlation, evaluating regression models and their metrics, gradient descent for linear regression, multiple and non-linear regression, and hypothesis testing of regression models.
Examined in the 60-mark end-semester paper
- Simple and multiple linear regression
- Polynomial regression
- Regression metrics
Unit 5: Classification Techniques
6 hoursNaive Bayes, k-nearest neighbours, support vector machines for classification and regression, decision trees, ensembles, performance measures, error analysis, the confusion matrix and the ROC curve.
Examined in the 60-mark end-semester paper
- Bayesian learning and naive Bayes
- K-nearest neighbours
- Support vector machines
- Tree-based and support vector regression
- Decision tree learning and overfitting
- Bagging and random forests
- Classification metrics
Unit 6: Clustering Techniques
6 hoursClustering and distance measures, distance-, density-based and hierarchical clustering, k-means with continuous and categorical data, building hierarchical clusters, Gaussian mixture models and the EM algorithm.
Examined in the 60-mark end-semester paper
- K-means and choosing k
- DBSCAN
- Hierarchical clustering
- K-medoids and K-prototype
- Gaussian mixture models
Unit contents are summarised from the official SGBAU syllabus . AiCanCode.org is not affiliated with Sant Gadge Baba Amravati University (SGBAU).