A unified framework implementing linear binary relevance for multi-label learning

doi:10.1016/j.neucom.2018.02.010

Return

A unified framework implementing linear binary relevance for multi-label learning

2018-05-01

PRE

DOI：10.1016/j.neucom.2018.02.010

Original

Original request for help

Save

Abstract

En 中文

Multi-label learning is the problem where each instance is associated with multiple labels simultaneously. Binary Relevance (BR), which comes from the idea of one-vs-all for multi-class classification, is a representative algorithm for multi-label learning. It ignores label correlations and may suffer the class-imbalance problem. However, BR is mostly implemented by decomposing into many independent binary classifiers and learning each individually, making it difficult to extend. Moreover, when extending BR by learning together, the mostly used least squared loss function is more suitable for a regression task rather than a classification task. In this paper, we propose a unified framework implementing linear BR for multi-label learning, which is easy to extend and can also be applied in one-vs-all for multi-class classification. We mainly focus on five popular convex loss functions. Experimental results show that the unified framework achieves competitive performances than traditional implementations and some other well-established algorithms for both multi-label learning and multi-class classification. Furthermore, logistic, exponential and least squared hinge loss functions are more suitable for multi-label learning, while logistic and least squared hinge loss functions are more suitable for multi-class classification. (C) 2018 Elsevier B.V. All rights reserved.

Keywords:

Binary relevance

One-vs-all

Loss function

Multi-label learning

Multi-class classification

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.