Using q-learning for sequencing level difficulties in a citizen science matching game

3Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Sequencing task difficulty and variety can be a powerful tool for increasing engagement in online citizen science platforms. The abundance of available participant data presents great promise for machine learning oriented approaches to making tasks more engaging for participants. We present a web game for image matching called Tile-o-Scope Grid, and explore using a Q-learning based algorithm to generate a policy for sequencing level difficulties. Recruiting players using Amazon Mechanical Turk, we gathered data to train and evaluate approaches to sequencing level difficulties in Tile-o-Scope Grid. Comparisons of our Q-learning based algorithm with uniform random and greedy baselines suggest potential for using reinforcement learning for citizen science image labeling.

Cite

CITATION STYLE

APA

Spatharioti, S. E., Wylie, S., & Cooper, S. (2019). Using q-learning for sequencing level difficulties in a citizen science matching game. In CHI PLAY 2019 - Extended Abstracts of the Annual Symposium on Computer-Human Interaction in Play (pp. 679–686). Association for Computing Machinery, Inc. https://doi.org/10.1145/3341215.3356299

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free