JNTUA COLLEGE OF ENGINEERING (AUTONOMOUS)::

ANANTHAPURAMU
DEPARTMENT OF COMPUTER SCIENCE &
ENGINEERING

III B.TECH–II SEMESTER (R19)

Machine Learning L T
P C
3 0
0 3
Course Objectives:

 Understand the basic theory underlying machine learning

Course Outcomes:
CO1: Identify machine learning techniques suitable for a given problem.
CO2: Solve the real world problems using various machine learning techniques.
CO3: Apply Dimensionality reduction techniques for data preprocessing.
CO4: Explain what is learning and why it is essential in the design of intelligent machines.
CO5: Implement Advanced learning models for language, vision, speech, decision making
etc.
Mapping of COs with POs and PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 3 2 1 1 3

CO2 3 1 2 1 2

CO3 2 2 1 2 1 3 2

CO4 2 3 1 2 3

CO5 3 2 1 1 1 1 3 2

UNIT I
Introduction: Learning Problems – Perspectives and Issues – Concept Learning – Version
Spaces and Candidate Eliminations – Inductive bias – Decision Tree learning – Representation –
Algorithm – Heuristic Space Search.
Learning Outcomes:
1. Explore how to build computer programs that improve their performance at some task
through experience. (L6).
2. Interpret Decision tree learning as practical methods for inductive inference. (L2)

UNIT II
NEURAL NETWORKS AND GENETIC ALGORITHMS: Neural Network Representation –
Problems – Perceptrons – Multilayer Networks and Back Propagation Algorithms – Advanced
Topics – Genetic Algorithms – Hypothesis Space Search – Genetic Programming – Models of
Evolution and Learning.

Learning Outcomes:
1. Appraise artificial neural networks as one of the most effective learning methods
currently known to interpret complex real-world sensor data. (L5).
2. Illustrates the use of the genetic algorithm approach, and examine the nature of its
hypothesis space search.(L2)

UNIT III
BAYESIAN AND COMPUTATIONAL LEARNING: Bayes Theorem – Concept Learning –
Maximum Likelihood – Minimum Description Length Principle – Bayes Optimal Classifier –
Gibbs Algorithm – Naïve Bayes Classifier – Bayesian Belief Network – EM Algorithm –
Probability Learning – Sample Complexity – Finite and Infinite Hypothesis Spaces – Mistake
Bound Model.

Learning Outcomes:

1. Illustrate the principles of Probability for classification as an important area of Machine

UNIT IV
INSTANCE BASED LEARNING: K- Nearest Neighbor Learning – Locally weighted
Regression – Radial Bases Functions – Case Based Learning.

Learning Outcomes:

1. Infer that the Instance based algorithms can be used to overcome memory complexity and
overfitting problems. (L2).
UNIT V
ADVANCED LEARNING : Learning Sets of Rules – Sequential Covering Algorithm –
Learning Rule Set – First Order Rules – Sets of First Order Rules – Induction on Inverted
Deduction – Inverting Resolution – Analytical Learning – Perfect Domain Theories –
Explanation Base Learning – FOCL Algorithm –Reinforcement Learning – Task – Q-Learning –
Temporal Difference Learning
Learning Outcomes:
1. Infer that the combined methods outperform both purely inductive and purely analytical
learning methods. (L2)
2. Recognize the importance of Reinforcement Learning in the industry.

Text Books:
1. T.M. Mitchell, “Machine Learning”, McGraw-Hill, 1997.

Reference Books:

1. Ethern Alpaydin, “Introduction to Machine Learning”, MIT Press, 2004.

2. Stephen Marsland, “Machine Learning -An Algorithmic Perspective”, Second Edition,

3. Andreas C. Müller and Sarah Guido “Introduction to Machine Learning with Python: A Guide
for Data Scientists”, Oreilly.