.png){kind=icon}
返回
K-Submodlar Function Based Incentive Mechanisms for Crowd Multi-Labeling
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3072212.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Crowd labeling, as a new paradigm of labeling classification problems, has enabled it to create a tremendous amount of high-quality labeling datasets by harnessing extensive ordinary human comprehension at a low cost. However, existing works mainly focus on a single label scene(one instance is only associated with a single label or a category). They do not fit some real applications well where one instance can associate with multiple labels and different categories can have different budget limits. In this paper, we find that the issue can be addressed by introducing K-submodlar function, which has received extensive attention recently. Moreover, we further propose a K-submodlar function based incentive mechanism for crowd multi-labeling scene, satisfying the truthfulness, individual rationality, computational efficiency. Extensive simulations validate the theoretical properties of our mechanism.
Keyword:
Crowd multi-labeling
K-submodlar function
budget limit
truthfulness
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
The Use of Ensemble Models for Multiple Class and Binary Class Classification for Improving Intrusion Detection Systems.png)
SENSORSOAAI
SENSORSIF3.5
OAAI分享收藏Constrained Monotone k-Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee使用具有理论保证的多目标进化算法的约束单调k-子模函数最大化
PREAI
分享收藏A Secure Multiuser Privacy Technique for Wireless IoT Networks Using Stochastic Privacy Optimization
PREAI
分享收藏
查看更多内容