Machine Learning 101 Practice Test: Version Spaces, Find-S Algorithm And Candidate Elimination Algorithm — Flashcards

A version space is a hierarchial 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 find-S algorithm finds the most specific hypothesis that fits all the positive examples. The algorithm considers only those positive training example.
The candidate elimination algorithm incrementally builds the version space given a hypothesis space H and a set E of examples. The examples are added one by one; each example possibly shrinks the version space by removing the hypotheses that are inconsistent with the example.