Nonnegative Matrix Factorization with Local Similarity Learning
Not on the map. Why?
Abstract (arXiv)
Existing nonnegative matrix factorization methods focus on learning global structure of the data to construct basis and coefficient matrices, which ignores the local structure that commonly exists among data. In this paper, we propose a new type of nonnegative matrix factorization method, which learns local similarity and clustering in a mutually enhancing way. The learned new representation is more representative in that it better reveals inherent geometric property of the data. Nonlinear expansion is given and efficient multiplicative updates are developed with theoretical convergence guarantees. Extensive experimental results have confirmed the effectiveness of the proposed model.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2.
3 papers.
- 2022Hyperspectral Image Denoising Using Non-convex Local Low-rank and Sparse Separation with Spatial-Spectral Total Variation Regularizationcited by 5
- 2021Initialization for Nonnegative Matrix Factorization: a Comprehensive Reviewcited by 4
- 2022Log-based Sparse Nonnegative Matrix Factorization for Data Representationcited by 3
- 2022Log-based Sparse Nonnegative Matrix Factorization for Data Representation22 Apr 2022
- 2022Hyperspectral Image Denoising Using Non-convex Local Low-rank and Sparse Separation with Spatial-Spectral Total Variation Regularization8 Jan 2022
- 2021Initialization for Nonnegative Matrix Factorization: a Comprehensive Review8 Sep 2021