Candidate Elimination Algorithm
Initialize G to set of maximally general hypotheses
Initialize S to set of maximally specific hypotheses
For each training example d, do:
If d is a positive example:
Remove from G any hyp inconsistent with d
For each hyp in S that is not consistent with d
Add to S all minimal generalizations h of s
such that consistent(h, d) and
? g?G and g is more general than h
? s ? S, Remove s if s more general than t?S
If d is a negative example...