A new decision tree pre-pruning method based on nodes probabilities

Youness Manzali, Pr. Mohamed El Far
{"title":"A new decision tree pre-pruning method based on nodes probabilities","authors":"Youness Manzali, Pr. Mohamed El Far","doi":"10.1109/ISCV54655.2022.9806124","DOIUrl":null,"url":null,"abstract":"One of the most well-known and effective data mining approaches is the decision tree. Many researchers have established and thoroughly investigated this technique. On the other hand, some decision tree algorithms may yield a complex structure that is difficult to comprehend. In addition, data misclassification is common during the learning process. Pruning can be utilized as a fundamental procedure to solve this problem. To improve generalization, it eliminates the use of noisy, contradictory data. In this paper, we propose a new pre-pruning method that prunes weak nodes with a high probability. The experimental results are verified using 24 benchmark datasets from the UCI machine learning repository. The results indicate that our new tree pruning method is a feasible way of pruning decision trees.","PeriodicalId":426665,"journal":{"name":"2022 International Conference on Intelligent Systems and Computer Vision (ISCV)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Intelligent Systems and Computer Vision (ISCV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCV54655.2022.9806124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

One of the most well-known and effective data mining approaches is the decision tree. Many researchers have established and thoroughly investigated this technique. On the other hand, some decision tree algorithms may yield a complex structure that is difficult to comprehend. In addition, data misclassification is common during the learning process. Pruning can be utilized as a fundamental procedure to solve this problem. To improve generalization, it eliminates the use of noisy, contradictory data. In this paper, we propose a new pre-pruning method that prunes weak nodes with a high probability. The experimental results are verified using 24 benchmark datasets from the UCI machine learning repository. The results indicate that our new tree pruning method is a feasible way of pruning decision trees.
一种基于节点概率的决策树预剪枝方法
决策树是最著名、最有效的数据挖掘方法之一。许多研究人员已经建立并彻底研究了这种技术。另一方面,一些决策树算法可能产生难以理解的复杂结构。此外,在学习过程中,数据错误分类是常见的。修剪可以作为解决这个问题的基本步骤。为了提高泛化,它消除了使用有噪声的、矛盾的数据。本文提出了一种新的预剪枝方法,对弱节点进行高概率剪枝。实验结果使用来自UCI机器学习存储库的24个基准数据集进行验证。结果表明,该方法是一种可行的决策树剪枝方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信