Recycling Weak Labels for Multiclass Classification Articles uri icon

authors

  • Perell√≥ Nieto, Miquel
  • SANTOS RODRIGUEZ, RAUL
  • GARCIA GARCIA, DARIO
  • CID SUEIRO, JESUS

publication date

  • August 2020

start page

  • 206

end page

  • 215

volume

  • 400

International Standard Serial Number (ISSN)

  • 0925-2312

Electronic International Standard Serial Number (EISSN)

  • 1872-8286

abstract

  • 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.

keywords

  • classification; weak label; loss function; cost-sensitive learning