Classification of Trees

Classification of Trees

Tree models where the target variables can take finite set of values are called classification trees.

In these trees structures represent class labels and branches represents conjunctions of features that lead to these class labels.

Classification tree analysis is when the predicted outcome is the class to which the data belongs.

The term classification and regression tree analysis is an umbrella term used for regression and trees used for classification have same similarities.

It can be used for classification or regression predictive modeling problems classically the algorithm is reffered to as ‘decesion trees’ but on some platform like R they are reffered to by more modern term CART.

The CART algorithm provides a foundation for important  algorithms like bagged decision trees, random forest and boosted decision trees.