Skip to main navigation Skip to search Skip to main content

Adaptive Result Inference for Collecting Quantitative Data with Crowdsourcing

  • Hailong Sun*
  • , Kefan Hu
  • , Yili Fang
  • , Yangqiu Song
  • *Corresponding author for this work
  • Beihang University
  • Hong Kong University of Science and Technology

Research output: Contribution to journalArticlepeer-review

Abstract

In quantitative crowdsourcing, workers are asked to provide numerical answers. Different from categorical crowdsourcing, result aggregation in quantitative crowdsourcing is processed by combinatorially computing over all workers' answers instead of by merely choosing one from a set of candidate answers. Therefore, existing result aggregation models for categorical crowdsourcing tasks cannot be used in quantitative crowdsourcing. Moreover, the worker ability often varies in the process of crowdsourcing with the changing of workers' skill, willingness, efforts, etc. In this paper, we propose a probabilistic model to characterize the quantitative crowdsourcing problem by considering the changing of worker ability so as to achieve better quality control. The dynamic worker ability is obtained with Kalman filtering and smoother. We design an expectation-maximization-based inference algorithm and a dynamic worker filtering algorithm to compute the aggregated crowdsourcing result. Finally, we conducted experiments with real data on CrowdFlower and the results showed that our approach can effectively rule out low-quality workers dynamically and obtain more accurate results with less costs.

Original languageEnglish
Article number7862852
Pages (from-to)1389-1398
Number of pages10
JournalIEEE Internet of Things Journal
Volume4
Issue number5
DOIs
StatePublished - Oct 2017

Keywords

  • Crowdsensing
  • quality control
  • quantitative crowdsourcing
  • result inference

Fingerprint

Dive into the research topics of 'Adaptive Result Inference for Collecting Quantitative Data with Crowdsourcing'. Together they form a unique fingerprint.

Cite this