A task recommendation scheme for crowdsourcing based on expertise estimation

•A task recommendation model that improves the success rate of workers is presented.•The use of predictive modelling along with auxilliary information improves the accuracy in recommendation.•Task recommendation for inexpertise workers is explored.•A taxonomy model is used to reduce the complexity i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronic commerce research and applications 2020-05, Vol.41, p.100946, Article 100946
Hauptverfasser: Kurup, Ayswarya R., Sajeev, G.P.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•A task recommendation model that improves the success rate of workers is presented.•The use of predictive modelling along with auxilliary information improves the accuracy in recommendation.•Task recommendation for inexpertise workers is explored.•A taxonomy model is used to reduce the complexity in similarity computation. In crowdsourcing systems, tasks are accomplished by a crowd of workers in a competitive mode. Since tasks are diverse in nature, workers face difficulties in selecting a task. This could be resolved by deploying a task recommendation mechanism. Existing methods for task recommendation do not exploit the participation of workers and their winning chances. Hence, the success rate of workers is low. This paper proposes a novel task recommendation scheme that utilizes the winning and participation probabilities along with the dynamic nature of crowdsourcing platforms. Further, we address the cold-start problem using a hierarchical mapping of skills. The proposed scheme is validated through simulation using real and synthetic data, in comparison with state-of-the-art recommendation methods. The results indicate that this model obtains competitive accuracy in task recommendation and improves the success rate of workers. We observed that the cold start problem reduces substantially with less computational overhead.
ISSN:1567-4223
1873-7846
DOI:10.1016/j.elerap.2020.100946