Efficient Crowd Exploration of Large Networks

  • Berenberg D
  • Bagrow J
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Accurately and efficiently crowdsourcing complex, open-ended tasks can be difficult, as crowd participants tend to favor short, repetitive "microtasks". We study the crowdsourcing of large networks where the crowd provides the network topology via microtasks. Crowds can explore many types of social and information networks, but we focus on the network of causal attributions, an important network that signifies cause-and-effect relationships. We conduct experiments on Amazon Mechanical Turk (AMT) testing how workers can propose and validate individual causal relationships and introduce a method for independent crowd workers to explore large networks. The core of the method, Iterative Pathway Refinement, is a theoretically-principled mechanism for efficient exploration via microtasks. We evaluate the method using synthetic networks and apply it on AMT to extract a large-scale causal attribution network. Worker interactions reveal important characteristics of causal perception and the generated network data can help improve our understanding of causality and causal inference.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Berenberg, D., & Bagrow, J. P. (2018). Efficient Crowd Exploration of Large Networks. Proceedings of the ACM on Human-Computer Interaction, 2(CSCW), 1–25. https://doi.org/10.1145/3274293

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 4

100%

Readers' Discipline

Tooltip

Computer Science 2

50%

Agricultural and Biological Sciences 1

25%

Engineering 1

25%

Save time finding and organizing research with Mendeley

Sign up for free