JNTUH CSE III-II SEMESTER

CS601PC: MACHINE LEARNING

ACADEMIC YEAR 2023-24 COURSE FILE

UNIVERSITY CALENDAR
 JNTUH CSE III-II SEMESTER
CS601PC: MACHINE LEARNING

ACADEMIC YEAR 2023-24 COURSE FILE

 Vision of the Institute

To emerge as a premier institute for high quality professional graduates who can contribute to
economic and social developments of the Nation.
Mission of the Institute
Mission Statement

To have holistic approach in curriculum and pedagogy through industry

IM1
interface to meet the needs of Global Competency.

To develop students with knowledge, attitude, employability skills,

IM2
entrepreneurship, research potential and professionally ethical citizens.

To contribute to advancement of Engineering & Technology that would

IM3
help to satisfy the societal needs.

To preserve, promote cultural heritage, humanistic values and spiritual

IM4
values thus helping in peace and harmony in the society.

Vision of the Department

To Provide Quality Education in Computer Science for the innovative professionals to work for the
development of the nation.
Mission of the Department
Mission Statement

Laying the path for rich skills in Computer Science through the basic
DM1
knowledge of mathematics and fundamentals of engineering

Provide latest tools and technology to the students as a part of learning

DM2
infrastructure

Training the students towards employability and entrepreneurship to meet

DM3
the societal needs.

DM4 Grooming the students with professional and social ethics.

1
Program Educational Objectives (PEOs)

PEO’s Statement

The graduates of Computer Science and Engineering will have successful

PEO1
career in technology.

The graduates of the program will have solid technical and professional
PEO2
foundation to continue higher studies.

The graduate of the program will have skills to develop products, offer
PEO3
services and innovation.

The graduates of the program will have fundamental awareness of

PEO4
industry process, tools and technologies.

Program Outcomes

Engineering Knowledge: Apply the knowledge of mathematics, science,

PO1 engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.
Problem Analysis: Identify, formulate, review research literature, and analyze
PO2 complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.

Design/development of Solutions: Design solutions for complex engineering

problems and design system components or processes that meet the specified
PO3
needs with appropriate consideration for the public health and safety, and the
cultural, societal, and environmental considerations.

Conduct investigations of complex problems: Use research-based knowledge

PO4 and research methods including design of experiments, analysis and

interpretation of data, and synthesis of the information to provide valid
conclusions.

Modern tool usage: Create, select, and apply appropriate techniques, resources,
PO5 and modern engineering and IT tools including prediction and modelling to

2
 complex engineering activities with an understanding of the limitations.

The engineer and society: Apply reasoning informed by the contextual

PO6 knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.
Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental context, and demonstrate the
PO7
knowledge of, and need for sustainable development.

Ethics: Apply ethical principles and commit to professional ethics and

PO8 responsibilities and norms of the engineering practice.

Individual and team network: Function effectively as an individual, and as a

PO9 member or leader in diverse teams, and in multidisciplinary settings.

Communication: Communicate effectively on complex engineering activities

PO10 with the engineering community and with society at large, being able to
comprehend and write effective reports and design documentation, make
effective presentations, and give and receive clear instructions.
Project management and finance: Demonstrate knowledge and understanding

PO11 of the engineering and management principles and apply these to one’s own
work, as a member and leader in a team, to manage projects and in
multidisciplinary environments.
Life-Long learning: Recognize the need for, and have the preparation and able
PO12 to engage in independent and life-long learning in the broadest context of
technological change.
PROGRAM SPECIFIC OUTCOME’S:

Foundation of mathematical concepts: To use mathematical methodologies to

PSO1 crack problem using suitable mathematical analysis, data structure and suitable
algorithm.
Foundation of Computer Science: The ability to interpret the fundamental
PSO2 concepts and methodology of computer systems. Students can understand the
functionality of hardware and software aspects of computer systems.

Foundation of Software development: The ability to grasp the software

PSO3 development lifecycle and methodologies of software systems. Possess
competent skills and knowledge of software design process.

3
SYLLABUS

UNIT - I

Introduction - Well-posed learning problems, designing a learning system, Perspectives and issues in
machine learning Concept learning and the general to specific ordering – introduction, a concept learning
task, concept learning as search, find-S: finding a maximally specific hypothesis, version spaces and the
candidate elimination algorithm, remarks on version spaces and candidate elimination, inductive bias.
Decision Tree Learning – Introduction, decision tree representation, appropriate problems for decision
tree learning, the basic decision tree learning algorithm, hypothesis space search in decision tree learning,
inductive bias in decision tree learning, issues in decision tree learning.

