arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2208.07403cs.LGcs.AI
收藏

不确定性下的组合预测:随机决策树的情况

Combining Predictions under Uncertainty: The Case of Random Decision Trees

Technische Universität Darmstadt(达姆施塔特工业大学);KU Leuven(鲁汶大学)

Florian Busch, Moritz Kulessa, Eneldo Loza Mencía, Hendrik Blockeel

摘要:

在决策树的集合中聚合分类估计的常见方法是使用投票或平均每个类别的概率。后者考虑到不确定性,但不考虑不确定性估计的可靠性(也就是说,“不确定性的不确定性”)。更一般地说,关于如何最好地结合来自多个来源的概率估计,还有很多未知数。在本文中,我们研究了一些替代的预测方法。我们的方法受到概率论、置信函数和可靠分类理论以及我们称之为证据积累的原则的启发。我们在各种数据集上的实验是基于随机决策树的,这保证了要组合的预测的高度多样性。有点出乎意料的是,我们发现,对概率取平均值实际上很难被击败。然而,证据积累表明,除了非常小的叶子外,所有的叶子都有更好的结果。

英文摘要:

A common approach to aggregate classification estimates in an ensemble of decision trees is to either use voting or to average the probabilities for each class. The latter takes uncertainty into account, but not the reliability of the uncertainty estimates (so to say, the "uncertainty about the uncertainty"). More generally, much remains unknown about how to best combine probabilistic estimates from multiple sources. In this paper, we investigate a number of alternative prediction methods. Our methods are inspired by the theories of probability, belief functions and reliable classification, as well as a principle that we call evidence accumulation. Our experiments on a variety of data sets are based on random decision trees which guarantees a high diversity in the predictions to be combined. Somewhat unexpectedly, we found that taking the average over the probabilities is actually hard to beat. However, evidence accumulation showed consistently better results on all but very small leafs.

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

↑