DT

Decision Tree Induction Explorer

Step 0 / 0
Node Training Samples Node N = 10
Evaluated Candidate Splits I(D) = 0.480
Condition Left Subtree Right Subtree Gain (ΔI) Status
Constructed Tree Depth: 0 / 2
Left Child (Condition True)
Right Child (Condition False)
Optimal Split (Max ΔI)
Tip: Click any candidate row in the centre table to preview its partition.