Skip to main content
main-content
Top

Hint

Swipe to navigate through the articles of this issue

23-11-2020 | Regular Paper | Issue 2/2021

Knowledge and Information Systems 2/2021

Partial multi-label learning with noisy side information

Journal:
Knowledge and Information Systems > Issue 2/2021
Authors:
Lijuan Sun, Songhe Feng, Gengyu Lyu, Hua Zhang, Guojun Dai
Important notes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Abstract

Partial multi-label learning (PML) aims to learn from the training data where each training example is annotated with a candidate label set, among which only a subset is relevant. Despite the success of existing PML approaches, a major drawback of them lies in lacking of robustness to noisy side information. To tackle this problem, we introduce a novel partial multi-label learning with noisy side information approach, which simultaneously removes noisy outliers from the training instances and trains robust partial multi-label classifier for unlabeled instances prediction. Specifically, we first represent the observed sample set as a feature matrix and then decompose it into an ideal feature matrix and an outlier feature matrix by using the low-rank and sparse decomposition scheme, where the former is constrained to be low rank by considering that the noise-free feature information always lies in a low-dimensional subspace and the latter is assumed to be sparse by considering that the outliers are usually sparse among the observed feature matrix. Secondly, we refine an ideal label confidence matrix from the observed label matrix and use the graph Laplacian regularization to constrain the confidence matrix to keep the intrinsic structure among feature vectors. Thirdly, we constrain the feature mapping matrix to be low rank by utilizing the label correlations. Finally, we obtain both the ideal features and ground-truth labels via minimizing the loss function, where the augmented Lagrange multiplier algorithm and quadratic programming are incorporated to solve the optimization problem. Extensive experiments conducted on ten different data sets demonstrate the effectiveness of our proposed method.

Please log in to get access to this content

To get access to this content you need the following product:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 69.000 Bücher
  • über 500 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Umwelt
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Testen Sie jetzt 30 Tage kostenlos.

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 58.000 Bücher
  • über 300 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Testen Sie jetzt 30 Tage kostenlos.

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 50.000 Bücher
  • über 380 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Umwelt
  • Maschinenbau + Werkstoffe




Testen Sie jetzt 30 Tage kostenlos.

Literature
About this article

Other articles of this Issue 2/2021

Knowledge and Information Systems 2/2021 Go to the issue

Premium Partner

    Image Credits