Candidate Labeling for Crowd Learning
Iker Be\~naran-Mu\~noz, Jer\'onimo Hern\'andez-Gonz\'alez, Aritz, P\'erez

TL;DR
This paper introduces candidate labeling in crowd learning, allowing annotators to provide multiple labels per instance, which improves label acquisition efficiency compared to traditional single-label methods.
Contribution
It proposes and empirically validates the use of candidate labeling to better leverage non-expert annotators' knowledge in crowd learning.
Findings
Candidate labeling increases label accuracy.
It reduces the number of annotations needed.
Improves efficiency over standard crowd labeling.
Abstract
Crowdsourcing has become very popular among the machine learning community as a way to obtain labels that allow a ground truth to be estimated for a given dataset. In most of the approaches that use crowdsourced labels, annotators are asked to provide, for each presented instance, a single class label. Such a request could be inefficient, that is, considering that the labelers may not be experts, that way to proceed could fail to take real advantage of the knowledge of the labelers. In this paper, the use of candidate labeling for crowd learning is proposed, where the annotators may provide more than a single label per instance to try not to miss the real label. The main hypothesis is that, by allowing candidate labeling, knowledge can be extracted from the labelers more efficiently by than in the standard crowd learning scenario. Empirical evidence which supports that hypothesis is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Crowdsensing and Crowdsourcing · Data Stream Mining Techniques · Machine Learning and Data Classification
