题名 | Theoretical guarantee for crowdsourcing learning with unsure option |
作者 | |
通讯作者 | Tang,Ke |
发表日期 | 2023-05-01
|
DOI | |
发表期刊 | |
ISSN | 0031-3203
|
EISSN | 1873-5142
|
卷号 | 137 |
摘要 | Crowdsourcing learning, in which labels are collected from multiple workers through crowdsourcing platforms, has attracted much attention during the past decade. This learning paradigm would reduce the labeling cost since crowdsourcing workers may be non-expert and hence less costly. On the other hand, crowdsourcing learning algorithms also suffer from being misled by incorrect labels introduced by imperfect workers. To control such risks, recently, it has been suggested to provide workers an additional unsure option during the labeling process. Although the benefits of the unsure option have been empirically demonstrated, theoretical analysis is still limited. In this article, a theoretical analysis of crowdsourcing learning with the unsure option is presented. Specifically, an upper bound of minimally sufficient number of crowd labels required for learning a probably approximately correct (PAC) classification model with and without the unsure option are given respectively. Next, a condition under which providing (or not providing) an unsure option to workers is derived. Then, the theoretical results are extended to guide non-identical label options (with or without unsure options) to different workers. Last, several useful applications are proposed based on theoretical results. |
关键词 | |
相关链接 | [Scopus记录] |
收录类别 | |
语种 | 英语
|
学校署名 | 通讯
|
WOS研究方向 | Computer Science
; Engineering
|
WOS类目 | Computer Science, Artificial Intelligence
; Engineering, Electrical & Electronic
|
WOS记录号 | WOS:000963387200001
|
出版者 | |
EI入藏号 | 20230513456470
|
EI主题词 | Learning algorithms
; Learning systems
; Machine learning
|
EI分类号 | Artificial Intelligence:723.4
; Machine Learning:723.4.2
|
ESI学科分类 | ENGINEERING
|
Scopus记录号 | 2-s2.0-85146716208
|
来源库 | Scopus
|
引用统计 |
被引频次[WOS]:2
|
成果类型 | 期刊论文 |
条目标识符 | http://sustech.caswiz.com/handle/2SGJ60CL/442565 |
专题 | 工学院_计算机科学与工程系 |
作者单位 | 1.State Key Laboratory of Processors (SKLP),School of Computer Science and Technology,University of Science and Technology of China (USTC),Hefei,Anhui,230026,China 2.Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation,Department of Computer Science and Engineering,Southern University of Science and Technology (SUSTech),Shenzhen,Guangdong,518055,China |
通讯作者单位 | 计算机科学与工程系 |
推荐引用方式 GB/T 7714 |
Pan,Yigong,Tang,Ke,Sun,Guangzhong. Theoretical guarantee for crowdsourcing learning with unsure option[J]. PATTERN RECOGNITION,2023,137.
|
APA |
Pan,Yigong,Tang,Ke,&Sun,Guangzhong.(2023).Theoretical guarantee for crowdsourcing learning with unsure option.PATTERN RECOGNITION,137.
|
MLA |
Pan,Yigong,et al."Theoretical guarantee for crowdsourcing learning with unsure option".PATTERN RECOGNITION 137(2023).
|
条目包含的文件 | 条目无相关文件。 |
|
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论