liveBook · Manning

Split

As explained in Timeless Algorithms, The Foundational Ideas

A decision-tree split partitions observations at a node according to a feature-based rule.

A split partitions the observations at a tree node using a feature and a dividing point. Classification trees choose splits that reduce class impurity; with entropy, this is expressed as information gain. Regression trees choose splits that reduce variation in the numerical outcome. section 9.1

Tree training is greedy: each split is selected for its immediate improvement, without looking ahead or revisiting earlier choices. The locally best split need not produce the best overall tree. section 9.1.1

Small changes in the training sample can change which candidate split is selected, especially when candidates perform similarly. A change near the root redirects observations into different branches, potentially changing the structure of the tree that follows. section 9.1.1

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Explains split criteria and greedy selection, then traces how early choices can alter later branches.
What you can do after
Understand how local split choices affect tree structure and the paths observations follow.
How it connects
Connects splits to decision trees, entropy, information gain, impurity reduction, and variance reduction.

Also explained in

Compare how 4 books explain split →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.