INT394:MACHINE LEARNING ALGORITHMS
L:3 T:0 P:0 Credits:3
Course Outcomes: Through this course students should be able to
CO1 :: analyze foundational concepts and learning paradigms in machine learning
CO2 :: interpret classification techniques and probabilistic models
CO3 :: compare non-parametric classification methods and ensemble techniques for model’s
robustness
CO4 :: understand regression and clustering algorithms for predictive modelling
CO5 :: describe reinforcement learning principles and examine the role of value functions and
policies
CO6 :: analyze model complexity measures and optimization strategies to evaluate the trade-offs
in learning performance
Unit I
Foundations of Machine Learning : definition, scope and need of machine learning, Supervised,
Unsupervised and Reinforcement Learning, Challenges in machine learning, Statistical learning
framework, Empirical Risk Minimization (ERM) and Inductive bias, Probably Approximately Correct
(PAC) Learning
Unit II
Classification : overview of classification, decision boundaries and their properties, linear classifier,
multi-class classification strategies- one vs all, one vs one
Probabilistic approaches for classification : Bayes Theorem, Naïve Bayes classifier, Bayesian
decision theory
Unit III
Non-parametric classification : K-Nearest neighbours, Decision trees, decision tree algorithms-
ID3, C4.5, CART, pruning methods, Preventing overfitting
Ensemble Models : importance of ensemble, bagging, boosting, stacking, voting and averaging
Unit IV
Regression : difference between classification and regression, linear vs non-linear regression, loss
functions for regression, non-parametric regression
Clustering : difference between classification and clustering, similarity and distance measures,
partition-based clustering, hierarchical clustering, cluster validation and evaluation
Unit V
Reinforcement Learning : fundamentals of reinforcement learning, components of RL, Markov
Decision Processes (MDPs), Value function and Bellman Equations, Q-Learning, Temporal Difference
Learning
Unit VI
Model Complexity : VC dimension, Rademacher Complexity, Bias-variance Trade off, overfitting vs
underfitting, regularization techniques
Optimization : cross-validation, hyperparameter tuning, Structural Risk Minimization, Gradient
Descent and Variants (momentum, RMSprop)- Convergence analysis
Text Books:
1. MACHINE LEARNING-I by CHANDRA S.S, VINOD, PHI Learning
References:
1. MACHINE LEARNING by ETHEM ALPAYDIN, MIT Press
Session 2025-26 Page:1/2
Session 2025-26 Page:2/2