Research on a Streamlined Causal Tree Algorithm Based on Factor Space Theory

Kaile Lin, Fanhui Zeng, Xiaotong Liu, Ying Wang, Kaijie Zhang
{"title":"Research on a Streamlined Causal Tree Algorithm Based on Factor Space Theory","authors":"Kaile Lin, Fanhui Zeng, Xiaotong Liu, Ying Wang, Kaijie Zhang","doi":"10.3390/cmsf2023008072","DOIUrl":null,"url":null,"abstract":": Decision rule extraction is an important tool for artificial intelligence and data mining, but decision rule redundancy reduces the generalization ability of causal trees. In order to better reduce the size of causal trees and improve the classification accuracy, based on factor space theory and aiming at the elimination of noise and special samples in the dataset using the extension decision degree criteria, the conditional factor corresponding to the optimal extension decision degree is used as the branch node of the tree, and the abnormal state object is removed from the conditional factor, recurring to obtain the streamlined causal tree algorithm. Comparison with other classification algorithms shows that the streamlined causal tree algorithm produces the smallest causal tree size, the least redundant rules, and the best classification accuracy.","PeriodicalId":108574,"journal":{"name":"IS4SI Summit 2023","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IS4SI Summit 2023","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/cmsf2023008072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

: Decision rule extraction is an important tool for artificial intelligence and data mining, but decision rule redundancy reduces the generalization ability of causal trees. In order to better reduce the size of causal trees and improve the classification accuracy, based on factor space theory and aiming at the elimination of noise and special samples in the dataset using the extension decision degree criteria, the conditional factor corresponding to the optimal extension decision degree is used as the branch node of the tree, and the abnormal state object is removed from the conditional factor, recurring to obtain the streamlined causal tree algorithm. Comparison with other classification algorithms shows that the streamlined causal tree algorithm produces the smallest causal tree size, the least redundant rules, and the best classification accuracy.
基于因子空间理论的流线型因果树算法研究
决策规则提取是人工智能和数据挖掘的重要工具,但决策规则冗余降低了因果树的泛化能力。为了更好地减小因果树的大小,提高分类精度,基于因子空间理论,以可拓决策度标准消除数据集中的噪声和特殊样本为目标,将最优可拓决策度对应的条件因子作为树的分支节点,将异常状态对象从条件因子中剔除,循环得到流线型因果树算法。与其他分类算法的比较表明,精简因果树算法产生的因果树大小最小,冗余规则最少,分类精度最好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书