Budget-Optimal Crowdsourcing Using Low-Rank Matrix Approximations
Crowdsourcing systems, in which numerous 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 recognitio...
Main Authors: | Karger, David R. (Contributor), Oh, Sewoong (Contributor), Shah, Devavrat (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2012-09-28T12:41:30Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
by: Karger, David R., et al.
Published: (2014) -
Iterative Learning for Reliable Crowdsourcing Systems
by: Karger, David R., et al.
Published: (2012) -
Efficient crowdsourcing for multi-class labeling
by: Karger, David R., et al.
Published: (2014) -
Rank Centrality: Ranking from Pairwise Comparisons
by: Negahban, Sahand, et al.
Published: (2017) -
Iterative Ranking from Pair-wise Comparisons
by: Negahban, Sahand N., et al.
Published: (2021)