.png){kind=icon}
.png){kind=icon}
Return
Potential Dependency Analysis Based Task Recommendation Model for Crowdsourcing
.png){kind=icon}
PRE
AI
DOI：10.1109/TNSE.2024.3383440.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the explosive growth of crowdsourcing tasks, how to design appropriate task recommendation models that help workers to find appropriate tasks and improve task allocation efficiency has become a crucial issue in crowdsourcing. However, most existing task recommendation methods based on the Probabilistic Matrix Factorization (PMF) assume feature vectors are independent of each other, therefore impairing the accuracy of recommendation. In this paper, a potential dependency analysis based task recommendation model (PDA-TR) for crowdsourcing is proposed. Firstly, a worker-task rating matrix is decomposed into a worker potential feature matrix and a task potential feature matrix; secondly, the worker potential feature matrix is decomposed into a worker potential dependency matrix and a feature potential dependency matrix via additive factorization with Gaussian process; thirdly, by using the momentum gradient descent algorithm, the parameter matrices of the proposed model are updated, then a predictive worker-task rating matrix can be calculated. Moreover, when new workers have no ratings to tasks, the proposed model can predict their ratings to tasks through the mined dependencies among workers, which can overcome the complete cold start problem. Based on real-world datasets, experiment results verify that the proposed model has obvious advantages over other baselines in terms of accuracy.
Keywords:
Task analysis
Crowdsourcing
Matrix decomposition
Analytical models
Vectors
Electronic mail
Gaussian processes
task recommendation
probabilistic matrix factorization
potential dependency
gaussian process
Journal
I
IF:
7.9
Papers:
2.5K
Citations:
10.0K