arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.04828cs.LGcs.AI
收藏

决策树学习的全局评价

Global Evaluation for Decision Tree Learning

Boston University(波士顿大学);University of Konstanz(康斯坦茨大学)

Fabian Spaeh, Sven Kosub

摘要:

我们将聚类上的距离转移到决策树的构建过程中,并因此扩展了经典的ID 3算法,以根据树到地面真实值的全局距离进行修改-而不是考虑单个叶子。接下来,我们将评估这个想法与原始版本的比较,并讨论出现的问题,以及全局方法的优势。在此基础上,我们通过确定其他情况下,全球评估是值得的。

英文摘要:

We transfer distances on clusterings to the building process of decision trees, and as a consequence extend the classical ID3 algorithm to perform modifications based on the global distance of the tree to the ground truth--instead of considering single leaves. Next, we evaluate this idea in comparison with the original version and discuss occurring problems, but also strengths of the global approach. On this basis, we finish by identifying other scenarios where global evaluations are worthwhile.

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

↑