The stopping rules for winsorized tree

• Main Authors: Chee, Keong Ch’ng, Mahat, Nor Idayu
• Format: Conference or Workshop Item
• Published: IP Publishing LLC 2017
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://repo.uum.edu.my/24303/; http://doi.org/10.1063/1.5012233
• Institution: Universiti Utara Malaysia

Winsorized tree is a modified tree-based classifier that is able to investigate and to handle all outliers in all nodes along the process of constructing the tree.It overcomes the tedious process of constructing a classical tree where the splitting of branches and pruning go concurrently so that the constructed tree would not grow bushy. This mechanism is controlled by the proposed algorithm. In winsorized tree, data are screened for identifying outlier.If outlier is detected, the value is neutralized using winsorize approach. Both outlier identification and value neutralization are executed recursively in every node until predetermined stopping criterion is met.The aim of this paper is to search for significant stopping criterion to stop the tree from further splitting before overfitting.The result obtained from the conducted experiment on pima indian dataset proved that the node could produce the final successor nodes (leaves) when it has achieved the range of 70% in information gain.