Scribd
Upload
28 views3 pages

Machine

This document provides details about the Machine Learning course offered as part of the M.Sc.(SS) program. [1] The course aims to provide students with knowledge of machine learning concepts, algorithms, and applications. [2] It is divided into 5 units covering topics such as concept learning, decision trees, neural networks, Bayesian learning, computational learning theory, and reinforcement learning. [3] The course will be evaluated through continuous internal assessment and an end semester exam.

Uploaded by

Rohith Yasif
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
28 views3 pages

Machine

This document provides details about the Machine Learning course offered as part of the M.Sc.(SS) program. [1] The course aims to provide students with knowledge of machine learning concepts, algorithms, and applications. [2] It is divided into 5 units covering topics such as concept learning, decision trees, neural networks, Bayesian learning, computational learning theory, and reinforcement learning. [3] The course will be evaluated through continuous internal assessment and an end semester exam.

Uploaded by

Rohith Yasif
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

Programme Course Code(s) Title

M.Sc.(SS) 19SSI46 DSE 2 :Option I - Machine Learning


Course Objective:
After successful completion of the course the students will gain knowledge in
machine learning concepts, algorithms and its applications.
Expected Level of Output : Conceptual Level
Department Offered : Computer Science
Course Inputs:
Text Instructional
Unit Description Chapter
Book Hours
Introduction: Well-posed learning problems -
A 1 2
Designing a learning system
Perspective and issue in machine learning A 1 2
Concept Learning and the General-to-Specific
I Ordering: A Concept Learning Task – Concept
Learning as Search – FIND-S: Finding a A 2 3
Maximally Specific Hypothesis – Version spaces
and the CANDIDATE-ELIMINATION
Remarks on Version Spaces and CANDIDATE-
A 2 3
ELIMINATION – Inductive Bias
Decision Tree Learning: Decision Tree
Representation - Appropriate Problems for
A 3 2
Decision Tree Learning - The Basic Decision Tree
Learning Algorithm
Hypothesis Space Search in Decision Tree
II
Learning - Inductive Bias in Decision Tree A 3 2
Learning - Issues in Decision Tree Learning
Artificial Neural Networks: Introduction - Neural
Network Representations - Appropriate Problems A 4 2
for Neural Network Learning – Perceptrons
Multilayer Networks and the
BACKPROPAGATION Algorithm - Remarks on A 4 2
the BACKPROPAGATION Algorithm
An Illustrative Example: Face Recognition -
A 4 2
Advance Topics in Artificial Neural Network
Evaluating Hypotheses: Motivation - Estimating
Hypotheses Accuracy - Basics of Sampling A 5 2
Theory
A General Approach for Deriving Confidence
Intervals - Difference in Error of Two Hypothesis - 5 3
A
Comparing Learning Algorithms

Bayesian Learning: Introduction - Bayes Theorem


- Bayes Theorem and Concept Learning -
III
Maximum Likelihood and Least-Square Error
A 6 2
Hypothesis - Maximum Likelihood Hypothesis for
Predicting Probabilities - Minimum Description
Length Principle

Bayes Optimal Classifier - Gibbs Algorithm -


Naïve Bayes Classifier - An Example :Learning to
A 6 3
Classify Text - Bayesian Belief Networks - The
EM Algorithm

Computational Learning Theory: Introduction -


Probably Learning an Approximately Correct
A 7 2
Hypothesis - Sample Complexity for Finite
Hypothesis Spaces
IV
Sample Complexity for Infinite Hypothesis Spaces
A 7 2
- The Mistake Bound Model of Learning

Instance Based Learning: Introduction - k-


NEAREST NEIGHBOR LEARNING – Locally A 8 3
Weighted Regression
Radial Basis Functions - Case-Based Reasoning -
A 8 3
Remarks on Lazy and Eager Learning
Genetic Algorithms: Motivation - Genetic
Algorithms - An illustrative example - Hypothesis A 9 2
Space Research
Genetic Programming - Models of Evolution and
A 9 3
Learning - Parallelizing Genetic Algorithms
V
Reinforcement Learning: Introduction - The
A 13 3
learning Task - Q Learning
Nondeterministic Rewards and Actions - Temporal
Difference Learning - Generalizing from Examples A 13 2
- Relationship to Dynamic Programming
I-V Revision A 5
Total Hours 55

CIA: 25 Marks; End Semester: 75 Marks

Reference Books:
A. Tom M. Mitchell; Machine Learning; McGraw Hill Education (India) Private
Limited; First Edition; 2019.
B. Bishop, Pattern Recongition and Machine Learning; Berlin: Springer- Verlag;
2006.

C. Baldi, P., Frasconi. P., Smyth, ; A Machine Learning Approach, Cambridge,


MA: MIT Press, 2002

Course Co-ordinators:
1. Dr. J.Gowri
2. Dr.S.Dhanalakshmi

You might also like