Fundamental Limits of Budget-Fidelity Trade-off in Label Crowdsourcing
暂无分享,去创建一个
[1] Pietro Perona,et al. Inferring Ground Truth from Subjective Labelling of Venus Images , 1994, NIPS.
[2] Javier R. Movellan,et al. Whose Vote Should Count More: Optimal Integration of Labels from Labelers of Unknown Expertise , 2009, NIPS.
[3] Thomas M. Cover,et al. Network Information Theory , 2001 .
[4] Xi Chen,et al. Spectral Methods Meet EM: A Provably Optimal Algorithm for Crowdsourcing , 2014, J. Mach. Learn. Res..
[5] Babak Hassibi,et al. Graph Clustering With Missing Data: Convex Algorithms and Analysis , 2014, NIPS.
[6] Gerardo Hermosillo,et al. Learning From Crowds , 2010, J. Mach. Learn. Res..
[7] Ittai Abraham,et al. Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem , 2013, COLT.
[8] Ohad Shamir,et al. Vox Populi: Collecting High-Quality Labels from a Crowd , 2009, COLT.
[9] Devavrat Shah,et al. Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems , 2011, Oper. Res..
[10] A. P. Dawid,et al. Maximum Likelihood Estimation of Observer Error‐Rates Using the EM Algorithm , 1979 .
[11] Thomas M. Cover,et al. Elements of Information Theory , 2005 .