Reliable Aggregation of Boolean Crowdsourced Tasks

Authors

  • Luca de Alfaro University of California, Santa Cruz
  • Vassilis Polychronopoulos University of California, Santa Cruz
  • Michael Shavlovsky University of California, Santa Cruz

DOI:

https://doi.org/10.1609/hcomp.v3i1.13240

Keywords:

iterative methods, spam, reputation systems, aggregation

Abstract

We propose novel algorithms for the problem of crowdsourcing binary labels. Such binary labeling tasks are very common in crowdsourcing platforms, for instance, to judge the appropriateness of web content or to flag vandalism. We propose two unsupervised algorithms: one simple to implement albeit derived heuristically, and one based on iterated bayesian parameter estimation of user reputation models. We provide mathematical insight into the benefits of the proposed algorithms over existing approaches, and we confirm these insights by showing that both algorithms offer improved performance on many occasions across both synthetic and real-world datasets obtained via Amazon Mechanical Turk.

Downloads

Published

2015-09-23

How to Cite

de Alfaro, L., Polychronopoulos, V., & Shavlovsky, M. (2015). Reliable Aggregation of Boolean Crowdsourced Tasks. Proceedings of the AAAI Conference on Human Computation and Crowdsourcing, 3(1), 42-51. https://doi.org/10.1609/hcomp.v3i1.13240