Split
A decision-tree split is a rule that partitions observations at a node into subsets according to a feature and a condition on its value.
Statistics Every Programmer Needs
A split is a decision rule that partitions observations at a decision-tree node according to a feature and condition.
- How it is used
- Partitions observations into increasingly specific decision paths for classification or regression predictions.
- How deep it goes
- Explains thresholds, node traversal, root selection, and pruning, but does not develop impurity or pruning mathematics.
- Examples
- Uses TO_GO, PLAY_TYPE, and SCORE_DIFFERENTIAL thresholds to classify fourth-down conversion attempts.
- What you can do after
- Evaluate tree predictions by tracing feature conditions from the root through internal nodes to a terminal leaf.
Statistics Slam Dunk
A tree split is a rule that partitions observations into child regions according to the value of a predictor.
- How it is used
- Partitions predictor space into regions that support regression-tree predictions.
- How deep it goes
- Explains regional partitioning, split importance, thresholds, and terminal nodes, but not the algorithm selecting each split.
- Examples
- Uses screen_assists_pts greater than 26.05 and a visualized ten-terminal-node wins tree.
- What you can do after
- Evaluate/understand how predictor thresholds divide observations and lead to regional predictions.
Related concepts
- decision treepart of · A decision tree is a branching structure that represents sequential tests or choices, with paths leading to outcomes, predictions, or actions.
- accuracymeasured by · Accuracy is the degree to which an output, prediction, or measurement agrees with a correct or reference outcome under a specified criterion.
- thresholduses · A threshold is a boundary value against which a quantity is compared to determine whether a condition is met or an action or decision is triggered.
- weighted average Gini impuritymeasured by · Weighted average Gini impurity is the sample-size-weighted average of the Gini impurities of the subsets produced by a decision-tree split.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.