Syllabus for B. Tech.
III Year II semester
Computer Science and Engineering
MACHINE LEARNING
(Professional Elective –IV)
L T P/D C
Code: 7EC13 3 - - 3
Course Objective:
To introduce students to the basic concepts and techniques of Machine Learning.
To have a thorough understanding of the Supervised and Unsupervised learning techniques
To study the various probabilities based learning techniques
To understand graphical models of machine learning algorithms
Course Outcomes:
At the end of this course, the student is able to
1. Distinguish between, supervised, unsupervised and semi-supervised learning
2. Apply the apt machine learning strategy for any given problem
3. Suggest supervised, unsupervised or semi-supervised learning algorithms for any given
problem
4. Design systems that use the appropriate graph models of machine learning
5. Modify existing machine learning algorithms to improve classification efficiency
6. Analytical approach in Learning
UNIT I: INTRODUCTION:
Learning(Book-1) – Types of Machine Learning – Supervised Learning – The Brain and the
Neuron – Design a Learning System(Book-2) – Perspectives and Issues in Machine Learning
– Concept Learning Task – Concept Learning as Search – Finding a Maximally Specific
Hypothesis – Version Spaces and the Candidate Elimination Algorithm – Linear
Discriminants: (Book-1) – Perceptron – Linear Separability – Linear Regression.
UNIT II: LINEAR MODELS:
Multi-layer Perceptron(Book-1) – Going Forwards – Going Backwards: Back Propagation
Error – Multi-layer Perceptron in Practice – Examples of using the MLP – Overview –
Deriving Back-Propagation – Radial Basis Functions and Splines – Concepts – RBF Network
– Curse of Dimensionality – Interpolations and Basis Functions – Support Vector Machines
UNIT III: TREE AND PROBABILISTIC MODELS:
Learning with Trees(Book-1) – Decision Trees – Constructing Decision Trees –
Classification and Regression Trees – Ensemble Learning – Boosting – Bagging – Different
ways to Combine Classifiers – Basic Statistics – Gaussian Mixture Models – Nearest
Neighbor Methods – Unsupervised Learning – K means Algorithms
UNIT IV: DIMENSIONALITY REDUCTION AND EVOLUTIONARY MODELS:
Dimensionality Reduction(Book-1) – Linear Discriminant Analysis – Principal Component
Analysis – Factor Analysis – Independent Component Analysis – Locally Linear Embedding
– Isomap – Least Squares Optimization – Evolutionary Learning – Genetic algorithms –
Genetic Offspring: - Genetic Operators – Using Genetic Algorithms – Reinforcement
Learning – Overview – Getting Lost Example
UNIT V: GRAPHICAL MODELS:
Markov Chain Monte Carlo Methods (Book-1) – Sampling – Proposal Distribution – Markov
Chain Monte Carlo – Graphical Models – Bayesian Networks – Markov Random Fields –
Hidden Markov Models – Tracking Methods
UNIT – VI ANALYTICAL LEARNING
Learning with perfect domain theory (Book-2) – Explanation based Learning – Inductive
analytical approach to learning – KBANN algorithm
TEXT BOOKS:
1. Stephen Marsland, ―Machine Learning – An Algorithmic Perspective‖, Second Edition,
Chapman and Hall/CRC Machine Learning and Pattern Recognition Series, 2014.
2. Tom M Mitchell, ―Machine Learning‖, First Edition, McGraw Hill Education, 2013.
REFERENCES:
1. Peter Flach, ―Machine Learning: The Art and Science of Algorithms that Make Sense of
Data‖, First Edition, Cambridge University Press, 2012.
2. Jason Bell, ―Machine learning – Hands on for Developers and Technical Professionals‖,
First Edition, Wiley, 2014
3. Ethem Alpaydin, ―Introduction to Machine Learning 3e (Adaptive Computation and
Machine Learning Series), Third Edition, MIT Press, 2014