Machine Learning syllabus

PCC351COM · Third Year Computer Engineering, SPPU 2024 pattern. Every unit, the marks scheme, course outcomes and books, copied from the official syllabus PDF.

PCC351COM3 h/week theoryCCE 30 + End-sem 70
45hours of theory
05.units
03.credits

Unit-wise syllabus

UNIT I

Fundamentals of Machine Learning

9 hours

Derived reading outline. Source text split at semicolons, line breaks and sentence boundaries, not an official topic hierarchy.

  • Introduction to machine learning, scope of machine learning, AI vs ML vs Data Science, traditional programming vs ML paradigm, and real-world engineering applications.
  • Types of Learning: Supervised, unsupervised, semi-supervised, and reinforcement learning.
  • Models of Machine Learning: Geometric model, probabilistic models, logical models, grouping and grading models, parametric and non-parametric models.
  • Introduction to Feature Engineering.
  • Feature Transformation: Dimensionality reduction techniques- Principal Component Analysis (PCA)
  • Linear Discriminant Analysis (LDA).
  • Case Study: Machine Learning Based Student Performance Prediction and Feature Engineering Analysis
Preserved official unit paragraph

Introduction to machine learning, scope of machine learning, AI vs ML vs Data Science, traditional programming vs ML paradigm, and real-world engineering applications. Types of Learning: Supervised, unsupervised, semi-supervised, and reinforcement learning. Models of Machine Learning: Geometric model, probabilistic models, logical models, grouping and grading models, parametric and non-parametric models. Introduction to Feature Engineering. Feature Transformation: Dimensionality reduction techniques- Principal Component Analysis (PCA); Linear Discriminant Analysis (LDA). Case Study: Machine Learning Based Student Performance Prediction and Feature Engineering Analysis

Unit permalink
UNIT II

Supervised Learning-Regression

9 hours

Derived reading outline. Source text split at semicolons, line breaks and sentence boundaries, not an official topic hierarchy.

  • Introduction to regression, need of regression, regression vs correlation.
  • Types of regression: Univariate vs Multivariate, Linear vs Nonlinear, Simple vs Multiple, Bias–Variance Tradeoff, Overfitting and Underfitting.
  • Regression Techniques: Simple and Multiple Linear Regression
  • Polynomial Regression
  • Decision Tree Regression, Random Forest Regression, Support Vector Regression.
  • Regularization Techniques: Ridge Regression (L2)
  • Lasso Regression (L1).
  • Evaluation Metrics: Mean Squared Error (MSE)
  • Mean Absolute Error (MAE)
  • Root Mean Squared Error (RMSE)
  • R-squared (R²).
  • Case Study: Comparative Study of Regression Techniques for House Price Prediction
Preserved official unit paragraph

Introduction to regression, need of regression, regression vs correlation. Types of regression: Univariate vs Multivariate, Linear vs Nonlinear, Simple vs Multiple, Bias–Variance Tradeoff, Overfitting and Underfitting. Regression Techniques: Simple and Multiple Linear Regression; Polynomial Regression; Decision Tree Regression, Random Forest Regression, Support Vector Regression. Regularization Techniques: Ridge Regression (L2); Lasso Regression (L1). Evaluation Metrics: Mean Squared Error (MSE); Mean Absolute Error (MAE); Root Mean Squared Error (RMSE); R-squared (R²). Case Study: Comparative Study of Regression Techniques for House Price Prediction

Unit permalink
UNIT III

Supervised Learning-Classification

9 hours

Derived reading outline. Source text split at semicolons, line breaks and sentence boundaries, not an official topic hierarchy.

  • Introduction to classification, need of classification.
  • Types of Classification: Binary and Multiclass, Binary vs. Multiclass Classification, Balanced and Imbalanced Classification Problems.
  • Binary Classification: Linear classification model, decision boundary.
  • Performance Evaluation: Confusion Matrix, Accuracy, Precision, Recall, F1-Score.
  • Multiclass Classification: One-vs-One and One-vs-All classification techniques, multiclass confusion matrix
  • Per-Class Precision and Per-Class Recall
  • Macro, Micro and Weighted Averaging Methods.
  • Classification Algorithms: K-Nearest Neighbors (KNN), Linear Support Vector Machine (SVM), Soft Margin SVM.
  • Kernel Functions in SVM: Radial Basis Function (RBF/Gaussian) Kernel, Polynomial Kernel, Sigmoid Kernel.
  • Case Study: Comparative Study of Classification Algorithms for Email Spam Detection.
Preserved official unit paragraph

Introduction to classification, need of classification. Types of Classification: Binary and Multiclass, Binary vs. Multiclass Classification, Balanced and Imbalanced Classification Problems. Binary Classification: Linear classification model, decision boundary. Performance Evaluation: Confusion Matrix, Accuracy, Precision, Recall, F1-Score. Multiclass Classification: One-vs-One and One-vs-All classification techniques, multiclass confusion matrix; Per-Class Precision and Per-Class Recall; Macro, Micro and Weighted Averaging Methods. Classification Algorithms: K-Nearest Neighbors (KNN), Linear Support Vector Machine (SVM), Soft Margin SVM. Kernel Functions in SVM: Radial Basis Function (RBF/Gaussian) Kernel, Polynomial Kernel, Sigmoid Kernel. Case Study: Comparative Study of Classification Algorithms for Email Spam Detection.

