arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.08129cs.LGstat.ML
收藏

多类分类中的有效集值预测

Efficient Set-Valued Prediction in Multi-Class Classification

Thomas Mortier, Marek Wydmuch, Krzysztof Dembczyński, Eyke Hüllermeier, Willem Waegeman

摘要:

在不确定性的情况下,多类分类器优选地返回一组候选类,而不是预测几乎没有保证的单个类标签。更确切地说,分类器应该在正确性(真正的类在候选者中)和精度(候选者不太多)之间寻求最佳平衡。我们正式这个问题的一般决策理论框架内,统一在这一领域的现有工作。在这个框架中,不确定性是量化的条件类概率,和预测集的质量是衡量的效用函数。然后,我们解决了寻找贝叶斯最优预测的问题,即,具有最高期望效用的类别标签的子集。对于这个问题,这是计算上的挑战,因为有指数(类的数量)许多预测可供选择,我们提出了有效的算法,可以应用于一个广泛的家庭的效用函数。我们的理论结果是补充实验研究,在其中,我们分析了所提出的算法的预测精度和运行时效率。

英文摘要:

In cases of uncertainty, a multi-class classifier preferably returns a set of candidate classes instead of predicting a single class label with little guarantee. More precisely, the classifier should strive for an optimal balance between the correctness (the true class is among the candidates) and the precision (the candidates are not too many) of its prediction. We formalize this problem within a general decision-theoretic framework that unifies most of the existing work in this area. In this framework, uncertainty is quantified in terms of conditional class probabilities, and the quality of a predicted set is measured in terms of a utility function. We then address the problem of finding the Bayes-optimal prediction, i.e., the subset of class labels with highest expected utility. For this problem, which is computationally challenging as there are exponentially (in the number of classes) many predictions to choose from, we propose efficient algorithms that can be applied to a broad family of utility functions. Our theoretical results are complemented by experimental studies, in which we analyze the proposed algorithms in terms of predictive accuracy and runtime efficiency.

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

↑