메뉴 건너뛰기




Volumn , Issue , 2016, Pages 473-482

How many workers to ask? Adaptive exploration for collecting high quality labels

Author keywords

Adaptive algorithms; Assessments; Crowdsourcing; Ground truth; Label quality; Multi armed bandits

Indexed keywords

ADAPTIVE ALGORITHMS; CROWDSOURCING; INFORMATION RETRIEVAL;

EID: 84980317079     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2911451.2911514     Document Type: Conference Paper
Times cited : (26)

References (27)
  • 1
    • 84893485049 scopus 로고    scopus 로고
    • Adaptive crowdsourcing algorithms for the bandit survey problem
    • Ittai Abraham, Omar Alonso, Vasilis Kandylas, and Aleksandrs Slivkins. Adaptive crowdsourcing algorithms for the bandit survey problem. In 26th COLT, 2013.
    • (2013) 26th COLT
    • Abraham, I.1    Alonso, O.2    Kandylas, V.3    Slivkins, A.4
  • 2
    • 84865695467 scopus 로고    scopus 로고
    • Using crowdsourcing for TREC relevance assessment
    • Omar Alonso and Stefano Mizzaro. Using crowdsourcing for TREC relevance assessment. Inf. Process. Manage., 48(6):1053-1066, 2012.
    • (2012) Inf. Process. Manage. , vol.48 , Issue.6 , pp. 1053-1066
    • Alonso, O.1    Mizzaro, S.2
  • 3
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multiarmed bandit problem
    • Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235-256, 2002.
    • (2002) Machine Learning , vol.47 , Issue.2-3 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 4
    • 0000769115 scopus 로고
    • A single-sample multiple decision procedure for selecting the multinomial event which has the highest probability
    • R. E. Bechhofer, S. Elmaghraby, and N. Morse. A single-sample multiple decision procedure for selecting the multinomial event which has the highest probability. Annals of Mathematical Statistics, 30:102-119, 1959.
    • (1959) Annals of Mathematical Statistics , vol.30 , pp. 102-119
    • Bechhofer, R.E.1    Elmaghraby, S.2    Morse, N.3
  • 5
    • 84952208040 scopus 로고
    • Truncation of the bechhofer-kiefer-sobel sequential procedure for selecting the multinomial event which has the largest probability
    • R. E. Bechhofer and D. Goldsman. Truncation of the bechhofer-kiefer-sobel sequential procedure for selecting the multinomial event which has the largest probability. Communications in Statistics - Simulation and Computation, B14:283-315, 1985.
    • (1985) Communications in Statistics - Simulation and Computation , vol.B14 , pp. 283-315
    • Bechhofer, R.E.1    Goldsman, D.2
  • 7
    • 84874045238 scopus 로고    scopus 로고
    • Regret analysis of stochastic and nonstochastic multi-armed bandit problems
    • Sébastien Bubeck and Nicolo Cesa-Bianchi. Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems. Foundations and Trends in Machine Learning, 5(1):1-122, 2012.
    • (2012) Foundations and Trends in Machine Learning , vol.5 , Issue.1 , pp. 1-122
    • Bubeck, S.1    Cesa-Bianchi, N.2
  • 8
    • 80053402398 scopus 로고    scopus 로고
    • Fast, cheap, and creative: Evaluating translation quality using amazon's mechanical turk
    • Chris Callison-Burch. Fast, cheap, and creative: Evaluating translation quality using amazon's mechanical turk. In EMNLP, pages 286-295, 2009.
    • (2009) EMNLP , pp. 286-295
    • Callison-Burch, C.1
  • 10
    • 84897543509 scopus 로고    scopus 로고
    • Optimistic knowledge gradient for optimal budget allocation in crowdsourcing
    • Xi Chen, Qihang Lin, and Dengyong Zhou. Optimistic knowledge gradient for optimal budget allocation in crowdsourcing. In 30th ICML, 2013.
    • (2013) 30th ICML
    • Chen, X.1    Lin, Q.2    Zhou, D.3
  • 11
    • 0034538249 scopus 로고    scopus 로고
    • An optimal algorithm for Monte Carlo estimation
    • Paul Dagum, Richard M. Karp, Michael Luby, and Sheldon M. Ross. An optimal algorithm for monte carlo estimation. SIAM J. on Computing, 29(5):1484-1496, 2000.
    • (2000) SIAM J. on Computing , vol.29 , Issue.5 , pp. 1484-1496
    • Dagum, P.1    Karp, R.M.2    Luby, M.3    Ross, S.M.4
  • 12
    • 0003102944 scopus 로고
    • Maximum likelihood estimation of observer error-rates using the em algorithm
    • Alexander Philip Dawid and Allan M Skene. Maximum likelihood estimation of observer error-rates using the em algorithm. Applied statistics, pages 20-28, 1979.
    • (1979) Applied Statistics , pp. 20-28
    • Dawid, A.P.1    Skene, A.M.2
  • 13
    • 84867409394 scopus 로고    scopus 로고
    • Vox populi: Collecting high-quality labels from a crowd
    • Ofer Dekel and Ohad Shamir. Vox populi: Collecting high-quality labels from a crowd. In 22nd COLT, 2009.
    • (2009) 22nd COLT
    • Dekel, O.1    Shamir, O.2
  • 14
    • 0000169010 scopus 로고
    • Bandit processes and dynamic allocation indices (with discussion)
    • J. C. Gittins. Bandit processes and dynamic allocation indices (with discussion). J. Roy. Statist. Soc. Ser. B, 41:148-177, 1979.
    • (1979) J. Roy. Statist. Soc. Ser. B , vol.41 , pp. 148-177
    • Gittins, J.C.1
  • 15
    • 84897504552 scopus 로고    scopus 로고
    • Adaptive task assignment for crowdsourced classification
    • Chien-Ju H.o., Shahin Jabbari, and Jennifer Wortman Vaughan. Adaptive task assignment for crowdsourced classification. In 30th ICML, 2013.
    • (2013) 30th ICML
    • Chien-Ju, H.O.1    Jabbari, S.2    Vaughan, J.W.3
  • 16
    • 77956245055 scopus 로고    scopus 로고
    • Quality management on amazon mechanical turk
    • Panagiotis Ipeirotis, Foster Provost, and Jing Wang. Quality Management on Amazon Mechanical Turk. In HCOMP, 2010.
    • (2010) HCOMP
    • Ipeirotis, P.1    Provost, F.2    Wang, J.3
  • 17
    • 0018344993 scopus 로고
    • A sequential procedure for selecting the most probable multinomial event
    • J. T. Ramey Jr. and K. Alam. A sequential procedure for selecting the most probable multinomial event. Biometrica, 66:171-173, 1979.
    • (1979) Biometrica , vol.66 , pp. 171-173
    • Ramey, J.T.1    Alam, K.2
  • 18
    • 84899442104 scopus 로고    scopus 로고
    • Combining human and Machine intelligence in large-scale crowdsourcing
    • Ece Kamar, Severin Hacker, and Eric Horvitz. Combining human and machine intelligence in large-scale crowdsourcing. In 11th AAMAS, 2012.
    • (2012) 11th AAMAS
    • Kamar, E.1    Hacker, S.2    Horvitz, E.3
  • 19
    • 85162483531 scopus 로고    scopus 로고
    • Iterative learning for reliable crowdsourcing systems
    • David R. Karger, Sewoong Oh, and Devavrat Shah. Iterative learning for reliable crowdsourcing systems. In 25th NIPS, pages 1953-1961, 2011.
    • (2011) 25th NIPS , pp. 1953-1961
    • Karger, D.R.1    Oh, S.2    Shah, D.3
  • 20
  • 23
    • 80052132320 scopus 로고    scopus 로고
    • Quantifying test collection quality based on the consistency of relevance judgements
    • Falk Scholer, Andrew Turpin, and Mark Sanderson. Quantifying test collection quality based on the consistency of relevance judgements. In Proceeding of the 34th International ACM SIGIR, pages 1063-1072, 2011.
    • (2011) Proceeding of the 34th International ACM SIGIR , pp. 1063-1072
    • Scholer, F.1    Turpin, A.2    Sanderson, M.3
  • 24
    • 65449144451 scopus 로고    scopus 로고
    • Get another label? Improving data quality and data mining using multiple, noisy labelers
    • Victor S. Sheng, Foster J. Provost, and Panagiotis G. Ipeirotis. Get another label? improving data quality and data mining using multiple, noisy labelers. In 14th KDD, 2008.
    • (2008) 14th KDD
    • Sheng, V.S.1    Provost, F.J.2    Ipeirotis, P.G.3
  • 25
    • 84963496106 scopus 로고    scopus 로고
    • Online decision making in crowdsourcing markets: Theoretical challenges
    • December
    • Aleksandrs Slivkins and Jennifer Wortman Vaughan. Online decision making in crowdsourcing markets: Theoretical challenges. SIGecom Exchanges, 12(2), December 2013.
    • (2013) SIGecom Exchanges , vol.12 , Issue.2
    • Slivkins, A.1    Vaughan, J.W.2
  • 26
    • 80053360508 scopus 로고    scopus 로고
    • Cheap and fast - But is it good? Evaluating non-expert annotations for natural language tasks
    • Rion Snow, Brendan O'Connor, Daniel Jurafsky, and Andrew Y. Ng. Cheap and fast - but is it good? evaluating non-expert annotations for natural language tasks. In EMNLP, pages 254-263, 2008.
    • (2008) EMNLP , pp. 254-263
    • Snow, R.1    O'Connor, B.2    Jurafsky, D.3    Ng, A.Y.4
  • 27
    • 0001395850 scopus 로고
    • On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
    • William R. Thompson. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25(3-4):285-294, 1933.
    • (1933) Biometrika , vol.25 , Issue.3-4 , pp. 285-294
    • Thompson, W.R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.