【24h】

The stopping rules for winsorized tree

机译:Windeorized 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 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.
机译:WindeRized Tree是一种基于树的基于树的分类器,可以调查并沿着构造树的过程来处理所有节点中的所有异常值。它克服了构建古典树的繁琐过程,其中分支和修剪恰当地拆分,使得构造的树不会变得浓密。该机制由所提出的算法控制。在Windorized树中,筛选数据以识别异常值。如果检测到异常值,则使用WinSorize方法中和该值。在每个节点中递归地执行两个异常识别和值中和,直到满足预定的停止标准。本文的目的是搜索显着的停止标准,以在过度拟合之前停止树从进一步分裂。从PIMA印度数据集的进行实验中获得的结果证明,该节点可以在信息增益中实现70%的范围时产生最终的继承座(叶子)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号