Fetching the paper…
Reading the bibliography…
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 recognition, recommendation, and proofreading.
C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , Journal of Research of The National Bureau Of Standards 45
1950
Earlier work this paper cites.
G. Wyszecki and W. S. Stiles, Color science: Concepts and methods, quantitative data and formulae , Wiley-Interscience, 1967
1967
Earlier work this paper cites.
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
1979
Earlier work this paper cites.
J. Pearl, Probabilistic Reasoning in Intelligent Systems , Morgan Kaufmann Publ., San Mateo, Califonia, 1988
1988
Earlier work this paper cites.
N. Littlestone and M. K. Warmuth, The weighted majority algorithm , Foundations of Computer Science, 1989., 30th Annual Symposium on, oct 1989, pp. 256 –261
1989
Earlier work this paper cites.
P. Smyth, U. Fayyad, M. Burl, P. Perona, and P. Baldi, Inferring ground truth from subjective labelling of venus images , Advances in neural information processing systems, 1995, pp. 1085–1092
1995
Earlier work this paper cites.
W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman, Broadcasting on trees and the ising model , The Annals of Applied Probability 10
2000
Earlier work this paper cites.
B. Bollobás, Random Graphs , Cambridge University Press, January 2001
2001
Earlier work this paper cites.
R. Jin and Z. Ghahramani, Learning with multiple labels , Advances in neural information processing systems, 2003, pp. 921–928
2003
Earlier work this paper cites.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, Understanding belief propagation and its generalizations , pp. 239–269, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2003
2003
Earlier work this paper cites.
N. Alon and J. H. Spencer, The probabilistic method , John Wiley, 2008
2008
Earlier work this paper cites.
T. Richardson and R. Urbanke, Modern Coding Theory , Cambridge University Press, march 2008
2008
Cited alongside, same era.
V. S. Sheng, F. Provost, and P. G. Ipeirotis, Get another label? improving data quality and data mining using multiple, noisy labelers , Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD ’08, ACM, 2008, pp. 614–622
2008
Cited alongside, same era.
P. Donmez, J. G. Carbonell, and J. Schneider, Efficiently learning the accuracy of labeling sources for selective sampling , Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, 2009, pp. 259–268
2009
Cited alongside, same era.
M. Mezard and A. Montanari, Information, physics, and computation , Oxford University Press, Inc., New York, NY, USA, 2009
2009
Cited alongside, same era.
P. Welinder, S. Branson, S. Belongie, and P. Perona, The multidimensional wisdom of crowds , Advances in Neural Information Processing Systems, 2010, pp. 2424–2432
2010
Later among the works it cites.
T. Yan, V. Kumar, and D. Ganesan, Crowdsearch: exploiting crowds for accurate real-time image search on mobile phones , Proceedings of the 8th international conference on Mobile systems, applications, and services, MobiSys ’10, 2010, pp. 77–90
2010
Later among the works it cites.
Y. Zheng, S. Scott, and K. Deng, Active learning from multiple noisy labelers with varied costs , Data Mining (ICDM), 2010 IEEE 10th International Conference on, dec. 2010, pp. 639 –648
2010
Later among the works it cites.
M. S. Bernstein, J. Brandt, R. C. Miller, and D. R. Karger, Crowds in two seconds: enabling realtime crowd-powered interfaces , Proceedings of the 24th annual ACM symposium on User interface software and technology, UIST ’11, 2011, pp. 33–42
2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. P. Bigham, C. Jayant, H. Ji, G. Little, A. Miller, R. C. Miller, R. Miller, A. Tatarowicz, B. White, S. White, and T. Yeh, Vizwiz: nearly real-time answers to visual questions , Proceedings of the 23nd annual ACM symposium on User interface software and technology, UIST ’10, 2010, pp. 333–342
2010
Cited alongside, same era.
M. S. Bernstein, G. Little, R. C. Miller, B. Hartmann, M. S. Ackerman, D. R. Karger, D. Crowell, and K. Panovich, Soylent: a word processor with a crowd inside , Proceedings of the 23nd annual ACM symposium on User interface software and technology (New York, NY, USA), ACM UIST, 2010, pp. 313–322
2010
Cited alongside, same era.
L. B. Chilton, J. J. Horton, R. C. Miller, and S. Azenkot, Task search in a human computation market , Proceedings of the ACM SIGKDD Workshop on Human Computation, HCOMP ’10, 2010, pp. 1–9
2010
Cited alongside, same era.
P. G. Ipeirotis, Analyzing the amazon mechanical turk marketplace , XRDS 17
2010
Cited alongside, same era.
W. Mason and D. J. Watts, Financial incentives and the “performance of crowds” , SIGKDD Explor. Newsl. 11
2010
Cited alongside, same era.
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
2010
Cited alongside, same era.
V. C. Raykar, S. Yu, L. H. Zhao, G. H. Valadez, C. Florin, L. Bogoni, L. Moy, and D. Blei, Learning from crowds , Journal of Machine Learning Research (2010), no. 11, 1297–1322
2010
Cited alongside, same era.
Ş. Ertekin, H. Hirsh, and C. Rudin, Approximating the wisdom of the crowd , Proceedings of the Second Workshop on Computational Social Science and the Wisdom of Crowds (NIPS 2011), 2011
2011
Closest in time.
S. Faradani, B. Hartmann, and P. G. Ipeirotis, What’s the right price? pricing tasks for finishing on time , Human Computation’11, 2011
2011
Closest in time.
S. Holmes, Crowd counting a crowd , 2011, March 2011, Statistics Seminar, Stanford University
2011
Closest in time.
D. R. Karger, S. Oh, and D. Shah, Budget-optimal crowdsourcing using low-rank matrix approximations , Proc. of the Allerton Conf. on Commun., Control and Computing, 2011
2011
Closest in time.
V. C. Raykar and S. Yu, Eliminating spammers and ranking annotators for crowdsourced labeling tasks , J. Mach. Learn. Res. 13
2012
Closest in time.
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, vol. 22, 2009, pp. 2035–2043
2043
Closest in time.