UNIT - II
Artificial Neural Networks-1– Introduction, neural network representation, appropriate problems for
neural network learning, perceptions, multilayer networks and the back-propagation algorithm.

Artificial Neural Networks-2- Remarks on the Back-Propagation algorithm, An illustrative example: face
recognition, advanced topics in artificial neural networks.

Evaluation Hypotheses – Motivation, estimation hypothesis accuracy, basics of sampling theory, a

general approach for deriving confidence intervals, difference in error of two hypotheses, comparing
learning algorithms.

UNIT - III
Bayesian learning – Introduction, Bayes theorem, Bayes theorem and concept learning, Maximum
Likelihood and least squared error hypotheses, maximum likelihood hypotheses for predicting
probabilities, minimum description length principle, Bayes optimal classifier, Gibs algorithm, Naïve Bayes
classifier, an example: learning to classify text, Bayesian belief networks, the EM algorithm.
Computational learning theory – Introduction, probably learning an approximately correct hypothesis,
sample complexity for finite hypothesis space, sample complexity for infinite hypothesis spaces, the
mistake bound model of learning.

Instance-Based Learning- Introduction, k-nearest neighbour algorithm, locally weighted regression,

radial basis functions, case-based reasoning, remarks on lazy and eager learning.

4
UNIT - IV
Genetic Algorithms – Motivation, Genetic algorithms, an illustrative example, hypothesis space search,
genetic programming, models of evolution and learning, parallelizing genetic algorithms.

Learning Sets of Rules – Introduction, sequential covering algorithms, learning rule sets: summary,
learning First-Order rules, learning sets of First-Order rules: FOIL, Induction as inverted deduction,
inverting resolution.

Reinforcement Learning – Introduction, the learning task, Q–learning, non-deterministic, rewards and
actions, temporal difference learning, generalizing from examples, relationship to dynamic programming.

UNIT - V

Analytical Learning-1- Introduction, learning with perfect domain theories: PROLOG-EBG, remarks on
explanation-based learning, explanation-based learning of search control knowledge.

Analytical Learning-2- Using prior knowledge to alter the search objective, using prior knowledge to
augment search operators.

Combining Inductive and Analytical Learning – Motivation, inductive-analytical approaches to

learning, using prior knowledge to initialize the hypothesis.

TEXT BOOK

1. Machine Learning – Tom M. Mitchell, - MGH

Reference books:

1. Machine Learning: An Algorithmic Perspective, Stephen Marshland, Taylor & Francis

Web resources:

1. https://nptel.ac.in/courses/106105152
2. https://nptel.ac.in/courses/106106182
3. https://en.wikipedia.org/wiki/Machine_learning
4. https://www.javatpoint.com/machine-learning
5. https://www.tutorialspoint.com/machine_learning/index.htm

5
COURSE OBJECTIVES

 This course explains machine learning techniques such as decision tree learning, Bayesian learning
etc.
 To understand computational learning theory
 To study the pattern comparison techniques.

COURSE OUTCOMES

Students will be able to:

C321.1: Define the learning techniques and Discuss the mechanism of Concept Learning.
(Remember & Understand).
C321.2: Implement effectively Neural Networks for appropriate applications. (Apply).
C321.3: Apply Bayesian Techniques and Examine the hypothesis for Computational Learning.
(Apply & Analyze).
C321.4: Evaluate hypothesis and investigate instant based learning and reinforced learning.
(Evaluate & Create).
C321.5: Design Analytical Learning and investigate Explanation based learning. (Create).

6
 Mapping of Course Outcomes with PO’s and PSO’s:
High -3 Medium -2 Low-1

Course Program Outcomes Program Specific

Outcomes Outcomes

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

C321.1 3 3 3 3 3 - 2 - 2 - 2 3 3 3 3

C321.2 3 3 3 2 3 - 3 - - 3 - 3 3 3 3

C321.3 3 3 3 3 - 3 - - - 3 - 3 3 - -

C321.4 3 3 3 3 - - 3 - - - - 3 3 - -

C321.5 3 3 3 3 - - - - 3 - - 3 3 - -

C321 3 3 3 2.8 1.2 0.6 1.6 - 1 1.2 0.4 3 3 1.2 1.2

CO-PO Mapping Justification

