CART (Classification and Regression Trees)


If ID3 likes asking many questions at once, CART prefers asking one question at a time.
CART always splits the data into two branches, no matter how many options are available.
This makes CART simple, powerful, and very popular in real-world applications.
Let us now understand how CART decides the best split using the Gini Index.

After understanding how decision trees work, the next question is:
Can the same tree be used for both classification and prediction?
This is where CART comes in.
CART is a powerful decision tree algorithm that is used not only to classify data, but also to
predict numerical values.