A Classifier Based on a Decision Tree with Verifying Cuts

Jan G. Bazan, S. Bazan-Socha, Sylwia Buregwa-Czuma, Lukasz Dydo, W. Rzasa, A. Skowron
{"title":"A Classifier Based on a Decision Tree with Verifying Cuts","authors":"Jan G. Bazan, S. Bazan-Socha, Sylwia Buregwa-Czuma, Lukasz Dydo, W. Rzasa, A. Skowron","doi":"10.3233/FI-2016-1300","DOIUrl":null,"url":null,"abstract":"This article introduces a new method of a decision tree construction. Such construction is performed using additional cuts applied for a verificatio n of the cuts' quality in tree nodes during the classification of objects. The presented approach allow s us to exploit the additional knowledge represented in the attributes which could be eliminated using greedy methods. The paper includes the results of experiments performed on data sets from a biomedical database and machine learning repositories. In order to evaluate the presented method, we compared its performance with the classification results of a local discretization decision t ree, well known from literature. Our new method outperforms the existing method, which is also confir med by statistical tests.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Concurrency, Specification and Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/FI-2016-1300","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

This article introduces a new method of a decision tree construction. Such construction is performed using additional cuts applied for a verificatio n of the cuts' quality in tree nodes during the classification of objects. The presented approach allow s us to exploit the additional knowledge represented in the attributes which could be eliminated using greedy methods. The paper includes the results of experiments performed on data sets from a biomedical database and machine learning repositories. In order to evaluate the presented method, we compared its performance with the classification results of a local discretization decision t ree, well known from literature. Our new method outperforms the existing method, which is also confir med by statistical tests.
基于验证切的决策树分类器
本文介绍了一种构造决策树的新方法。这种构造是使用额外的切割来执行的,用于在对象分类期间验证树节点中的切割质量。所提出的方法允许我们利用属性中表示的额外知识,这些知识可以使用贪婪方法消除。本文包括对来自生物医学数据库和机器学习存储库的数据集进行的实验结果。为了评估所提出的方法,我们将其性能与文献中已知的局部离散化决策树的分类结果进行了比较。我们的新方法优于现有的方法,这也得到了统计检验的证实。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信