C321.1: Define the learning techniques and Discuss the mechanism of Concept Learning.
(Remember & Understand).

Justification
PO1 Students will be able to apply the knowledge of mathematics to solve problems.
PO2 Students will be able to identify and analyse the problems based on the given dataset.
PO3 Students will be able to design solutions for complex datasets.
PO4 Students will be able to conduct research and investigate on complex problems.
PO5 Students will be able to use modern techniques to solve complex problems easily.
PO7 Students will be able to understand the requirements needed to the environment and
society.
PO9 Students will be able to work in any kind of environment and explain the concepts.
PO11 Students will be able to understand the engineering principles and apply them on their
datasets.
PO12 Students will be able to recognize the need and alter to the technological change.

C321.2: Implement effectively Neural Networks for appropriate applications. (Apply).

Justification
PO1 Students will be able to apply the mathematical concepts to construct neural network.
PO2 Students will be able to analyze the problem to define neural network.
PO3 Students will be able to develop the solution and design appropriate neural network.
PO4 Students will be able to conduct experiments before constructing neural network.

7
PO5 Students will be able to apply appropriate formulae to design neural network.
PO7 Students will be able to understand the impact of complex solutions and provide a
best solution for the datasets.
PO10 Students will be able to communicate effectively and provide good design for a
neural network.
PO12 Students will be able to recognize the need to use the neural network.

C321.3: Apply Bayesian Techniques and Examine the hypothesis for Computational Learning.
(Apply & Analyze).
Justification
PO1 Students will be able to use the mathematical concepts to compute the hypothesis.
PO2 Students will be able to analyze the problem and identify the principles to calculate
the hypothesis.
PO3 Students will be able to design the best solutions to get a good hypothesis.
PO4 Students will be able to use research based knowledge to solve complex problems.
PO6 Students will be able to assess the Bayesian techniques for complex problems.
PO10 Students will be able to Communicate easily and make effective presentations for
complex problems.
PO12 Students will be able to recognize the need and analyze the hypothesis for complex
problems.

C321.4: Evaluate hypothesis and investigate instant based learning and reinforced learning.
(Evaluate & Create).
Justification
PO1 Students will be able to apply the knowledge of mathematics and investigate the
hypothesis for a given problem.
PO2 Students will be able to identify the problem for the given learning mechanism.
PO3 Students will be able to develop solutions for different hypothesis.
PO4 Students will be able to conduct investigations on complex problems and interpret the
data and provides valid conclusion.
PO7 Students will be able to understand the context of hypothesis and provide good
solutions for complex problems.
PO12 Students will be able to recognize the need and evaluate the hypothesis.

C321.5: Design Analytical Learning and investigate Explanation based learning. (Create).
Justification
PO1 Students will be able to apply the knowledge of mathematics to design analytical
learning mechanisms.
PO2 Students will be able to analyze the learning problems.
PO3 Students will be able to develop solutions for various learning concepts.
PO4 Students will be able to conduct investigations by using research based knowledge
and interpret the data to provide valid conclusions.
PO9 Students will be able to function effectively as a team to solve complex problems.
PO12 Students will be able to recognize the need and design solutions for learning.

8
 Lesson Plan – (CS601PC) MACHINE LEARNING

Faculty Name: Year/Sem: III/II Academic Year: 2023-2024

w.e.f: 18-03-2024

Actual Teaching
L. No Name of the Topic Plan Date
Date Method
UNIT - 1
1 Introduction - Well-posed learning problems Chalk & Talk
2 Designing a learning system Chalk & Talk

3 Perspectives and issues in machine learning Chalk & Talk

Concept learning and the general to specific ordering

4 introduction, a concept learning task, concept Chalk & Talk
learning as search
find-S: finding a maximally specific hypothesis,
5 version spaces and the candidate elimination Chalk & Talk
algorithm
Remarks on version spaces and candidate
6 Chalk & Talk
elimination, inductive bias
Introduction, decision tree representation, appropriate
7 Chalk & Talk
problems for decision tree learning
The basic decision tree learning algorithm,
8 Chalk & Talk
hypothesis space search in decision tree learning
Inductive bias in decision tree learning, issues in
9 Chalk & Talk
decision tree learning.
10 Unit 1 - Review Chalk & Talk
UNIT – II
Artificial Neural Networks– Introduction,neural
11 network representation,appropriate problems for Chalk & Talk
neural network learning
12 Perceptrons, Multi layer networks Chalk & Talk
13 Back-propagation algorithm. Chalk & Talk
Remarks on the Back-Propagation algorithm, An
14 illustrative example: face recognition, advanced Chalk & Talk
topics in artificial neural networks.
Evaluation Hypotheses – Motivation, estimation
15 Chalk & Talk
hypothesis accuracy, basics of sampling theory

