Consistency
List-then-enumerate algorithm
- Let version space := list of all hypotheses in H
- For each training example <x, c(x)>
- remove any inconsistent hypothesis from version space
- Output any hypothesis in the version space
Def: Hypothesis H is consistent with a set of training examples D
iff H(x) = c(x) for each example <x, c(x)> in D
Def: The version space with respect to hypothesis space H and
training examples D is the subset of H which is consistent with D
But what if one could represent version space implicitly??