Recycling weak labels for multiclass classification

This paper explores the mechanisms to efficiently combine annotations of different quality for multiclass classification datasets, as we argue that it is easier to obtain large collections of weak labels as opposed to true labels. Since labels come from different sources, their annotations may have...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) 2020-08, Vol.400, p.206-215
Main Authors: Perello-Nieto, Miquel, Santos-Rodriguez, Raul, Garcia-Garcia, Dario, Cid-Sueiro, Jesus
Format: Article
Language:English
Subjects:
Classification
Cost-sensitive learning
Loss function
Weak label
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper explores the mechanisms to efficiently combine annotations of different quality for multiclass classification datasets, as we argue that it is easier to obtain large collections of weak labels as opposed to true labels. Since labels come from different sources, their annotations may have different degrees of reliability (e.g., noisy labels, supersets of labels, complementary labels or annotations performed by domain experts), and we must make sure that the addition of potentially inaccurate labels does not degrade the performance achieved when using only true labels. For this reason, we consider each group of annotations as being weakly supervised and pose the problem as finding the optimal combination of such collections. We propose an efficient algorithm based on expectation-maximization and show its performance in both synthetic and real-world classification tasks in a variety of weak label scenarios.
ISSN:0925-2312
1872-8286
DOI:10.1016/j.neucom.2020.03.002