.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Non-negative matrix factorization
Semi-supervised learning
Laplacian matrix
Clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Revisiting the effectiveness of economic sanctions in the context of Russia’s invasion of Ukraine
PREAI
分享收藏分享收藏Graph dual regularization non-negative matrix factorization for co-clustering用于联合聚类的图对偶正则化非负矩阵分解.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容