MACHINE LEARNING

UNIT-1
By, Mrutyunjaya S Yalawar
By, Mrutyunjaya S Yalawar, Dept of CSE A.Y.2020-2021
Introduction
• Machine Learning algorithms enable the
computers to learn from data, and even improve
themselves, without being explicitly
programmed.
• Any field that needs to interpret and act on data
can benefit from machine learning techniques.
• The goal of this course is to present key
algorithms and theory that form the core of
machine learning with a balanced presentation
of both theory and practice.
By, Mrutyunjaya S Yalawar, Dept of CSE
Prerequisites
• Data Structures
• Knowledge on statistical methods

By, Mrutyunjaya S Yalawar, Dept of CSE

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.
By, Mrutyunjaya S Yalawar, Dept of CSE
Course Outcomes
• Understand the concepts of
computational intelligence like machine
learning
• Ability to get the skill to apply machine
learning techniques to address the real
time problems in different areas
• Understand the Neural Networks and its
usage in machine learning application
By, Mrutyunjaya S Yalawar, Dept of CSE
JNTUH Syllabus
R18 Regulations

By, Mrutyunjaya S Yalawar, Dept of CSE

UNIT-I 10 Hours

• 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.

By, Mrutyunjaya S Yalawar, Dept of CSE

Machine Learning
• Learning ↔ Intelligence
(Def: Intelligence is the ability to learn and use
concepts to solve problems.)
• Machine Learning ↔ Artificial Intelligence
• Def: AI is the science of making machines do things
that require intelligence if done by men (Minsky
1986)
• Def: Machine Learning is an area of AI concerned
with development of techniques which allow
machines to learn.
• Why Machine Learning? ↔ Why Artificial
Intelligence?
By, Mrutyunjaya S Yalawar, Dept of CSE
By, Mrutyunjaya S Yalawar, Dept of CSE
By, Mrutyunjaya S Yalawar, Dept of CSE
• Learning ↔ Intelligence
(Def: Intelligence is the ability to learn and use concepts
to solve problems.)

• Machine Learning ↔ Artificial Intelligence

Def: AI is the science of making machines do things that
require intelligence if done by men (Minsky 1986)
Def: Machine Learning is an area of AI concerned with
development of techniques which allow machines to
learn

• Why Machine Learning? ↔ Why Artificial Intelligence?

To build machines exhibiting intelligent behaviour (i.e.,
able to reason, predict, and adapt) while helping humans
work, study, and entertain themselves.

By, Mrutyunjaya S Yalawar, Dept of CSE

• Machine Learning ↔ Artificial Intelligence
• Machine Learning ← Biology (e.g., Neural Networks,
Genetic Algorithms)
• Machine Learning ← Cognitive Sciences (e.g., Case-
based Reasoning)
• Machine Learning ← Statistics (e.g., Support Vector
Machines)
• Machine Learning ← Probability Theory (e.g., Bayesian
Networks)
• Machine Learning ← Logic (e.g., Inductive Logic
Programming)
• Machine Learning ← Information Theory (e.g., used by
Decision Trees)
By, Mrutyunjaya S Yalawar, Dept of CSE
 Applications
• The highly complex nature of many real-world problems,
though, often means that inventing specialized algorithms that
will solve them perfectly every time is impractical, if not
impossible.

• Examples of machine learning problems include, “Is this

cancer?”, “What is the market value of this house?”, “Which
of these people are good friends with each other?”, “Will this
rocket engine explode on take off?”, “Will this person like this
movie?”, “Who is this?”, “What did you say?”, and “How do
you fly this thing?”.

• All of these problems are excellent targets for an ML project,

and in fact ML has been applied to each of them with great
success.

By, Mrutyunjaya S Yalawar, Dept of CSE

Well-posed learning problems

By, Mrutyunjaya S Yalawar, Dept of CSE

 Well-posed learning problems.
• Def 1 (Mitchell 1997): A computer program is
said to learn from experience E with respect to
some class of tasks T and performance
measure P, if its performance at tasks in T, as
measured by P, improves by experience E.

• Def 2 (Hadamard 1902): A (machine learning)

problem is well-posed if a solution to it exists, if
that solution is unique, and if that solution
depends on the data / experience but it is not
sensitive to (reasonably small) changes in the
data / experience.

By, Mrutyunjaya S Yalawar, Dept of CSE

 Continuation…….
• A checkers learning problem
Task T : playing checkers.
Performance measure P : percent of games won
against opponents.
Training experience E : playing practice games
against itself.

• A handwriting recognition learning problem

Task T : recognizing and classifying handwritten
words within images.
Performance measure P : percent of words correctly
classified
Training experience E : a database of handwritten
words with given classifications.
By, Mrutyunjaya S Yalawar, Dept of CSE
Checker Game

By, Mrutyunjaya S Yalawar, Dept of CSE

 .

By, Mrutyunjaya S Yalawar, Dept of CSE

 .

By, Mrutyunjaya S Yalawar, Dept of CSE

Designing a learning system.

By, Mrutyunjaya S Yalawar, Dept of CSE

Designing a learning system.

• In other ways like……..

1) Choosing the Training
Experience.
2) Choosing the Target
Function.
3) Choosing a Representation
for the Target Function.
4) Choosing a Function
Approximation Algorithm.
5) The Final Design.
By, Mrutyunjaya S Yalawar, Dept of CSE
Designing a learning system (Conti….)

By, Mrutyunjaya S Yalawar, Dept of CSE

 Perspectives and Issues in Machine
Learning
• What algorithms exist for learning general
target functions from specific training examples
?

• How does the number of training examples

influence accuracy ?

• When and how can prior knowledge held by

the learner guide the process of generalizing
from examples ?
By, Mrutyunjaya S Yalawar, Dept of CSE
 Issues in Machine Learning (cont.)
• What is the best strategy for choosing a useful next
training experience, and how does the choice of
this strategy alter the complexity of the learning
problem ?

• What is the best way to reduce the learning task to

one or more function approximation problems ?

• How can the learner automatically alter its

representation to improve its ability to represent
and learn the target function ?

By, Mrutyunjaya S Yalawar, Dept of CSE

Concept Learning

By, Mrutyunjaya S Yalawar, Dept of CSE

Concept learning
Concept learning
• supervised, eager learning
• target problem: whether something belongs to the
target concept or not.
• target function: V: D → {true, false}

• Underlying idea: Humans acquire general concepts from

specific examples (e.g., concepts: beauty, good friend,
well-fitting-shoes) (note: each concept can be thought of
as Boolean-valued function)

• Concept learning is inferring a Boolean-valued function

from training data
→ concept learning is the prototype binary classification.
By, Mrutyunjaya S Yalawar, Dept of CSE
.

By, Mrutyunjaya S Yalawar, Dept of CSE

 .

By, Mrutyunjaya S Yalawar, Dept of CSE

 .

By, Mrutyunjaya S Yalawar, Dept of CSE

 .

By, Mrutyunjaya S Yalawar, Dept of CSE

Concept Learning Task – Notation

By, Mrutyunjaya S Yalawar, Dept of CSE

Concept Learning as Search

By, Mrutyunjaya S Yalawar, Dept of CSE

By, Mrutyunjaya S Yalawar, Dept of CSE
 Thank You

By, Mrutyunjaya S Yalawar, Dept of CSE