Classical Machine Learning
Random Forest
An ensemble model that combines many decision trees and lets them vote, far more accurate and stable than one tree.
A random forest trains many decision trees, each on a random slice of the data and features, then averages or votes across them to make a prediction. The diversity cancels out the mistakes of any single tree, giving strong, reliable performance with little tuning. It remains one of the most popular classical algorithms for tabular data.
Reference: Wikipedia: Random Forest
Related terms
Decision Tree
A model that makes predictions by following a branching series of yes or no questions, like a flowchart.
Gradient Boosting
An ensemble technique that builds models in sequence, each correcting the errors of the last, behind top performers like XGBoost.
Classification
A machine learning task that sorts inputs into predefined categories, like labeling an email spam or not spam.
Overfitting
When a model memorizes its training data too closely and then performs badly on anything new.