A novel decision tree classification based on post-pruning with Bayes minimum risk

Citation metadata

Date: Apr. 4, 2018
From: PLoS ONE(Vol. 13, Issue 4)
Publisher: Public Library of Science
Document Type: Report
Length: 3,484 words
Lexile Measure: 1550L

Document controls

Main content

Abstract :

Pruning is applied in order to combat over-fitting problem where the tree is pruned back with the goal of identifying decision tree with the lowest error rate on previously unobserved instances, breaking ties in favour of smaller trees with high accuracy. In this paper, pruning with Bayes minimum risk is introduced for estimating the risk-rate. This method proceeds in a bottom-up fashion converting a parent node of a subtree to a leaf node if the estimated risk-rate of the parent node for that subtree is less than the risk-rates of its leaf. This paper proposes a post-pruning method that considers various evaluation standards such as attribute selection, accuracy, tree complexity, and time taken to prune the tree, precision/recall scores, TP/FN rates and area under ROC. The experimental results show that the proposed method produces better classification accuracy and its complexity is not much different than the complexities of reduced-error pruning and minimum-error pruning approaches. The experiments also demonstrate that the proposed method shows satisfactory performance in terms of precision score, recall score, TP rate, FP rate and area under ROC.

Source Citation

Source Citation   

Gale Document Number: GALE|A533366955