# Random Forest

> Lots of decision trees, each a bit different. They all vote on the answer.

**Field:** Artificial Intelligence  
**Category:** Machine Learning  
**Also known as:** Random Decision Forest

## Think of it like

Think of it like asking a hundred friends. You go with what most of them say.

## Definition

A random forest is a model made of many decision trees that vote. Each tree is trained on a random sample of the data and looks at a random mix of features. So each tree makes different mistakes. When a new example comes in, every tree gives an answer and the most common one wins. The crowd is usually far more accurate than any single tree.

## Example

Emma's model spots fake product reviews. It uses 300 trees. For one review, 240 vote fake and 60 vote real, so the review is flagged.

## Why it matters

It works well on table data with little tuning. Many teams try it first and are surprised how hard it is to beat.

## Common mistake

Expecting to read it like one tree. With hundreds of trees, you lose the easy explanation a single tree gives.

## Three principles

- **Many trees.** Each one trained a bit differently.
- **They vote.** The most common answer wins.
- **Errors cancel.** The crowd beats any one tree.

## Related terms

- [Decision Tree](https://learn.benibix.com/term/ai/decision-tree)
- [Gradient Boosting](https://learn.benibix.com/term/ai/gradient-boosting)
- [Classification (Machine Learning)](https://learn.benibix.com/term/ai/classification)
- [Ensemble Learning](https://learn.benibix.com/term/ai/ensemble-learning)

## Told apart from

- [Random Forest vs Gradient Boosting](https://learn.benibix.com/compare/random-forest-vs-gradient-boosting): Both are made of many decision trees, so people treat them as the same idea. The trees work in different ways. In a random forest, the trees are built side by side and vote. In gradient boosting, they are built in a row, and each one fixes what the last got wrong.

## Taught in

- [Decision Trees and Forests](https://learn.benibix.com/learn/ai-machine-learning/decision-trees-and-forests): Machine Learning, 10/18

![Top row, random forest: three trees side by side each give a vote, and the most common vote wins. Bottom row, gradient boosting: three trees in a chain, each one fixing the errors left by the one before.](https://learn.benibix.com/diagrams/ml-forest-boosting.svg)

---

Source: https://learn.benibix.com/term/ai/random-forest
Author: Behnia Zarei (a developer in Vienna, Austria, who builds and teaches data, AI and business intelligence at BENIBIX)
Publisher: BENIBIX Learn (https://learn.benibix.com/)
Last updated: 2026-11-17
Licence: CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). Quote freely with attribution.
