0% found this document useful (0 votes)
562 views2 pages

R22 ML Syllabus

The document outlines the syllabus for the Machine Learning course (DS602PC) for B.Tech. CSE students at JNTU Hyderabad, detailing course objectives and outcomes. It covers various topics including supervised and unsupervised learning, decision trees, dimensionality reduction, and reinforcement learning. The course aims to equip students with foundational knowledge and practical skills in machine learning techniques and algorithms.

Uploaded by

Mogili siva
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
562 views2 pages

R22 ML Syllabus

The document outlines the syllabus for the Machine Learning course (DS602PC) for B.Tech. CSE students at JNTU Hyderabad, detailing course objectives and outcomes. It covers various topics including supervised and unsupervised learning, decision trees, dimensionality reduction, and reinforcement learning. The course aims to equip students with foundational knowledge and practical skills in machine learning techniques and algorithms.

Uploaded by

Mogili siva
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

R22 B.Tech.

CSE (Data Science) Syllabus JNTU Hyderabad


DS602PC: MACHINE LEARNING

B.Tech. III Year II Sem. L TPC


3 0 03
Course Objectives:
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 probability-based learning techniques
Course Outcomes:
Distinguish between, supervised, unsupervised and semi-supervised learning
Understand algorithms for building classifiers applied on datasets of non-linearly
separable classes
Understand the principles of evolutionary computing algorithms
Design an ensembler to increase the classification accuracy

UNIT - I
Learning – Types of Machine Learning – Supervised Learning – The Brain and the Neuron – Design a
Learning System – 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: – Perceptron – Linear Separability – Linear Regression.

UNIT - II
Multi-layer Perceptron– 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
Learning with Trees – 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 – 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

UNIT - V
Reinforcement Learning – Overview – Getting Lost Example
Markov Chain Monte Carlo Methods – Sampling – Proposal Distribution – Markov Chain Monte Carlo
– Graphical Models – Bayesian Networks – Markov Random Fields – Hidden Markov Models –
Tracking Methods
TEXT BOOKS:
Stephen Marsland, ―Machine Learning – An Algorithmic Perspective, Second Edition,
Chapman and Hall/CRC Machine Learning and Pattern Recognition Series, 2

You might also like