Scribd
Upload
7 views25 pages

ML Reference-Material-II

The document explains the concept of version spaces in knowledge representation, which allows for tracking useful information from learning examples without retaining the examples themselves. It discusses concept learning as a search for the best-fitting hypothesis among a large space of possibilities, highlighting methods like General-to-Specific Learning and the FIND-S algorithm for identifying specific hypotheses. Additionally, it introduces the Candidate-Elimination algorithm, which efficiently represents the version space using its most general and specific hypotheses.

Uploaded by

adhi lionel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views25 pages

ML Reference-Material-II

The document explains the concept of version spaces in knowledge representation, which allows for tracking useful information from learning examples without retaining the examples themselves. It discusses concept learning as a search for the best-fitting hypothesis among a large space of possibilities, highlighting methods like General-to-Specific Learning and the FIND-S algorithm for identifying specific hypotheses. Additionally, it introduces the Candidate-Elimination algorithm, which efficiently represents the version space using its most general and specific hypotheses.

Uploaded by

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

Version Spaces

A version space is a hierarchical representation of knowledge that


enables you to keep track of all the useful information supplied by a
sequence of learning examples without remembering any of the
examples.

The version space method is a concept learning process


accomplished by managing multiple models within a version space.
Concept Learning
Concept Learning as Search:

Concept Learning can be viewed as the task of


searching through a large space of hypothesis
implicitly defined by the hypothesis representation.

The goal of the concept learning search is to find the


hypothesis that best fits the training examples.

Note: A hypothesis is an assumption, an idea that is proposed for the sake of argument so
that it can be tested to see if it might be true.
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 :
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


Example Sky AirTemp Humidity Wind Water Forecast EnjoySport
Example Sky AirTemp Humidity Wind Water Forecast EnjoySport
1 Sunny Warm Normal Strong Warm Same Yes
1 Sunny Warm Normal Strong Warm Same Yes
2 Sunny Warm High Strong Warm Same Yes
2 Sunny Warm High Strong Warm Same Yes
3 Rainy Cold High Strong Warm Change No
3 Rainy Cold High Strong Warm Change No
4 Sunny Warm High Strong Cool Change Yes
4 Sunny Warm High Strong Cool Change Yes
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


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 negativeexample
Candidate-Elimination Algorithm:
• CANDIDATE-ELIMINATION 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 space.
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

You might also like