Random Forest
Random Forest (Breiman Ensemble of Decision Trees) · Also known as: Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
+127 more
When to use it
A good fit for accurate, robust classification, regression, or prediction on tabular data with many — possibly nonlinear and interacting — features and at least about 50 observations, when predictive performance matters more than reporting explicit coefficients. Random Forest is assumption-light: it does not require normally distributed data and handles continuous, categorical, binary, ordinal, and count features. Hyperparameter tuning is recommended. When sample sizes fall below about 50, simpler models such as logistic or linear regression are safer.
Strengths & limitations
- Strong off-the-shelf accuracy on tabular data for both classification and regression.
- Resistant to overfitting thanks to bagging plus random feature selection at each split.
- Built-in feature importance integrates variable ranking directly into the model.
- Out-of-bag error gives an honest validation estimate without a separate cross-validation pass.
- Assumption-light: no normality requirement, and it handles mixed feature types and nonlinear interactions.
- No coefficients to interpret; its black-box nature can clash with reviewers who expect explicit effects.
- Hyperparameter tuning is recommended, and large forests cost memory and compute.
- On small samples (n below about 50) many trees overfit and cross-validation results become misleading.
- Feature-importance estimates can be unstable and non-reproducible at small sample sizes.
Frequently asked
How many trees should the forest have?
More trees reduce variance and stabilise the vote at the cost of compute and memory. A common starting point is around 100 trees, increasing until the out-of-bag error stops improving.
Does Random Forest overfit?
It is highly resistant to overfitting because bagging and random feature selection de-correlate the trees and average out their individual errors. The main risk is fitting many deep trees on a very small dataset, where the model overfits and cross-validation becomes misleading.
Can I trust the feature importance?
Feature importance is useful for ranking predictors, but at small sample sizes it can be unstable and non-reproducible, so treat small-sample rankings with caution. Pairing it with SHAP analysis gives a clearer view of each feature's contribution.
What should I check before and after fitting?
Beforehand, handle missing values, encode categorical variables, and set up a train/test split or k-fold cross-validation. Afterwards, evaluate the out-of-bag error, run cross-validation, and inspect feature contributions (for example with SHAP).
Sources
- Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI: 10.1023/A:1010933404324 ↗
- James, G., Witten, D., Hastie, T. & Tibshirani, R. (2013). An Introduction to Statistical Learning (Ch. 8). Springer. ISBN: 978-1-4614-7138-7
How to cite this page
ScholarGate. (2026, June 1). Random Forest (Breiman Ensemble of Decision Trees). ScholarGate. https://scholargate.app/en/machine-learning/random-forest
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Decision TreeMachine learning↔ compare
- Logistic RegressionResearch Statistics↔ compare
- Support Vector MachineMachine learning↔ compare
- XGBoostMachine learning↔ compare