Budget-optimal crowdsourcing using low-rank matrix approximations

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Volumn , Issue , 2011, Pages 284-291

  Karger, David R ^a   Oh, Sewoong ^a   Shah, Devavrat ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CROWDSOURCING; LARGE-SCALE PROBLEM; LOW-PAID WORKERS; LOW-RANK MATRICES; MAJORITY VOTING; TASK ASSIGNMENT;

COMMUNICATION; DISTRIBUTED COMPUTER SYSTEMS; IMAGE COMMUNICATION SYSTEMS; OPTICAL CHARACTER RECOGNITION; OPTICAL COMMUNICATION; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 84856118112     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2011.6120180     Document Type: Conference Paper

References (16)

1. A. P. Dawid and A. M. Skene. Maximum likelihood estimation of observer error-rates using the em algorithm. Journal of the Royal Statistical Society. Series C (Applied Statistics), 28(1):20-28, 1979.
2. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39(1):pp. 1-38, 1977.
3. R. Jin and Z. Ghahramani. Learning with multiple labels. Advances in neural information processing systems, pages 921-928, 2003.
4. V. C. Raykar, S. Yu, L. H. Zhao, G. H. Valadez, C. Florin, L. Bogoni, and L. Moy. Learning from crowds. J. Mach. Learn. Res., 99:1297-1322, August 2010.
5. J. Whitehill, P. Ruvolo, T. Wu, J. Bergsma, and J. Movellan. Whose vote should count more: Optimal integration of labels from labelers of unknown expertise. Advances in Neural Information Processing Systems, 22:2035-2043, 2009.
6. P. Welinder, S. Branson, S. Belongie, and P. Perona. The Multidimensional Wisdom of Crowds. pages 2424-2432, 2010.
7. V. S. Sheng, F. Provost, and P. G. Ipeirotis. Get another label? improving data quality and data mining using multiple, noisy labelers. In Proceeding of the 14th ACM SIGKDD, pages 614-622. ACM, 2008.
8. J. Friedman, J. Kahn, and E. Szemerédi. On the second eigenvalue in random regular graphs. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pages 587-598. ACM, may 1989.
9. T. Richardson and R. Urbanke. Modern Coding Theory. Cambridge University Press, march 2008.
10. B. Bollobás. Random Graphs. Cambridge University Press, January 2001.
11. M. W. Berry. Large scale sparse singular value computations. International Journal of Supercomputer Applications, 6:13-49, 1992.
12. P. G. Ipeirotis, F. Provost, and J. Wang. Quality management on amazon mechanical turk. In Proceedings of the ACM SIGKDD Workshop on Human Computation, HCOMP '10, pages 64-67. ACM, 2010.
13. I. T. Jolliffe. Principal component analysis. Springer-Verlag, 1986.
14. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1990.
15. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from a few entries. IEEE Trans. Inform. Theory, 56(6):2980-2998, June 2010.
16. U. Feige and E. Ofek. Spectral techniques applied to sparse random graphs. Random Struct. Algorithms, 27(2):251-275, 2005. (Pubitemid 41482549)