.png){kind=icon}
返回
Regularized nonnegative matrix factorization with adaptive local structure learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2019.11.070.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Due to the effectiveness of Nonnegative Matrix Factorization (NMF) and its graph regularized extensions, these methods have been received much attention from various researchers. Generally, these methods are performed in two separate steps including Laplacian graph construction and the subsequent matrix decomposition.However, the similarity measurement for Laplacian graph is challenging since it's often affected by several factors such as the neighborhood size, choice of similarity metric, etc. As a result, the learned graph may be not suitable, let alone the subsequent matrix decomposition. In this paper, we propose adaptive graph regularized NMF. Different from existing methods, the similarity matrix is automatically learned from the data. The proposed model can simultaneously performs matrix decomposition and similarity learning. By balancing the interactions between both of the two subtasks in our model, each subtask is improved iteratively based on the result of another. Experimental results on benchmark data sets illustrate the effectiveness of our model. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Graph regularization
Adaptive local structure learning
Nonnegative matrix factorization
Clustering
Similarity measure
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
暂无机构信息
引用论文
Structure constrained nonnegative matrix factorization for pattern clustering and classification.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏分享收藏分享收藏
查看更多内容