Regularized nonnegative matrix factorization with adaptive local structure learning

doi:10.1016/j.neucom.2019.11.070

Regularized nonnegative matrix factorization with adaptive local structure learning

2020-03-01

56

PRE

AI

DOI：10.1016/j.neucom.2019.11.070

Original

Original request for help

Save

Abstract

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.

Keywords:

Graph regularization

Adaptive local structure learning

Nonnegative matrix factorization

Clustering

Similarity measure

Regularized nonnegative matrix factorization with adaptive local structure learning

Abstract

AI Summary

Journal

Organization