Name
Abstract | ||
|---|---|---|
Crowdsourcing systems, in which tasks are electronically distributed to numerous ``information piece-workers'', have emerged as an effective paradigm for human-powered solving of large scale problems in domains such as image classification, data entry, optical character recognition, recommendation, and proofreading. Because these low-paid workers can be unreliable, nearly all crowdsourcers must devise schemes to increase confidence in their answers, typically by assigning each task multiple times and combining the answers in some way such as majority voting. In this paper, we consider a general model of such rowdsourcing tasks, and pose the problem of minimizing the total price (i.e., number of task assignments) that must be paid to achieve a target overall reliability. We give new algorithms for deciding which tasks to assign to which workers and for inferring correct answers from the workers’ answers. We show that our algorithm significantly outperforms majority voting and, in fact, are asymptotically optimal through comparison to an oracle that knows the reliability of every worker. |
Year | Venue | Field |
|---|---|---|
2011 | NIPS | Crowdsourcing,Computer science,Optical character recognition,Oracle,Data entry,Artificial intelligence,Iterative learning control,Majority rule,Contextual image classification,Asymptotically optimal algorithm,Machine learning |
DocType | Citations | PageRank |
Conference | 50 | 2.43 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David R. Karger | 1 | 19367 | 2233.64 |
| Sewoong Oh | 2 | 843 | 60.50 |
| Devavrat Shah | 3 | 4075 | 340.63 |