Computational Methods for Data Analysis

6Decision Tree

This chapter covers the following items:

–Algorithm for decision tree

–Algorithm for classifying with decision tree algorithms

–Examples and applications

At this point, let us now dwell on what a decision tree is. A decision tree is a tree structure that is similar to a flowchart tree structure. In a typical decision tree structure, each internal node (also known as nonleaf node) shows a test on an attribute [1–3]. On the other hand, each branch shows an outcome of the test. In decision trees, each leaf node (also known as terminal node) contains a class label. The root node is the top node in a tree. Figure 6.1 provides a typical illustration of a decision tree. It shows the concept of time to export (days). In other words, ...