.png){kind=icon}
.png){kind=icon}
Return
Structured subspace learning-induced symmetric nonnegative matrix factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2021.108115.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Symmetric NMF (SNMF) is able to determine the inherent cluster structure with the constructed graph. However, the mapping between the empirically constructed similarity representation and the desired one may contain complex structural and hierarchical information, which is not easy to capture with single learning approaches. Then, we propose a novel Structured Subspace Learning-induced Symmetric Nonnegative Matrix Factorization (SSLSNMF) in this paper. Based on the similarity space to be learned, SSLSNMF further learns a latent subspace, which considers the global and local structure of the data. Since SSLSNMF is formulated in a semi-supervised way, the supervisory information with constraints of cannot-link and must-link is also utilized. To guarantee that the latent similarity subspace to be discriminative, the global and local structures of the data as well as structural consistencies for limited labels in a semi-supervised manner are learned simultaneously in the proposed framework. An effective alternating iterative algorithm is proposed with proved convergence. Experiments conducted on six benchmark datasets show that better results can be obtained compared with state-of-the-art methods. (C) 2021 Elsevier B.V. All rights reserved.
Keywords:
Structured subspace learning (SSL)
Symmetric NMF (SNMF)
Semi-supervised clustering
Alternating iterative algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.