Scribd
Upload
4 views2 pages

Experiment 2

The document outlines the Candidate-Elimination algorithm for machine learning, which identifies all hypotheses consistent with a given set of training examples stored in a .CSV file. It describes the initialization of maximally general and specific hypotheses, and the iterative process of refining these sets based on positive and negative training examples. The document also includes a sample set of training examples related to weather conditions and their impact on enjoying sports.

Uploaded by

chiranjeevi.pt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views2 pages

Experiment 2

The document outlines the Candidate-Elimination algorithm for machine learning, which identifies all hypotheses consistent with a given set of training examples stored in a .CSV file. It describes the initialization of maximally general and specific hypotheses, and the iterative process of refining these sets based on positive and negative training examples. The document also includes a sample set of training examples related to weather conditions and their impact on enjoying sports.

Uploaded by

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

Machine Learning

2. For a given set of training data examples stored in a .CSV file, implement and demonstrate
the Candidate-Elimination algorithm to output a description of the set of all hypotheses
consistent with the training examples.

CANDIDATE-ELIMINATION Learning Algorithm

The CANDIDATE-ELIMINTION algorithm computes the version space containing all


hypotheses from H that are consistent with an observed sequence of training examples.

Initialize G to the set of maximally general hypotheses in H


Initialize S to the set of maximally specific hypotheses in H
For each training example d, do
• If d is a positive example
• Remove from G any hypothesis inconsistent with d
• For each hypothesis s in S that is not consistent with d
• Remove s from S
• Add to S all minimal generalizations h of s such that
• h is consistent with d, and some member of G is more general than h
• Remove from S any hypothesis that is more general than another hypothesis in S

• If d is a negative example
• Remove from S any hypothesis inconsistent with d
• For each hypothesis g in G that is not consistent with d
• Remove g from G
• Add to G all minimal specializations h of g such that
• h is consistent with d, and some member of S is more specific than h
• Remove from G any hypothesis that is less general than another hypothesis in G

CANDIDATE- ELIMINTION algorithm using version spaces

Training Examples:

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

1
Machine Learning

Program:

You might also like