Module - 5 (Machine Learning)

Learning from Examples – Forms of Learning, Supervised Learning,

Learning Decision Trees, Generalization and overfitting, Evaluating
and choosing the best hypothesis, Regression and classification with
Linear models.
CO5: Illustrate different types of learning techniques used in
intelligent systems
• Here describe agents that can improve their
behaviour through diligent study of their own
experiences.
• An agent is learning if it improves its
performance on future tasks after making
observations about the world.
 FORMS OF LEARNING
• Any component of an agent can be improved by
learning from data. The improvements, and the
techniques used to make them, depend on four
major factors:
• Which component is to be improved.
• What prior knowledge the agent already has.
• What representation is used for the data and the
component.
• What feedback is available to learn from.
 Components to be learned
The components of these agents include:
1. A direct mapping from conditions on the
current state to actions.
2. A means to infer relevant properties of the
world from the percept sequence.
3. Information about the way the world evolves
and about the results of possible actions
the agent can take.
4. Utility information indicating the desirability of
world states.
• Each of these components can be learned. Consider, for
example, an agent training to become a taxi driver.
• Every time the instructor shouts “Brake!” the agent
might learn a condition– action rule for when to brake
(component 1); the agent also learns every time the
instructor does not shout.
• By seeing many camera images that it is told contain
buses, it can learn to recognize them (2).
• By trying actions and observing the results—for
example, braking hard on a wet road—it can learn the
effects of its actions (3).
• Then, when it receives no tip from passengers who have
been thoroughly shaken up during the trip, it can learn
a useful component of its overall utility function (4).
 1. Supervised learning
• Supervised learning is a type of machine
learning algorithm that learns from labelled
data.
• Labelled data is data that has been tagged with
a correct answer or classification.
• Supervised learning, as the name indicates, has
the presence of a supervisor as a teacher.
• Supervised learning is when we teach or train
the machine using data that is well-labelled.
Which means some data is already tagged with
the correct answer.
• After that, the machine is provided with a new
set of examples(data) so that the supervised
learning algorithm analyses the training
data(set of training examples) and produces a
correct outcome from labelled data.
• For example, a labelled dataset of images of
Elephant, Camel and Cow would have each
image tagged with either “Elephant” , “Camel"
or “Cow.”
• Key Points:
• Supervised learning involves training a machine
from labeled data.
• Labeled data consists of examples with the
correct answer or classification.
• The machine learns the relationship between
inputs (animal images) and outputs (animal
labels).
• The trained machine can then make predictions
on new, unlabeled data.
Types of Supervised Learning
• Supervised learning is classified into two
categories of algorithms:
• Regression:
• Regression is a type of supervised learning
that is used to predict continuous values.
• A regression problem is when the output
variable is a real value, such as “dollars” or
“weight”.
• Classification:
• Classification is a type of supervised learning that is
used to predict categorical values, such as whether a
customer is male or female, whether an email is spam
or not.
• A classification problem is when the output variable is
a category, such as “Red” or “blue” , “disease” or “no
disease”.
• classification algorithms include:
– Logistic Regression
– Support Vector Machines
– Decision Trees
– Random Forests
– Naive Baye
Advantages of Supervised learning
• Supervised learning allows collecting data and
produces data output from previous experiences.
• Helps to optimize performance criteria with the
help of experience.
• Supervised machine learning helps to solve
various types of real-world computation problems.
• It performs classification and regression tasks.
• It allows estimating or mapping the result to a
new sample.
• We have complete control over choosing the
number of classes we want in the training data.
Disadvantages of Supervised learning
• Classifying big data can be challenging.
• Training for supervised learning needs a lot of
computation time. So, it requires a lot of time.
• Supervised learning cannot handle all complex
tasks in Machine Learning.
• Computation time is vast for supervised
learning.
• It requires a labelled data set.
• It requires a training process.
 2.Unsupervised learning
