Scribd
Upload
24 views16 pages

Hypothesis in ML

A hypothesis in machine learning represents the model's assumption about the relationship between input features and outputs, aiming to minimize the difference between expected and actual results. The hypothesis space consists of all possible hypotheses from which the best one is selected based on the training data. The Find-S algorithm is a specific method used to derive the most specific hypothesis from positive training examples, generalizing it as needed through a series of steps.

Uploaded by

Shashank Tyagi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
24 views16 pages

Hypothesis in ML

A hypothesis in machine learning represents the model's assumption about the relationship between input features and outputs, aiming to minimize the difference between expected and actual results. The hypothesis space consists of all possible hypotheses from which the best one is selected based on the training data. The Find-S algorithm is a specific method used to derive the most specific hypothesis from positive training examples, generalizing it as needed through a series of steps.

Uploaded by

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

Hypothesis in Machine

Learning
Hypothesis in Machine L earning

A hypothesis in machine learning is the model’s presumption regarding the


connection between the input features and the result.
It is an illustration of the mapping function that the algorithm is attempting to
discover using the training set.
To minimize the discrepancy between the expected and actual outputs, the
learning process involves modifying the weights that parameterize the
hypothesis.
The objective is to optimize the model’s parameters to achieve the best
predictive performance on new, unseen data, and a cost function is used to
assess the hypothesis’ accuracy.
How does a Hypothesis work?
• In most supervised machine learning algorithms, our main goal is to
find a possible hypothesis from the hypothesis space that could map
out the inputs to the proper outputs.
• The following figure shows the common method to find out the
possible hypothesis from the Hypothesis space:
• Hypothesis Space (H)
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.
• A hypothesis is a function that best describes the target in supervised machine
learning. The hypothesis that an algorithm would come up depends upon the data
and also depends upon the restrictions and bias that we have imposed on the
data.
• The Hypothesis can be calculated as:
y=mx + by
where,
• y = range
• m = slope of the lines
• x = domain
• b = intercept
• Hypothesis in machine learning are formulated based on various
algorithms and techniques, each with its representation. For example:
FIND–S ALGORITHM
The find-S algorithm is a basic concept learning algorithm in machine
learning.
The find-S algorithm finds the most specific hypothesis that fits all the
positive examples.
We have to note here that the algorithm considers only those positive
training example.
The find-S algorithm starts with the most specific hypothesis and
generalizes this hypothesis each time it fails to classify an observed
positive training data.
Hence, the Find-S algorithm moves from the most specific hypothesis to
the most general hypothesis.
1. ? indicates that any value is acceptable for the attribute.
2. specify a single required value ( e.g., Cold ) for the attribute.
3. Φ indicates that no value is acceptable.
4. The most general hypothesis is represented by: {?, ?, ?, ?, ?, ?}
5. The most specific hypothesis is represented by: {ϕ , ϕ, ϕ, ϕ, ϕ, ϕ}
Steps:
1. Start with the most specific hypothesis.
h = {ϕ, ϕ, ϕ, ϕ, ϕ, ϕ}
2. Take the next example and if it is negative, then no changes occur
to the hypothesis.
3. If the example is positive and we find that our initial hypothesis is
too specific then we update our current hypothesis to a general
condition.
4. Keep repeating the above steps till all the training examples are
complete.
5. After we have completed all the training examples we will have the
final hypothesis when can use to classify the new examples.
FIND-S Algorithm
Example 1
• Step 2:
h2=(many, big, no, expensive, one)
X3=(some, big, always, expensive, few) –No
Negative example hence ignore
h3=(many , big, no, expensive, one)
X4=(many, medium, no, expensive, many)-yes
h4=(many , ?, no, expensive,?)
Question

You might also like