Unit permalink
UNIT IV

Unsupervised Learning and Ensemble Learning

9 hours

Derived reading outline. Source text split at semicolons, line breaks and sentence boundaries, not an official topic hierarchy.

  • Introduction to clustering, need for clustering, types of clustering, Hierarchical Clustering – Agglomerative and Divisive methods, Partitioning Methods: K-Means clustering algorithm, advantages and limitations, Elbow method, Silhouette method
  • K-Medoids, Density-Based Clustering: DBSCAN algorithm, working mechanism, advantages and limitations.
  • Distribution-Based Clustering: Gaussian Mixture Model.
  • Applications, introduction to Ensemble Learning, homogeneous and heterogeneous ensemble methods, advantages and limitations.
  • Basic Ensemble Techniques: Voting (Max Voting, Averaging, Weighted Averaging).
  • Advanced Ensemble Techniques: Bagging and Random Forest.
  • Boosting: AdaBoost, Gradient Boosting , Stacking.
  • Case Study: Customer Segmentation and Sales Prediction
Preserved official unit paragraph

Introduction to clustering, need for clustering, types of clustering, Hierarchical Clustering – Agglomerative and Divisive methods, Partitioning Methods: K-Means clustering algorithm, advantages and limitations, Elbow method, Silhouette method; K-Medoids, Density-Based Clustering: DBSCAN algorithm, working mechanism, advantages and limitations. Distribution-Based Clustering: Gaussian Mixture Model. Applications, introduction to Ensemble Learning, homogeneous and heterogeneous ensemble methods, advantages and limitations. Basic Ensemble Techniques: Voting (Max Voting, Averaging, Weighted Averaging). Advanced Ensemble Techniques: Bagging and Random Forest. Boosting: AdaBoost, Gradient Boosting , Stacking. Case Study: Customer Segmentation and Sales Prediction

Unit permalink
UNIT V

Reinforcement Learning

9 hours

Derived reading outline. Source text split at semicolons, line breaks and sentence boundaries, not an official topic hierarchy.

  • Introduction, need of reinforcement learning, components of reinforcement learning, comparison with supervised and unsupervised learning, applications and challenges of reinforcement learning.
  • Markov Decision Process: Markov property, elements of MDP, episodic and continuing tasks.
  • Reinforcement Learning Framework: Policy, state value function, action value function, Bellman equation, optimal policy.
  • Reinforcement Learning Algorithms: Exploration vs Exploitation, ε-greedy strategy, dynamic programming, Q-Learning algorithm and update rule, simple reinforcement learning for game playing- Tic-Tac-Toe.
  • Case Study: Smart Traffic Signal Control using Q-Learning.
Preserved official unit paragraph

Introduction, need of reinforcement learning, components of reinforcement learning, comparison with supervised and unsupervised learning, applications and challenges of reinforcement learning. Markov Decision Process: Markov property, elements of MDP, episodic and continuing tasks. Reinforcement Learning Framework: Policy, state value function, action value function, Bellman equation, optimal policy. Reinforcement Learning Algorithms: Exploration vs Exploitation, ε-greedy strategy, dynamic programming, Q-Learning algorithm and update rule, simple reinforcement learning for game playing- Tic-Tac-Toe. Case Study: Smart Traffic Signal Control using Q-Learning.

Unit permalink

Marks and credits

HeadMarksCredit
CCE (continuous comprehensive evaluation)303
End-semester exam70

Prerequisite: Probability and Statistics, Data Science, Python Programming.

Course outcomes

  1. CO1Apply fundamental Machine Learning concepts in various learning paradigms and realworld engineering applications. •
  2. CO2Make use of various types of regression models for predictive modeling and data analysis. •
  3. CO3Identify different types of classification problems, including binary, multiclass, balanced, and imbalanced classification. •
  4. CO4Analyze clustering algorithms for grouping similar data points and ensemble learning techniques for improving model performance. •
  5. CO5Distinguish reinforcement learning from supervised and unsupervised learning approaches.

Books

Text books

Reference books

FAQ

How many units are in Machine Learning?

Machine Learning (PCC351COM) has 5 units and 45 hours of theory: Unit I Fundamentals of Machine Learning (9 h); Unit II Supervised Learning-Regression (9 h); Unit III Supervised Learning-Classification (9 h); Unit IV Unsupervised Learning and Ensemble Learning (9 h); Unit V Reinforcement Learning (9 h).

What is the marks scheme for Machine Learning?

The official Computer Engineering 2024 pattern syllabus lists continuous comprehensive evaluation (CCE) for 30 marks and the end-semester exam for 70 marks, for 3 credits.

What should I know before Machine Learning?

Prerequisite listed in the syllabus: Probability and Statistics, Data Science, Python Programming.

Add to my plan

Browse all syllabus courses