The stopping rules for winsorized tree

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...

Full description

Bibliographic Details
Main Authors: Chee, Keong Ch’ng, Mahat, Nor Idayu
Format: Conference or Workshop Item
Published: IP Publishing LLC 2017
Subjects:
_version_ 1825805081396641792
author Chee, Keong Ch’ng
Mahat, Nor Idayu
author_facet Chee, Keong Ch’ng
Mahat, Nor Idayu
author_sort Chee, Keong Ch’ng
collection UUM
description 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.
first_indexed 2024-07-04T06:26:03Z
format Conference or Workshop Item
id uum-24303
institution Universiti Utara Malaysia
last_indexed 2024-07-04T06:26:03Z
publishDate 2017
publisher IP Publishing LLC
record_format eprints
spelling uum-243032018-06-25T01:51:50Z https://repo.uum.edu.my/id/eprint/24303/ The stopping rules for winsorized tree Chee, Keong Ch’ng Mahat, Nor Idayu QA75 Electronic computers. Computer science 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. IP Publishing LLC 2017 Conference or Workshop Item PeerReviewed Chee, Keong Ch’ng and Mahat, Nor Idayu (2017) The stopping rules for winsorized tree. In: UNSPECIFIED. http://doi.org/10.1063/1.5012233 doi:10.1063/1.5012233 doi:10.1063/1.5012233
spellingShingle QA75 Electronic computers. Computer science
Chee, Keong Ch’ng
Mahat, Nor Idayu
The stopping rules for winsorized tree
title The stopping rules for winsorized tree
title_full The stopping rules for winsorized tree
title_fullStr The stopping rules for winsorized tree
title_full_unstemmed The stopping rules for winsorized tree
title_short The stopping rules for winsorized tree
title_sort stopping rules for winsorized tree
topic QA75 Electronic computers. Computer science
work_keys_str_mv AT cheekeongchng thestoppingrulesforwinsorizedtree
AT mahatnoridayu thestoppingrulesforwinsorizedtree
AT cheekeongchng stoppingrulesforwinsorizedtree
AT mahatnoridayu stoppingrulesforwinsorizedtree