Decision tree pruning
Pruning is a data compression technique in machine learning and search algorithms that reduces the size of decision trees by removing sections of the tree that are non-critical and redundant to classify instances. Pruning reduces the complexity of the final classifier, and hence improves predictive accuracy by the reduction of overfitting.
One of the questions that arises in a decision tree algorithm is the optimal size of the final tree. A tree that is too large risks overfitting the training data and poorly generalizing to new samples. A small tree might not capture important structural information about the sample space. However, it is hard to tell when a tree algorithm should stop because it is impossible to tell if the addition of a single extra node will dramatically decrease error. This problem is known as the horizon effect. A common strategy is to grow the tree until each node contains a small number of instances then use pruning to remove nodes that do not provide additional information.[1]
Pruning should reduce the size of a learning tree without reducing predictive accuracy as measured by a cross-validation set. There are many techniques for tree pruning that differ in the measurement that is used to optimize performance.
Techniques
Pruning processes can be divided into two types (pre- and post-pruning).
Pre-pruning procedures prevent a complete induction of the training set by replacing a stop () criterion in the induction algorithm (e.g. max. Tree depth or information gain (Attr)> minGain). Pre-pruning methods are considered to be more efficient because they do not induce an entire set, but rather trees remain small from the start. Prepruning methods share a common problem, the horizon effect. This is to be understood as the undesired premature termination of the induction by the stop () criterion.
Post-pruning (or just pruning) is the most common way of simplifying trees. Here, nodes and subtrees are replaced with leaves to reduce complexity. Pruning can not only significantly reduce the size but also improve the classification accuracy of unseen objects. It may be the case that the accuracy of the assignment on the train set deteriorates, but the accuracy of the classification properties of the tree increases overall.
The procedures are differentiated on the basis of their approach in the tree (top-down or bottom-up).
Bottom-up pruning
These procedures start at the last node in the tree (the lowest point). Following recursively upwards, they determine the relevance of each individual node. If the relevance for the classification is not given, the node is dropped or replaced by a leaf. The advantage is that no relevant sub-trees can be lost with this method. These methods include Reduced Error Pruning (REP), Minimum Cost Complexity Pruning (MCCP), or Minimum Error Pruning (MEP).
Top-down pruning
In contrast to the bottom-up method, this method starts at the root of the tree. Following the structure below, a relevance check is carried out which decides whether a node is relevant for the classification of all n items or not. By pruning the tree at an inner node, it can happen that an entire sub-tree (regardless of its relevance) is dropped. One of these representatives is pessimistic error pruning (PEP), which brings quite good results with unseen items.
Pruning algorithms
Reduced error pruning
One of the simplest forms of pruning is reduced error pruning. Starting at the leaves, each node is replaced with its most popular class. If the prediction accuracy is not affected then the change is kept. While somewhat naive, reduced error pruning has the advantage of simplicity and speed.
Cost complexity pruning
Cost complexity pruning generates a series of trees [math]\displaystyle{ T_0\dots T_m }[/math] where [math]\displaystyle{ T_0 }[/math] is the initial tree and [math]\displaystyle{ T_m }[/math] is the root alone. At step [math]\displaystyle{ i }[/math], the tree is created by removing a subtree from tree [math]\displaystyle{ i-1 }[/math] and replacing it with a leaf node with value chosen as in the tree building algorithm. The subtree that is removed is chosen as follows:
- Define the error rate of tree [math]\displaystyle{ T }[/math] over data set [math]\displaystyle{ S }[/math] as [math]\displaystyle{ \operatorname{err}(T,S) }[/math].
- The subtree [math]\displaystyle{ t }[/math] that minimizes [math]\displaystyle{ \frac{\operatorname{err}(\operatorname{prune}(T,t),S)-\operatorname{err}(T,S)}{\left\vert\operatorname{leaves}(T)\right\vert-\left\vert\operatorname{leaves}(\operatorname{prune}(T,t))\right\vert} }[/math] is chosen for removal.
The function [math]\displaystyle{ \operatorname{prune}(T,t) }[/math] defines the tree obtained by pruning the subtrees [math]\displaystyle{ t }[/math] from the tree [math]\displaystyle{ T }[/math]. Once the series of trees has been created, the best tree is chosen by generalized accuracy as measured by a training set or cross-validation.
Examples
Pruning could be applied in a compression scheme of a learning algorithm to remove the redundant details without compromising the model's performances. In neural networks, pruning removes entire neurons or layers of neurons.
See also
References
- Pearl, Judea (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley. ISBN 978-0-201-05594-8.
- Mansour, Y. (1997). "Pessimistic decision tree pruning based on tree size". Proc. 14th International Conference on Machine Learning. pp. 195–201. https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=b6fce37612db10a9756b904b5e79e1144ca12574.
- Breslow, L. A.; Aha, D. W. (1997). "Simplifying Decision Trees: A Survey". The Knowledge Engineering Review 12 (1): 1–47. doi:10.1017/S0269888997000015.
- Quinlan, J. R. (1986). "Induction of Decision Trees". Machine Learning (Kluwer) 1: 81–106. doi:10.1007/BF00116251.
- ↑ Hastie, Trevor; Tibshirani, Robert; Friedman, Jerome (2001). The Elements of Statistical Learning. Springer. pp. 269-272. ISBN 0-387-95284-5.
Further reading
External links
 |  |
