Classification Decision Trees

Overview

The challenge of training a decision tree is that the problem of finding the optimal tree has been shown to NP-hard. This means that any training algorithm will be by nature heuristic. Nevertheless, there are algorithms that work fairly well.

Types

• Binary - each node has either 0 or 2 children.