Abstract
For many supervised learning tasks it may be infeasible (or very expensive) to obtain objective and reliable labels. Instead, we can collect subjective (possibly noisy) labels from multiple experts or annotators. In practice, there is a substantial amount of disagreement among the annotators, and hence it is of great practical interest to address conventional supervised learning problems in this scenario. In this paper we describe a probabilistic approach for supervised learning when we have multiple annotators providing (possibly noisy) labels but no absolute gold standard. The proposed algorithm evaluates the different experts and also gives an estimate of the actual hidden labels. Experimental results…
Citation impact
1,009
total citations
- FWCI
- 117.67
- Percentile
- 100%
- References
- 24
Citations per year
Authors
7Topics & keywords
Topics
Keywords
- Computer science
- Artificial intelligence
- Machine learning
- Probabilistic logic
- Voting
- Crowds
- Baseline (sea)
- Supervised learning
No related works found for this paper.