Classical Machine Learning
Decision Tree
A model that makes predictions by following a branching series of yes or no questions, like a flowchart.
A decision tree splits data step by step on the features that best separate the outcomes, forming a tree of simple questions that ends in a prediction at each leaf. Its big appeal is transparency: you can read the exact path that led to any decision, which makes it easy to explain. Single trees tend to overfit, which is why they are often combined into forests or boosted ensembles.
Reference: Wikipedia: Decision Tree
Related terms
Random Forest
An ensemble model that combines many decision trees and lets them vote, far more accurate and stable than one tree.
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.
Interpretability
Research into understanding why a model produces the outputs it does, rather than treating it as a black box.