liveBook · Manning

Internal node

As explained in Timeless Algorithms, The Foundational Ideas

An internal node is a decision-tree node that tests a feature and directs observations along branches.

An internal node tests a feature and sends observations along branches according to the test’s outcome. Repeated splits partition the data into progressively more homogeneous groups; leaves hold the final predictions. section 5.3.1

Choosing a split

A tree might test income rather than credit history, or compare income against a threshold. The selected test determines how observations divide at that node. section 5.3.1

1.00-0.80=0.20 bits

The entropy calculation illustrates a split reducing uncertainty by 0.20 bits. section 5.3.1

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines feature-based decisions and recursive splitting, with entropy reduction guiding split selection.
Examples
Uses loan approval, house-price prediction, and choosing income or credit history as a split.
What you can do after
Understand how feature tests form paths from a tree’s root to its predictions.
How it connects
Connects decision trees to features, branches, leaf nodes, entropy, classification, and regression.

Also explained in

Compare how 4 books explain internal node →

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.