.png){kind=icon}
.png){kind=icon}
Return
A gradient descent matrix factorization for microtask crowdsourcing
.png){kind=icon}
OA
AI
DOI：10.1016/j.engappai.2025.111003.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Conventional crowdsourcing algorithms assign all tasks to all workers and collect their final answers. However, a major issue with these baseline approaches is their inability to identify and eliminate answers from low-quality or non-genuine workers. To tackle this challenge, novel microtasking algorithms have been proposed where workers' expertise is estimated to allocate tasks accordingly. These algorithms rely on a worker-task matrix, but a common problem is the potential sparsity of this matrix due to not all workers answering allocated tasks and a high ratio of tasks to workers. To address this issue, this paper introduces a novel optimization-based matrix factorization approach using Gradient Descent known as GRADi. GRADi aims to predict missing answers from different workers while factorizing the worker-task matrix. During this process, GRADi incorporates worker similarity information to enhance factorization accuracy. The effectiveness of GRADi is evaluated using datasets from Amazon Mechanical Turk and similar platforms, assessing accuracy and Root Mean Square Error. Comparative analyses against other matrix factorization algorithms, including both optimization and nonoptimization techniques, as well as existing microtasking algorithms, demonstrate that GRADi consistently outperforms these methods. It shows promising results in improving microtasking outcomes by better predicting worker responses and handling the inherent challenges of sparse worker-task matrices.
Keywords:
Microtasking
Crowdsourcing
Gradient descent
Matrix factorization
Task assignment
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
5.3K
Citations:
3.5W