Feature-label dual-mapping for missing label-specific features learning

Label-specific features learning can effectively exploit the unique features of each label, which alleviates the high dimensionality and improves the classification performance of multi-label. However, most existing label-specific features learning algorithms assume that label space is complete, ign...

Full description

Saved in:
Bibliographic Details
Published inSoft computing (Berlin, Germany) Vol. 25; no. 14; pp. 9307 - 9323
Main Authors Zhang, Lulu, Cheng, Yusheng, Wang, Yibin, Pei, Gensheng
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2021
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Label-specific features learning can effectively exploit the unique features of each label, which alleviates the high dimensionality and improves the classification performance of multi-label. However, most existing label-specific features learning algorithms assume that label space is complete, ignoring the effect of missing labels on the classification accuracy. Some methods try to recover the missing labels first and then learn the mapping between the completed label matrix and the feature matrix. However, early intervention in the recovery of missing labels may affect the distribution of original labels to a certain extent. In this paper, feature-label dual-mapping for missing label-specific features learning is proposed. According to the information that the label depends on the feature, the dual-mapping weight of the complete feature space and the missing label space is jointly learned. Therefore, the proposed algorithm is to conduct latent missing labels recovery by feature-label dual-mapping to directly obtain target weight in this paper, avoiding the negative influence of early label recovery intervention. Compared with several state-of-the-art methods in 10 benchmark multi-label data sets, the results show that the proposed algorithm is reasonable and effective.
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-021-05884-1