The first few steps in building a CART for letter-to-sound. Follow along using the provided data set.
The training data
We need a set of labelled training data, because this is supervised machine learning.
The root node
We start by placing all the training data at the root node, and calculating its entropy.
Trying the first split of the root node
Next, we try splitting the data at the root node using one of the available questions...
Other possible splits of the root node
...and repeat for all other available questions. The best one is placed in the tree. Then we recurse.
