Scribd
Upload
44 views26 pages

1 4

Concept learning can be viewed as searching through a large hypothesis space to find the hypothesis that best fits the training examples. General-to-specific learning algorithms start with a general hypothesis and make it more specific to match the training data. The version space algorithm maintains the set of all hypotheses consistent with the training examples bounded by the most general and specific hypotheses.

Uploaded by

Rao Kunal
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
44 views26 pages

1 4

Concept learning can be viewed as searching through a large hypothesis space to find the hypothesis that best fits the training examples. General-to-specific learning algorithms start with a general hypothesis and make it more specific to match the training data. The version space algorithm maintains the set of all hypotheses consistent with the training examples bounded by the most general and specific hypotheses.

Uploaded by

Rao Kunal
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/ 26

Concept Learning as Search:

Concept learning can be viewed as the task


searchin throug of a large space of
g
implicitly defined
h by the
hypothesis
hypothesis representation.

The goal of the concept learning search is to find the


hypothesis that best fits the training examples.
General-to-Specific Learning Most
General-to-Specific Learning:
Example Sky AirTemp Humidity Wind Water Forecast EnjoySport

1 Sunny Warm Normal Strong Warm Same Yes

2 Sunny Warm High Strong Warm Same Yes

3 Rainy Cold High Strong Warm Change No

4 Sunny Warm High Strong Cool Change Yes

h1=(Sunny,?,?,Strong,?,?)
h2=(Sunny,?,?,?,?,?)

*h2 is more general than h1.


*h2 imposes fewer constraints on the instance than
h1.
FIND-S: Finding a Maximally
Specific Hypothesis:
1-Initialize h to the most specific hypotesis in
h 2-for each positive training instance x
- For each attribute constraint aj in
h
if the constraint aj is satisfied by
x then do nothing
else replace aj in h by the next
more general constraint that is satisfied by x

3- output hypothesis h.
Step 1: FIND-S:
Example Sky AirTemp Humidity Wind Water Forecast EnjoySport

1 Sunny Warm Normal Strong Warm Same Yes

2 Sunny Warm High Strong Warm Same Yes

3 Rainy Cold High Strong Warm Change No

4 Sunny Warm High Strong Cool Change Yes

Initialize h to the most specific hypotesis in


h

h0 = <Ø, Ø, Ø, Ø, Ø, Ø>
Step 2: FIND-S :
Version Space:
The set of all valid hypotheses provided by an algorithm is
called version space (VS)with respect to the hypothesis
space H and the given example set D.

Candidate-Elimination Algorithm:
* The Candidate-Eliminationalgorithm finds all
describable hypotheses that are consistent with the
observed training examples.
* Hypothesis is derived from examples regardless of
whether x is positive or negative example
LIST-THEN-ELIMINATE Algorithm
to Obtain Version Space:
 In principle, the LIST-THEN-ELIMINATE algorithm
can be applied whenever the hypothesis space H is
finite.

 It is guaranteed to output all hypotheses consistent


with the training data.

 Unfortunately, it requires exhaustively enumerating all


hypotheses in H-an unrealistic requirement for all
but the most trivial hypothesis spaces.
Candidate-Elimination Algorithm:
•The CANDIDATE-ELIMINATION algorithm works
on the same principleas the above LIST-THEN-
ELIMINATE algorithm.
•It employs a much more compact representation
of the version space.
•In this the version spaceis represented by its
most general and least general members
(Specific).
•These members form general and specific
boundary sets that delimit the version space
within the partially ordered hypothesis
Example :
Example Sky AirTemp Humidity Wind Water Forecast EnjoySport

1 Sunny Warm Normal Strong Warm Same Yes

2 Sunny Warm High Strong Warm Same Yes

3 Rainy Cold High Strong Warm Change No

4 Sunny Warm High Strong Cool Change Yes


What will Happen if the Training
Contains errors ?
Example Sky AirTemp Humidity Wind Water Forecast EnjoySport

1 Sunny Warm Normal Strong Warm Same Yes

2 Sunny Warm High Strong Warm Same No

3 Rainy Cold High Strong Warm Change No

4 Sunny Warm High Strong Cool Change Yes

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy