.png){kind=icon}
返回
Total Variation Constrained Graph-Regularized Convex Non-Negative Matrix Factorization for Data Representation
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2020.3047576.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a novel NMF algorithm, named Total Variation constrained Graph-regularized Convex Non-negative Matrix Factorization (TV-GCNMF), to incorporate total variation and graph Laplacian with convex NMF. In this model, the feature details of the data are preserved by a diffusion coefficient based on the gradient information. The graph regularization and convex constraints reveal the intrinsic geometry and structure information of the features; thereby, obtaining sparse and parts-based representations. Furthermore, we give the multiplicative update rules and prove convergence of the proposed algorithm. The results of clustering experiments on multiple datasets, under various noise conditions, show the effectiveness and robustness of the proposed method compared to state-of-the-art clustering methods and other related work.
Keyword:
Signal processing algorithms
TV
Symmetric matrices
Linear programming
Convergence
Sparse matrices
Robustness
Total variation (TV)
non-negative matrix factorization (NMF)
data clustering
data representation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
Semi-supervised dimensionality reduction of hyperspectral imagery using pseudo-labels基于伪标签的高光谱图像半监督降维.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏EVALUATION OF FLEXIBLE AND INTERACTIVE TRADEOFF METHOD BASED ON NUMERICAL SIMULATION EXPERIMENTS基于数值模拟实验的柔性交互式权衡方法评价
OAAI
OAAI分享收藏分享收藏
查看更多内容