Partial Multi-Label Learning

doi:10.1609/aaai.v32i1.11644

Partial Multi-Label Learning

2018-04-29

0

OA

AI

DOI：10.1609/aaai.v32i1.11644

原文链接

原文求助

摘要

En 中文

It is expensive and difficult to precisely annotate objects with multiple labels. Instead, in many real tasks, annotators may roughly assign each object with a set of candidate labels. The candidate set contains at least one but unknown number of ground-truth labels, and is usually adulterated with some irrelevant labels. In this paper, we formalize such problems as a new learning framework called partial multi-label learning (PML). To solve the PML problem, a confidence value is maintained for each candidate label to estimate how likely it is a ground-truth label of the instance. On one hand, the relevance ordering of labels on each instance is optimized by minimizing a rank loss weighted by the confidences; on the other hand, the confidence values are optimized by further exploiting structure information in feature and label spaces.Experimental results on various datasets show that the proposed approach is effective for solving PML problems.

Partial Multi-Label Learning

摘要

期刊

机构

引用论文