.png){kind=icon}
.png){kind=icon}
Return
Graph regularized nonnegative matrix factorization with label discrimination for data clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2021.01.064.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Non-negative Matrix Factorization (NMF) is an effective method in multivariate data analysis, such as feature learning, computer vision and pattern recognition. For practical clustering tasks, NMF ignores both the local geometry of data and the discriminative information of different classes. In this paper, we propose a new NMF method under graph and label constraints, named Graph Regularized Nonnegative Matrix Factorization with Label Discrimination (GNMFLD), which attempts to find a compact representation of the data so that further learning tasks can be facilitated. The proposed GNMFLD jointly incorporates a graph regularizer and the prior label information as additional constraints, such that it can effectively enhance the discrimination and the exclusivity of clustering, and improve the clustering performance. Empirical experiments demonstrate the effectiveness of our new algorithm through a set of evaluations based on real-world applications. (c) 2021 Published by Elsevier B.V.
Keywords:
Non-negative matrix factorization
Semi-supervised learning
Laplacian matrix
Clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W