Version spaces: the S and G boundaries, step by step

What the exam asks you to produce: a multi step S and G trace, one example at a time, showing all minimal specialisations on a negative and all minimal generalisations on a positive, with the reason printed beside every hypothesis that was pruned away, and then a classification of new instances as +, as minus, or as cannot decide.

step 0 / 0
ready

Current example

The two boundaries

G at the top of the lattice: the maximally general hypotheses still consistent with the data
version space
S at the bottom of the lattice: the maximally specific hypotheses still consistent with the data

the arrow runs down the lattice, from more general to more specific

Why each hypothesis left, this step

Candidates

Written answer so far (one row per step)

Taxonomies

value in the hypothesis being moved value in the negative example value in the positive example a minimal move visited but not a minimal move (it still covers the example, or a more general node already works)

Version space size

Classify a new instance

Uses G and S as they stand at the current step (deck pp.57 to 60: partially learned concepts).

This problem