16 A general approach for deriving confidence intervals Chalk & Talk

17 difference in error of two hypotheses Chalk & Talk
18 comparing learning algorithms. Chalk & Talk
19 Unit 2 - Review Chalk & Talk

9
 UNIT III

20 Bayesian learning – Introduction, Bayes theorem Chalk & Talk

21 Bayes theorem and concept learning Chalk & Talk
22 Maximum Likelihood and least squared error hypotheses Chalk & Talk
Maximum likelihood hypotheses for predicting
23 Chalk & Talk
probabilities, Minimum description length principle

24 Bayes optimal classifier, Gibs algorithm Chalk & Talk

Naïve Bayes classifier, an example: learning to
25 Chalk & Talk
classify text

26 Bayesian belief networks, the EM algorithm. Chalk & Talk

Mid I Exams ( 27-05-24 To 01-06-24 )
Computational learning theory – Introduction,
27 Chalk & Talk
probably learning an approximately correct hypothesis
Sample complexity for finite hypothesis space and
28 Chalk & Talk
infinite hypothesis space

29 The mistake bound model of learning. Chalk & Talk

Instance-Based Learning- Introduction, k-nearest
30 Chalk & Talk
neighbour algorithm

31 locally weighted regression, radial basis functions Chalk & Talk

32 Case-based reasoning, remarks on lazy and eager learning. Chalk & Talk

33 Unit 3 - Review Chalk & Talk

UNIT- IV
Genetic Algorithms – Motivation, Genetic algorithms, an
34 Chalk & Talk
illustrative example,

35 hypothesis space search Chalk & Talk

36 genetic programming Chalk & Talk
37 models of evolution and learning Chalk & Talk
38 parallelizing genetic algorithms. Chalk & Talk
39 Learning Sets of Rules – Introduction Chalk & Talk

40 sequential covering algorithms Chalk & Talk

41 Learning rule sets: summary, learning First-Order rules Chalk & Talk

42 Learning sets of First-Order rules: FOIL Chalk & Talk

43 Induction as inverted deduction Chalk & Talk

10
44 Inverting resolution. Chalk & Talk

45 Reinforcement Learning – Introduction, the learning task Chalk & Talk

46 Q–learning, non-deterministic, rewards and actions Chalk & Talk

Temporal difference learning, generalizing from
47 Chalk & Talk
examples

48 Relationship to dynamic programming. Chalk & Talk

49 Unit 4 - Review Chalk & Talk
UNIT – V
Analytical Learning-1- Introduction, learning with
50 Chalk & Talk
perfect domain theories:PROLOG-EBG

51 remarks on explanation-based learning Chalk & Talk

explanation-based learning of search control
52 Chalk & Talk
knowledge.
Analytical Learning-2-Using prior knowledge to alter
53 Chalk & Talk
the search objective
54 using prior knowledge to augment search operators. Chalk & Talk
Combining Inductive and Analytical Learning –
55 Chalk & Talk
Motivation
56 inductive-analytical approaches to learning, Chalk & Talk
57 using prior knowledge to initialize the hypothesis. Chalk & Talk
58 Unit 5 - Review Chalk & Talk
Mid II Exams ( 12-08-24 To 17-08-24 )

11
 ASSIGNMENT-1

1). Define Well Posed Learning Problem. Write Three Examples.

2) What are the Perspectives and issues in Machine Learning?

3) What are the steps involved in designing a learning system.

4) Explain about Candidate Elimination Algorithm.

5) Define Concept Learning. Explain about Find-S Algorithm by considering Enjoy Sport Example.

6) What are the appropriate problems for Neural Networks Learning?

7).What is an ANN. Write the representation of ANN. Explain about Perceptron.

8) What is Bayes Theorem? Explain with an example.

ASSIGNMENT-2

1) Explain the learning sets of first order rules - FOIL Algorithm.

2). Describe the explanation based learning algorithm - PROLOG - EBG.
3). Design the process of Genetic Algorithms.
4). Examine the Sequential Covering Algorithms in a step by step manner.
5). Explain how to use Bayesian Classifier to learn text classification with an example.
6). Differentiate between lazy learners and eager learners.

12