Crowd Access Path Optimization: Diversity Matters

Proceedings of the 3rd AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2015

Volumn , Issue , 2015, Pages 130-139

  Nushi, Besmira ^a   Singla, Adish ^a   Gruenheid, Anja ^a   Zamanian, Erfan ^b   Krause, Andreas ^a   Kossmann, Donald ^a,c  

^a ETH ZURICH   (Switzerland)

^b BROWN UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; QUALITY ASSURANCE;

'CURRENT; CROWD MODELLING; CROWDSOURCING PLATFORMS; GREEDY OPTIMIZATION; MODEL AGGREGATE; OPTIMISATIONS; OPTIMIZATION TECHNIQUES; PATH MODELS; PATH OPTIMIZATIONS; WORKERS';

CROWDSOURCING;

EID: 85032712776     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1609/hcomp.v3i1.13228     Document Type: Conference Paper

References (33)

1. Brambilla, M.; Ceri, S.; Mauri, A.; and Volonterio, R. 2014. Community-based crowdsourcing. In WWW, 891–896.
2. Cover, T. M., and Thomas, J. A. 2012. Elements of information theory. John Wiley & Sons.
3. Dawid, A. P., and Skene, A. M. 1979. Maximum likelihood estimation of observer error-rates using the em algorithm. Applied statistics 20–28.
4. De Campos, L. M. 2006. A scoring function for learning bayesian networks based on mutual information and conditional independence tests. JMLR 7:2149–2187.
5. Dempster, A. P.; Laird, N. M.; and Rubin, D. B. 1977. Maximum likelihood from incomplete data via the em algorithm. Journal of the royal statistical society. Series B (methodological) 1–38.
6. Feige, U. 1998. A threshold of ln n for approximating set cover. Journal of the ACM 45:314–318.
7. Franklin, M. J.; Kossmann, D.; Kraska, T.; Ramesh, S.; and Xin, R. 2011. Crowddb: answering queries with crowdsourcing. In SIGMOD, 61–72. ACM.
8. Ho, C.-J.; Jabbari, S.; and Vaughan, J. W. 2013. Adaptive task assignment for crowdsourced classification. In ICML, 534–542.
9. Hong, L., and Page, S. E. 2004. Groups of diverse problem solvers can outperform groups of high-ability problem solvers. Proc. of the National Academy of Sciences of USA 101(46):16385–16389.
10. Hui, T. W. L. C. P., and Li, C. J. Z. W. 2015. Hear the whole story: Towards the diversity of opinion in crowdsourcing markets. VLDB.
11. Ipeirotis, P. G.; Provost, F.; and Wang, J. 2010. Quality management on amazon mechanical turk. In Proc. of the ACM SIGKDD workshop on human computation, 64–67. ACM.
12. Jung, H. J., and Lease, M. 2013. Crowdsourced task routing via matrix factorization. arXiv preprint arXiv:1310.5142.
13. Karger, D. R.; Oh, S.; and Shah, D. 2011. Budget-optimal crowdsourcing using low-rank matrix approximations. In 49th Annual Allerton Conference, 284–291. IEEE.
14. Kazai, G.; Kamps, J.; and Milic-Frayling, N. 2012. The face of quality in crowdsourcing relevance labels: Demographics, personality and labeling accuracy. In CIKM, 2583–2586. ACM.
15. Khuller, S.; Moss, A.; and Naor, J. S. 1999. The budgeted maximum coverage problem. Inform. Process. Lett. 70(1):39–45.
16. Krause, A., and Guestrin, C. 2005a. Near-optimal nonmyopic value of information in graphical models. In UAI.
17. Krause, A., and Guestrin, C. 2005b. A note on the budgeted maximization of submodular functions.
18. Lamberson, P., and Page, S. E. 2012. Optimal forecasting groups. Management Science 58(4):805–810.
19. Li, H.; Zhao, B.; and Fuxman, A. 2014. The wisdom of minority: Discovering and targeting the right group of workers for crowdsourcing. In Proc. of the 23rd WWW.
20. Marcus, A.; Wu, E.; Karger, D. R.; Madden, S.; and Miller, R. C. 2011. Crowdsourced databases: Query processing with people. CIDR.
21. Nemhauser, G.; Wolsey, L.; and Fisher, M. 1978. An analysis of the approximations for maximizing submodular set functions. Math. Prog. 14:265–294.
22. Nushi, B.; Alonso, O.; Hentschel, M.; and Kandylas, V. 2015. Crowdstar: A social task routing framework for online communities. In ICWE, 219–230.
23. Parameswaran, A. G.; Park, H.; Garcia-Molina, H.; Polyzotis, N.; and Widom, J. 2012. Deco: declarative crowdsourcing. In CIKM.
24. Parameswaran, A.; Boyd, S.; Garcia-Molina, H.; Gupta, A.; Polyzotis, N.; and Widom, J. 2014. Optimal crowd-powered rating and filtering algorithms. VLDB.
25. Pochampally, R.; Sarma, A. D.; Dong, X. L.; Meliou, A.; and Srivastava, D. 2014. Fusing data with correlations. In SIGMOD.
26. Raykar, V. C.; Yu, S.; Zhao, L. H.; Valadez, G. H.; Florin, C.; Bogoni, L.; and Moy, L. 2010. Learning from crowds. JMLR.
27. Selinger, P. G.; Astrahan, M. M.; Chamberlin, D. D.; Lorie, R. A.; and Price, T. G. 1979. Access path selection in a relational database management system. In SIGMOD, 23–34. ACM.
28. Surowiecki, J. 2005. The wisdom of crowds. Random House LLC.
29. Sviridenko, M. 2004. A note on maximizing a submodular set function subject to knapsack constraint. Operations Research Letters v.(32):41–43.
30. Venanzi, M.; Guiver, J.; Kazai, G.; Kohli, P.; and Shokouhi, M. 2014. Community-based bayesian aggregation models for crowdsourcing. In Proc. of the 23rd WWW, 155–164.
31. Welinder, P.; Branson, S.; Mita, T.; Wah, C.; Schroff, F.; Belongie, S.; and Perona, P. 2010. Caltech-UCSD Birds 200. Technical Report CNS-TR-2010-001, California Institute of Technology.
32. Whitehill, J.; Ruvolo, P.; Wu, T.; Bergsma, J.; and Movellan, J. R. 2009. Whose vote should count more: Optimal integration of labels from labelers of unknown expertise. In NIPS.
33. Zhou, D.; Basu, S.; Mao, Y.; and Platt, J. C. 2012. Learning from the wisdom of crowds by minimax entropy. In NIPS, 2195–2203.