4.7 Article

Cost-sensitive multi-label learning with positive and negative label pairwise correlations

Journal

NEURAL NETWORKS
Volume 108, Issue -, Pages 411-423

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.neunet.2018.09.003

Keywords

Binary Relevance; Multi-label learning; Cost-sensitive; Positive label correlations; Negative label correlations

Funding

  1. National Natural Science Foundation of China [61472390, 71731009, 71331005, 91546201]
  2. Beijing Natural Science Foundation [1162005]
  3. Premium Funding Project for Academic Human Resources Development in Beijing Union University

Ask authors/readers for more resources

Multi-label learning is the problem where each instance is associated with multiple labels simultaneously. Binary Relevance (BR) is a representative algorithm for multi-label learning. However, it may suffer the class-imbalance issue especially when the label space is large. Besides, it ignores the label correlations, which is of importance to improve the performance. Moreover, labels might have positive and negative correlations in real applications, but existing methods seldom exploit the negative label correlations. In this paper, we propose a novel Cost-sensitive multi-label learning model with Positive and Negative Label pairwise correlations (CPNL), which extends BR to tackle the above issues. The kernel extension of the linear model is also provided to explore complex input-output relationships. Moreover, we adopt two accelerated gradient methods (AGM) to efficiently solve the linear and kernel models. Experimental results show that our approach CPNL achieves a competitive performance to some state-of-the-art approaches for multi-label learning. (C) 2018 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available