A decision tree is a type of supervised learning algorithm that can be used on categorical/continuous inputs and target variables.
A decision tree with a continuous target variable.
A decision tree with a categorical target variable.
Involves deciding what features to choose, which criteria to use for splitting, and when to stop the tree from growing further.
No domain knowledge is required to construct a decision tree.
Decision trees are easy to interpret.
Decision trees can handle continuous and categorical variables.
A decision tree is prone to overfitting. Overfitting occurs when a model’s performance on new data is hampered due to the extent of the detail and noise in the training data.
Constructing a decision tree can be computationally expensive.