Approximating the crowd

DOI10.1007/S10618-014-0354-1zbMATH Open1342.68267OpenAlexW2068882086MaRDI QIDQ736507FDOQ736507

Authors: Şeyda Ertekin, Cynthia Rudin, H. Hirsh 

Publication date: 4 August 2016

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-014-0354-1

Recommendations

• scientific article; zbMATH DE number 6745896
• Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems
• Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling
• Bayesian decision process for cost-efficient dynamic ranking via crowdsourcing
• Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach

zbMATH Keywords

wisdom of crowdsaggregating opinionsapproximating the crowdcrowdsourcinglabeler quality estimation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Cites Work

• Selective sampling and active learning from single and multiple teachers
• Repeated labeling using multiple noisy labelers

Cited In (7)

• Bandit-based task assignment for heterogeneous crowdsourcing
• Crowdsourcing with unsure option
• Spectral methods meet EM: a provably optimal algorithm for crowdsourcing
• Bayesian nonparametric crowdsourcing
• Learning from crowds with robust logistic regression
• Optimal stopping and worker selection in crowdsourcing: an adaptive sequential probability ratio test framework
• Crowdvoting judgment: an analysis of modern peer review

This page was built for publication: Approximating the crowd

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736507)