Next: Find-S Algorithm
Up: Concept Learning
Previous: Hypothesis Partial Ordering
- Begin with the most specific possible hypothesis in , generalize this hypothesis each time it fails to cover an observed
positive training example
- Find-S algorithm ignores negative examples.
- If the hypothesis space contains a hypothesis which describes
the true target concept & the training data contains no errors, then
the current hypothesis can never require a revision in response to a
negative example - Big If
Patricia Riddle
Fri May 15 13:00:36 NZST 1998