Greedy Split Search
A step-by-step walkthrough of how a decision tree picks where to split a node. With five observations and four candidate thresholds, the artifact traces the RSS computation for each split and lets the reader see why greedy search gains in clarity what it loses in global optimality. Interactive animation and live computation, bilingual.