Decision Tree Gini Split Calculator
Find the best binary split of one numeric feature by weighted binary-class Gini impurity.
YOUR CALCULATION
Result
—
Calculation steps
Work through one step at a time or reveal the complete calculation. The steps use your current inputs.
How to calculate
Test midpoint thresholds between consecutive distinct sorted feature values.
Gini=2p(1−p); split score=(nLeft GiniLeft+nRight GiniRight)/n
Worked example
x1,2,3,4 and labels0,0,1,1 split perfectly at2.5.
Assumptions and input details
Equal-weight binary training observations only, deterministic lowest-threshold tie rule. No categorical splits, missing values, pruning, validation or causal interpretation.
Using this calculator
Can I enter my own problem?
Yes. Replace the example values with your own inputs. The result, calculation steps, tables and applicable diagrams update from those inputs. Blank or invalid values clear the result; example values are never silently substituted for missing inputs.
Are the results exact?
Results use floating-point arithmetic and displayed rounding. Read the formula, assumptions and any stated data precision before interpreting the result.
Is my input uploaded?
The calculation runs in your browser. No account, file upload or external AI service is required. Inputs are not saved between page reloads.
Calculate precision, recall, specificity, F1, accuracy, balanced accuracy and MCC from a declared positive-class count table.
Fit binary outcomes against one numeric predictor using an explicit standardized-slope L2 penalty and evaluate a query probability.
Build a tied-score ROC sweep and calculate trapezoidal AUC plus noninterpolated average precision from labeled numeric scores.
Reserved advertising space.