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

基于不完美数据的具有多个未知类别的高风险分类

High stakes classification with multiple unknown classes based on imperfect data

Haakon Bakka

AI总结:

针对不完美数据下的高风险多未知类别分类问题,本文提出基于朴素贝叶斯和密度估计的可解释单类分类器 NBP,并说明其良好预测性能与实践价值。

摘要:

高风险分类是指这样一类分类问题:错误地预测出错误类别会造成非常严重的后果,而将样本判定为“未知”则是可以接受的。我们认为,这类问题要求我们给出多个未知类别,以便从分析中获取最多的信息。我们所说的不完美数据,是指协变量存在大量缺失值、较大的噪声方差以及数据中的某些错误。高风险分类与不完美数据的结合在实践中十分常见,但使用现有方法处理却非常困难。我们提出了一种单类分类器(OCC)来解决这一问题,并将其命名为 NBP。该分类器基于朴素贝叶斯(Naive Bayes),实现简单且具有可解释性。我们证明 NBP 既能提供良好的预测性能,又适用于基于不完美数据的高风险分类。我们提出的模型相当简单,它只是一个基于密度估计的 OCC。然而,我们一直感到,在我们所处理的应用型分类问题与用于分类的理论和模型之间存在巨大鸿沟,而该模型弥合了这一鸿沟。我们的主要贡献在于阐明了为什么该模型是一种良好方法的动机,并希望本文能够激励沿着这一方向的进一步发展。

英文摘要:

High stakes classification refers to classification problems where erroneously predicting the wrong class is very bad, but assigning "unknown" is acceptable. We make the argument that these problems require us to give multiple unknown classes, to get the most information out of our analysis. With imperfect data we refer to covariates with a large number of missing values, large noise variance, and some errors in the data. The combination of high stakes classification and imperfect data is very common in practice, but it is very difficult to work on using current methods. We present a one-class classifier (OCC) to solve this problem, and we call it NBP. The classifier is based on Naive Bayes, simple to implement, and interpretable. We show that NBP gives both good predictive performance, and works for high stakes classification based on imperfect data. The model we present is quite simple; it is just an OCC based on density estimation. However, we have always felt a big gap between the applied classification problems we have worked on and the theory and models we use for classification, and this model closes that gap. Our main contribution is the motivation for why this model is a good approach, and we hope that this paper will inspire further development down this path.

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

↑