Candidate elimination example
Download as PPTX, PDF•3 likes•6,477 views
The Candidate Elimination algorithm removes hypotheses from sets S and G that are inconsistent with negative examples. When a negative example is observed, inconsistent hypotheses are removed from S and G. Specializations of inconsistent hypotheses are added to G if they are consistent with the negative example and more specific than another hypothesis in S. Hypotheses in G that are less general than others are also removed.
Candidate elimination example
- 1. Candidate Elimination Algorithm If d is a negative example Remove from S any hypothesis that is 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 consistent with d Some member of S is more specific than h Remove from G any hypothesis less general than another in G
- 2. Candidate Elimination: example {<, , , , , >}S: {<?, ?, ?, ?, ?, ?>}G: {< Sunny Warm Normal Strong Warm Same >}S: {<?, ?, ?, ?, ?, ?>}G: {< Sunny Warm ? Strong Warm Same >}S: {<?, ?, ?, ?, ?, ?>}G: x1 = <Sunny Warm Normal Strong Warm Same> + x2 = <Sunny Warm High Strong Warm Same> +
- 3. Candidate Elimination: example {< Sunny Warm ? Strong Warm Same >}S: {<?, ?, ?, ?, ?, ?>}G: {< Sunny Warm ? Strong Warm Same >}S: {<Sunny,?,?,?,?,?>, <?,Warm,?,?,?>, <?,?,?,?,?,Same>}G: {< Sunny Warm ? Strong ? ? >}S: {<Sunny,?,?,?,?,?>, <?,Warm,?,?,?> }G: x3 = <Rainy Cold High Strong Warm Change> - x4 = <Sunny Warm High Strong Cool Change> +