Scribd
Upload
9 views18 pages

concept learning

The document discusses concept learning tasks, specifically focusing on the EnjoySport concept, which utilizes positive and negative training examples. It explains how hypotheses are represented as vectors of constraints for various attributes and introduces the FIND-S algorithm for finding maximally specific hypotheses, as well as the Candidate Elimination algorithm for identifying all consistent hypotheses. The concept of version space is also introduced, which encompasses the set of all hypotheses consistent with observed training examples, and details the process of updating the general and specific boundaries as new examples are considered.

Uploaded by

ibk2007
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
9 views18 pages

concept learning

The document discusses concept learning tasks, specifically focusing on the EnjoySport concept, which utilizes positive and negative training examples. It explains how hypotheses are represented as vectors of constraints for various attributes and introduces the FIND-S algorithm for finding maximally specific hypotheses, as well as the Candidate Elimination algorithm for identifying all consistent hypotheses. The concept of version space is also introduced, which encompasses the set of all hypotheses consistent with observed training examples, and details the process of updating the general and specific boundaries as new examples are considered.

Uploaded by

ibk2007
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/ 18

CONCEPT LEARNING

Concept Learning Tasks

Positive and negative training examples for the target concept


EnjoySport.
Concept Learning Tasks
• Let each hypothesis be a vector of six constraints,
specifying the values of the six attributes Sky, AirTemp,
Humidity, Wind, Water, and Forecast.
• For each attribute, the hypothesis will either
• indicate by a "?' that any value is acceptable for this attribute,
• specify a single required value (e.g., Warm) for the attribute, or
• indicate by a "0" that no value is acceptable.
• To illustrate, the hypothesis that Anand enjoys his favorite
sport only on cold days with high humidity (independent of
the values of the other attributes) is represented by the
expression
Concept Learning Tasks
Concept Learning Tasks
General-to-Specific Ordering of Hypotheses

for any instance x in X and hypothesis h in H, we say that x satisfies h if


and only if h(x) = 1

Given hypotheses hj and hk, hj is more-general-than-equal_to hk if and only


if any instance that satisfies hk also satisfies hj.
• set H of all hypotheses

set X of all instances set H of all hypotheses


FIND-S: FINDING A MAXIMALLY SPECIFIC
HYPOTHESIS
CANDIDATE ELIMINATION ALGORITHM
• finds all describable hypotheses that are consistent with
the observed training examples

• The CANDIDATE-ELIMINATION algorithm represents the


set of all hypotheses consistent with the observed training
examples
Version Space
• This subset of all hypotheses is called the version space
with respect to the hypothesis space H and the training
examples D
General and Specific boundary
• The algorithm begins by initializing the version space to the
set of all hypotheses in H; that is, by initializing the G
boundary set to contain the most general hypothesis in H

• and initializing the S boundary set to contain the most


specific (least general) hypothesis

• As each training example is considered, the S and G


boundary sets are generalized and specialized, respectively,
to eliminate from the version space any hypotheses found
inconsistent with the new training example.
Final Version Space for ‘EnjoySport’ Concept
Learning Problem

You might also like