BOE073 MACHINE LEARNING 3L 0T 0P 3 Credits
Course Objective: The objective of this course is to provide a comprehensive
understanding of core machine learning concepts, algorithms, and models,
enabling students to design, implement, and evaluate learning systems across
various paradigms including neural networks, Bayesian methods, and
reinforcement learning.
After completion of the course student will be able to:
COs CO Statement BL
Understand and analyze fundamental concepts of machine
CO1 learning, including the design of learning systems and the K2
role of hypothesis space and inductive bias.
Apply and evaluate concept learning algorithms such as
CO2 Find-S, Candidate Elimination, and decision tree learning, K4
while addressing related issues and biases.
Design and implement artificial neural networks using
CO3 perceptrons, Adaline, and backpropagation, and assess their K3
convergence and generalization capabilities
Utilize probabilistic models including Bayesian learning,
CO4 Naïve Bayes classifiers, belief networks, and EM algorithm K3
for accurate hypothesis evaluation and prediction.
CO5 Analyze and implement advanced learning paradigms such K4
as instance-based learning, genetic algorithms, first-order
rule learning, and reinforcement learning including Q-
learning.
Unit Content Hours
I INTRODUCTION – Well defined learning problems, Designing a 8
Learning System, Issues in Machine Learning; THE
CONCEPT LEARNING TASK - General-to-specific ordering
of hypotheses, Find-S, List then eliminate algorithm,
Candidate elimination algorithm, Inductive bias.
II DECISION TREE LEARNING - Decision tree learning 8
algorithm Inductive bias- Issues in Decision tree learning;
ARTIFICIAL NEURAL NETWORKS – Perceptrons, Gradient
descent and the Delta rule, Adaline, Multilayer networks,
Derivation of backpropagation rule Backpropagation
Algorithm Convergence, Generalization.
III Evaluating Hypotheses: Estimating Hypotheses Accuracy, 8
Basics of sampling Theory, Comparing Learning Algorithms;
Bayesian Learning: Bayes theorem, Concept learning, Bayes
Optimal Classifier, Naïve Bayes classifier, Bayesian belief
networks, EM algorithm.
OPEN ELECTIVE-II LIST 2025-26
IV Computational Learning Theory: Sample Complexity for Finite 8
Hypothesis spaces, Sample Complexity for Infinite Hypothesis
spaces, The Mistake Bound Model of Learning; INSTANCE-
BASED LEARNING – k-Nearest Neighbour Learning, Locally
Weighted Regression, Radial basis function networks, Case-
based learning.
V Genetic Algorithms: an illustrative example, Hypothesis space 8
search, Genetic Programming, Models of Evolution and
Learning; Learning first order rules- sequential covering
algorithms-General to specific beam search-FOIL;
REINFORCEMENT LEARNING- The Learning Task, Q learning.
Text Books:
1. Tom M. Mitchell,―Machine Learning, McGraw-Hill Education (India)
Private Limited, 2013.
2. Ethem Alpaydin,―Introduction to Machine Learning (Adaptive
Computation and Machine Learning), The MIT Press 2004.
3. Stephen Marsland, ―Machine Learning: An Algorithmic Perspective,
CRC Press, 2009.
4. Bishop, C., Pattern Recognition and Machine Learning. Berlin:
Springer- Verlag.
OPEN ELECTIVE-II LIST 2025-26