arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.08848cs.CC
收藏

基于假设的决策树的贪心算法

Greedy Algorithms for Decision Trees with Hypotheses

Mohammad Azad, Igor Chikalov, Shahid Hussain, Mikhail Moshkov, Beata Zielosko

摘要:

我们调查在决策树,将传统的查询基于一个属性和查询的假设的所有属性的值的基础上。这种决策树类似于精确学习中研究的决策树,其中允许成员和等价查询。我们提出了贪心算法的基础上,不同的不确定性措施建设上述决策树和讨论的各种数据集的UCI ML库和随机生成的布尔函数的计算机实验结果。我们还研究了由贪心算法构造的决策树所产生的决策规则的尺子和覆盖率。

英文摘要:

We investigate at decision trees that incorporate both traditional queries based on one attribute and queries based on hypotheses about the values of all attributes. Such decision trees are similar to ones studied in exact learning, where membership and equivalence queries are allowed. We present greedy algorithms based on diverse uncertainty measures for construction of above decision trees and discuss results of computer experiments on various data sets from the UCI ML Repository and randomly generated Boolean functions. We also study the length and coverage of decision rules derived from the decisiontrees constructed by greedy algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