About Decision Tree Overfitting
This page grows an iris tree to depth 10 with 40% of the rows held out, so you can compare accuracy on the rows it learned with accuracy on rows it never saw. It is free, needs no sign-up and runs in your browser, so nothing you enter is uploaded.
With a deep limit the tree keeps splitting until every leaf is pure, which fits noise as well as signal. Training accuracy goes to 100%. Test accuracy does not follow, because the extra splits describe quirks of the training rows. Lower the maximum depth to 2 and the training accuracy falls slightly while the test accuracy holds or rises, a sign of a model that generalises better.
The iris data is easy and small, so the effect here is mild; on noisy real data the gap is usually much larger. A 40% test share means the test figure is itself noisy with 150 rows, so try different depths and compare, not a single number.
How to use Decision Tree Overfitting
- Pick a sample dataset, or paste your own CSV with a header row.
- Choose the target column, the one you want to predict. It should have a handful of classes.
- Choose Gini impurity or entropy, and set the maximum depth and the minimum number of rows needed to split a node.
- Set a test share, for example 20%, to hold some rows back and measure accuracy on unseen data.
- Read the accuracy figures, then look at the tree. Tap a box to fold its branch, or scroll sideways on a small screen.
- Check the feature importance chart, and open the rules to copy the tree as text.
Features
- Numeric columns split on a threshold; text columns get one branch per value.
- Gini impurity or entropy as the split quality measure.
- Maximum depth, minimum rows to split and a repeatable train and test split.
- A tree diagram in responsive SVG with foldable branches, scrollable on phones.
- Feature importance as the share of total impurity reduction.
- Root impurity and information gain, so you can check a textbook calculation.
- The tree as if-then rules, which you can copy.
- Iris, a Titanic subset and play-tennis built in, with their sources stated.
Worked examples
Iris, Gini, depth 10, 40% test gives train 100%, test 91.7%
At depth 2 the same split gives train 97.8% and test 93.3%.
Privacy: how it works
- Your CSV is parsed and the tree is grown in your browser tab. Nothing is sent to Ulkaa or anyone else.
Tips
- Remove ID columns, names and anything that would not be known when you need to predict.
- Compare Gini and entropy on your data. They usually pick the same splits and differ only in the details.
- Fold the branches of a big tree and read the top levels first. Those hold the strongest signals.
- The test split is random but repeatable, so the same settings always give the same numbers.
Frequently asked questions
Is it really free?
Yes. There is no price, no trial and no credit card. Ulkaa Tool does the work with your own device, so there is no server bill to pass on to you.
Do I need an account?
No. There is no sign-up and no login. Open the page and use it. An Ulkaa account is not needed for anything on this tool.
Does it run in my browser?
Yes. Your CSV data are processed by code running in your browser tab, on your own device.
Is my data uploaded?
No. Your CSV data are never sent to Ulkaa or to anyone else. You can check this yourself by watching the Network tab in your browser developer tools while you use the tool.
What is overfitting in a decision tree?
The tree fits the training rows so closely, noise included, that it does worse on new rows than a simpler tree would.
How do I prevent it?
Limit depth, require a minimum number of rows to split, prune the tree, or average many trees in a random forest.
More Decision Tree Builder pages
- Decision Tree BuilderPaste a CSV, choose the column to predict and watch a decision tree grow, split by split.
- Play Tennis Decision TreeThe textbook 14-day table, turned into a tree with entropy and information gain.
- Titanic Survival Decision TreePredict who survived from class, sex and age with a small, readable tree.
- Gini Impurity CalculatorSee the Gini impurity of a node and of its children after the best split.
- Information Gain CalculatorCompute the entropy of a node and the information gain of the best split.
- Decision Tree Feature ImportanceRank the columns of your data by how much a tree depends on them.
- Entropy vs Gini in a Decision TreeSwitch between the two split criteria and compare the trees they build.