Service Analytics
Lernen
« zurück zur Kartenübersicht « Liste
34/225 [34]

5. Classification

Tree Construction Algorithm

1. Start at the root node.

2. For each variable X, find the set S1 that minimizes the sum of the node impurities in the two child nodes and choose the split {X∗,S∗} that gives the minimum over all X and S.

3. If a stopping criterion is reached, exit. Otherwise, apply step 2 to each child node in turn.

Diskussion