.png){kind=icon}
返回
Partial classification in the belief function framework
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2021.106742.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Partial, or set-valued classification assigns instances to sets of classes, making it possible to reduce the probability of misclassification while still providing useful information. This paper reviews approaches to partial classification based on the Dempster-Shafer theory of belief functions. To define the utility of set-valued predictions, we propose to extend the utility matrix using an Ordered Weighted Average operator, allowing us to model the decision maker's attitude towards imprecision using a single parameter. Various decision criteria are analyzed comprehensively. In particular, two main strategies are distinguished: partial classification based on complete preorders among partial assignments, and partial preorders among complete assignments. Experiments with UCI and simulated Gaussian data sets show the superiority of partial classification in terms of average utility, as compared to single-class assignment and classification with rejection. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Dempster-Shafer theory
Evidence theory
Supervised classification
Decision-making
Set-valued classification
OWA operator
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
Logistic regression, neural networks and Dempster-Shafer theory: A new perspectiveLogistic回归、神经网络与dempster-shafer理论: 一个新的视角OAAI
OAAI分享收藏Coaches’ implicit associations between size and giftedness: implications for the relative age effect
PREAI
分享收藏
查看更多内容