0% found this document useful (0 votes)
9 views

Machine Learning Techniques

BDA

Uploaded by

lekha.cce
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views

Machine Learning Techniques

BDA

Uploaded by

lekha.cce
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

SEMESTER - II

24PBDPC2 L T P C
03
MACHINE LEARNING
3 0 0 3
SDG NO. 4 &
TECHNIQUES
9

OBJECTIVES:
 To understand the concepts of machine learning
 To appreciate supervised and unsupervised learning and their applications
 To understand the theoretical and practical aspects of Probabilistic
Graphical Models
 To appreciate the concepts and algorithms of reinforcement learning
 To learnaspects of computational learning theory

UNIT I INTRODUCTION 8
Machine Learning - Machine Learning Foundations –Overview – Design of a
Learning system - Types of machine learning –Applications Mathematical
foundations of machine learning - random variables and probabilities -
Probability Theory – Probability distributions -Decision Theory- Bayes
Decision Theory- Information Theory

UNIT II SUPERVISED LEARNING 10


Linear Models for Regression - Linear Models for Classification – Naıv¨ e
Bayes - Discriminant Functions -Probabilistic Generative Models -
Probabilistic Discriminative Models - Bayesian Logistic Regression. Decision
Trees - Classification Trees- egression Trees - Pruning. Neural Networks -
Feed- forward Network Functions - Back- propagation. Support vector
machines - Ensemble methods- Bagging- Boosting.

UNIT III UNSUPERVISED LEARNING 8


Clustering- K-means - EM Algorithm- Mixtures of Gaussians. The Curse of
Dimensionality Dimensionality Reduction - Factor analysis - Principal
Component Analysis - Probabilistic PCA- Independent components analysis

UNIT IVPROBABILISTIC GRAPHICAL MODELS 10


Graphical Models - Undirected graphical models - Markov Random Fields -
Directed Graphical Models -Bayesian Networks - Conditional independence
properties - Inference – Learning- Generalization - Hidden Markov Models -
Conditional random fields (CRFs)
UNIT V ADVANCED LEARNING 9
Sampling –Basic sampling methods – Monte Carlo. Reinforcement Learning-
K-Armed Bandit- Elements - Model-Based Learning- Value Iteration- Policy
Iteration. Temporal Di ff erence Learning- Exploration Strategies-
Deterministic and Non-deterministic Rewards and Actions Computational
Learning Theory - Mistake bound analysis, sample complexity analysis, VC
dimension. Occam learning, accuracy andconfidence boosting
TOTAL: 45 PERIODS
REFERENCES:
1. Christopher Bishop, “Pattern Recognition and Machine Learning”
Springer, 2007.
2. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT
Press, 2012.
3. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Third
Edition, 2014.
4. Tom Mitchell,"Machine Learning", McGraw-Hill, 1997.
5. Trevor Hastie, Robert Tibshirani, Jerome Friedman, "The Elements of
Statistical Learning", Springer, Second Edition, 2011.
6. Stephen Marsland, “Machine Learning - An Algorithmic Perspective”,
Chapman and Hall/CRC Press, Second Edition, 2014.
WEB REFERENCES:
1. https://nptel.ac.in/courses/106106139/
2. https://nptel.ac.in/courses/106106202/
3. https://www.udemy.com/course/machinelearning/
4. https://www.edx.org/learn/machine-learning
ONLINERESOURCES:
1. https://deepakdvallur.weebly.com/machine-learning.html
2. https://www.tutorialsduniya.com/notes/
3. https://ai.stanford.edu/~nilsson/MLBOOK.pdf
OUTCOMES:
At the end of thecourse, the students should able to
1. Designa neural network for anapplication of your choice
2. Implement probabilistic discriminative and generative algorithms for an
application of your choice and analyze the results
3. Use a tool to implement typical clustering algorithms for different types
of applications
4. Design and implement an HMMf or a sequence model type of application
5. Identify applications suitable for different types of machine learning
with suitable justification.

You might also like