Robust annotation aggregation in crowdsourcing via enhanced worker ability modeling

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ju Chen , Jun Feng , Shenyu Zhang , Xiaodong Li , Hamza Djigal
{"title":"Robust annotation aggregation in crowdsourcing via enhanced worker ability modeling","authors":"Ju Chen ,&nbsp;Jun Feng ,&nbsp;Shenyu Zhang ,&nbsp;Xiaodong Li ,&nbsp;Hamza Djigal","doi":"10.1016/j.ipm.2024.103914","DOIUrl":null,"url":null,"abstract":"<div><div>Truth inference in crowdsourcing, which studies how to aggregate noisy and biased annotations from workers with varied expertise, is a fundamental technology powering the quality of crowdsourced annotations. Generally, confusion-matrix-based methods are more promising and worker better, as they model each worker’s ability using a confusion matrix rather than a single real value. However, the imbalanced classes and the insufficient training data caused by the <span><math><mrow><mi>K</mi><mo>×</mo><mi>K</mi></mrow></math></span> pattern (<span><math><mi>K</mi></math></span> refers to the number of classes) are still two major issues for the learning of confusion matrices, which call for a robust modeling structure of workers’ confusion matrices. In this article, we propose in response a Fine-Grained Bayesian Classifier Combination model (FGBCC), in which a combination of <span><math><mi>K</mi></math></span> univariate Gaussian distributions and the standard softmax function is exploited with an aim to improve the estimation of workers’ abilities. Compared to existing methods, FGBCC is capable of learning extensive worker behaviors and is less susceptible to these issues that previous methods suffer from, owing to its stronger generalization ability. Moreover, Considering the exact solution to the complex posterior is unavailable, we devise a computationally efficient algorithm to approximate the posterior. Extensive experiments on 24 real-world datasets covering a wide range of domains, verify the clear advantages of FGBCC over 11 state-of-the-art benchmark methods.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103914"},"PeriodicalIF":7.4000,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324002735","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Truth inference in crowdsourcing, which studies how to aggregate noisy and biased annotations from workers with varied expertise, is a fundamental technology powering the quality of crowdsourced annotations. Generally, confusion-matrix-based methods are more promising and worker better, as they model each worker’s ability using a confusion matrix rather than a single real value. However, the imbalanced classes and the insufficient training data caused by the K×K pattern (K refers to the number of classes) are still two major issues for the learning of confusion matrices, which call for a robust modeling structure of workers’ confusion matrices. In this article, we propose in response a Fine-Grained Bayesian Classifier Combination model (FGBCC), in which a combination of K univariate Gaussian distributions and the standard softmax function is exploited with an aim to improve the estimation of workers’ abilities. Compared to existing methods, FGBCC is capable of learning extensive worker behaviors and is less susceptible to these issues that previous methods suffer from, owing to its stronger generalization ability. Moreover, Considering the exact solution to the complex posterior is unavailable, we devise a computationally efficient algorithm to approximate the posterior. Extensive experiments on 24 real-world datasets covering a wide range of domains, verify the clear advantages of FGBCC over 11 state-of-the-art benchmark methods.
通过增强工人能力建模实现众包中的稳健注释聚合
众包中的真相推理是研究如何从具有不同专业知识的工作者那里汇总有噪声和有偏差的注释,是提高众包注释质量的一项基本技术。一般来说,基于混淆矩阵的方法更有前途,工作效率也更高,因为它们使用混淆矩阵而不是单一的真实值来模拟每个工作人员的能力。然而,K×K 模式(K 指类的数量)导致的类不平衡和训练数据不足仍是混淆矩阵学习的两大问题,这就要求对工作者的混淆矩阵建立健壮的建模结构。在本文中,我们提出了细粒度贝叶斯分类器组合模型(FGBCC),利用 K 个单变量高斯分布和标准 softmax 函数的组合来改进对工人能力的估计。与现有方法相比,FGBCC 能够学习工人的广泛行为,并且由于其较强的泛化能力,不易受到以往方法所存在的这些问题的影响。此外,考虑到复杂后验的精确解不可用,我们设计了一种计算高效的算法来近似后验。在涵盖广泛领域的 24 个实际数据集上进行的大量实验验证了 FGBCC 相对于 11 种最先进基准方法的明显优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信