What are the limitations of the decision tree approach?

Answer 1

• The problem of learning an optimal decision tree is known to be NP-complete under several aspects of optimality and even for simple concepts.[7][8] Consequently, practical decision-tree learning algorithms are based on heuristic algorithms such as the greedy algorithm where locally optimal decisions are made at each node. Such algorithms cannot guarantee to return the globally optimal decision tree.
• Decision-tree learners can create over-complex trees that do not generalise the data well. This is called overfitting.Mechanisms such as pruning are necessary to avoid this problem.
• There are concepts that are hard to learn because decision trees do not express them easily, such as XOR, parity or multiplexer problems. In such cases, the decision tree becomes prohibitively large. Approaches to solve the problem involve either changing the representation of the problem domain (known as propositionalisation)or using learning algorithms based on more expressive representations (such as statistical relational learning or inductive logic programming).

• For data including categorical variables with different number of levels, information gain in decision trees are biased in favor of those attributes with more levels.