• Unsupervised learning is a type of machine
learning that learns from unlabeled data.
• This means that the data does not have any
pre-existing labels or categories.
• The goal of unsupervised learning is to
discover patterns and relationships in the data
without any explicit guidance.
• Unlike supervised learning, no training will be
given to the machine. Therefore the machine
is restricted to find the hidden structure in
unlabeled data by itself.
• Key Points
• Unsupervised learning allows the model to discover
patterns and relationships in unlabeled data.
• Clustering algorithms group similar data points
together based on their inherent characteristics.
• Feature extraction captures essential information
from the data, enabling the model to make
meaningful distinctions.
• Label association assigns categories to the clusters
based on the extracted patterns and characteristics.
• Eg: Imagine a machine learning model trained on a large
dataset of unlabeled images, containing both dogs and
cats.
• Thus the machine has no idea about the features of dogs
and cats so can’t categorize it as ‘dogs and cats
• But it can categorize them according to their similarities,
patterns, and differences, i.e., we can easily categorize the
above picture into two parts. The first all pics
having dogs and then all pics having cats in them.
• Here you didn’t learn anything before, which means no
training data or examples.
• It allows the model to work on its own to discover
patterns and information that was previously undetected.
It mainly deals with unlabelled data.
• Types of Unsupervised Learning
• Unsupervised learning is classified into two
categories of algorithms:
• Clustering: A clustering problem is where you want
to discover the inherent groupings in the data, such
as grouping customers by purchasing behavior.
• Association: An association rule learning problem is
where you want to discover rules that describe
large portions of your data, such as people that buy
X also tend to buy Y.
Advantages of Unsupervised learning
• It does not require training data to be labeled.
• Dimensionality reduction can be easily accomplished
using unsupervised learning.
• Capable of finding previously unknown patterns in
data.
• Unsupervised learning can help you gain insights from
unlabeled data that you might not have been able to
get otherwise.
• Unsupervised learning is good at finding patterns and
relationships in data without being told what to look
for. This can help you learn new things about your
data.
Disadvantages of Unsupervised learning
• Difficult to measure accuracy or effectiveness due to
lack of predefined answers during training.
• The results often have lesser accuracy.
• The user needs to spend time interpreting and label
the classes which follow that classification.
• Unsupervised learning can be sensitive to data
quality, including missing values, outliers, and noisy
data.
• Without labeled data, it can be difficult to evaluate
the performance of unsupervised learning models,
making it challenging to assess their effectiveness.
3.Reinforcement learning
• In Reinforcement learning the agent learns from a
series of reinforcements—rewards or
punishments.
• For example, the lack of a tip at the end of the
journey gives the taxi agent an indication that it
did something wrong.
• The two points for a win at the end of a chess
game tells the agent it did something right. It is up
to the agent to decide which of the actions prior
to the reinforcement were most responsible for it.
• Hypothesis space is the set of all the possible
legal hypothesis. This is the set from which the
machine learning algorithm would determine
the best possible (only one) which would best
describe the target function or the outputs.
• Figure 18.1(a) shows some data with an exact fit
by a straight line (the polynomial 0.4x + 3). The
line is called a consistent hypothesis because it
agrees with all the data.
• Figure 18.1(b) shows a high degree polynomial
that is also consistent with the same data. This
illustrates a fundamental
• How do we choose from among multiple
consistent hypotheses?
• One answer is to prefer the simplest hypothesis
consistent with the data
• This principle is called Ockham’s razor, after
the 14th-century English philosopher William
of Ockham, who used it to argue sharply
against all sorts of complications.
• Defining simplicity is not easy, but it seems
clear that a degree-1 polynomial is simpler
than a degree-7 polynomial, and thus (a)
should be preferred to (b).
 LEARNING DECISION TREES
• A decision tree is a type of supervised learning
algorithm that is commonly used in machine learning
to model and predict outcomes based on input data.
• It is a tree-like structure where each internal node
tests on attribute, each branch corresponds to
attribute value and each leaf node represents the
final decision or prediction.
• The decision tree algorithm falls under the category
of supervised learning. They can be used to solve
both regression and classification problems.