recurse

recurse

References in periodicals archive ?
Pseudo-code for building a decision tree Check for base cases For each attribute a Find the feature that best divides the training data such as information gain from splitting on a Let a best be the attribute with the highest normalized information gain Create a decision node node that splits on a best Recurse on the-sub-lists obtained by splitting on a best and add those nodes as children of node
This was advocated long time ago [27, 28], but without recurse to C-space.