Graph regularized nonnegative matrix factorization with sparse coding
Summary: In this paper, we propose a sparseness constraint NMF method, named graph regularized matrix factorization with sparse coding (GRNMF\(\_\)SC). By combining manifold learning and sparse coding techniques together, GRNMF\(\_\)SC can efficiently extract the basic vectors from the data space, which preserves the intrinsic manifold structure and also the local features of original data. The target function of our method is easy to propose, while the solving procedures are really nontrivial; in the paper we gave the detailed derivation of solving the target function and also a strict proof of its convergence, which is a key contribution of the paper. Compared with sparseness constrained NMF and GNMF algorithms, GRNMF\(\_\)SC can learn much sparser representation of the data and can also preserve the geometrical structure of the data, which endow it with powerful discriminating ability. Furthermore, the GRNMF\(\_\)SC is generalized as supervised and unsupervised models to meet different demands. Experimental results demonstrate encouraging results of GRNMF\(\_\)SC on image recognition and clustering when comparing with the other state-of-the-art NMF methods.
- Convex nonnegative matrix factorization with manifold regularization
- Multiple graph regularized nonnegative matrix factorization
- Rank-constrained nonnegative matrix factorization for data representation
- \(L_{3/2}\) regularized graph non-negative matrix factorization
- scientific article; zbMATH DE number 6795656
- Learning the parts of objects by non-negative matrix factorization
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- Nonnegative Local Coordinate Factorization for Image Representation
- Graph sparse nonnegative matrix factorization algorithm based on the inertial projection neural network
- Rank-constrained nonnegative matrix factorization for data representation
- Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing
- SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding
- Large Scale Graph Regularized Non-Negative Matrix Factorization With ${\cal \ell}_1$ Normalization Based on Kullback–Leibler Divergence
- Feature re-factorization-based data sparse representation
- \(L_{3/2}\) regularized graph non-negative matrix factorization
- Graph Regularized Sparse Coding for Image Representation
- Improving nonnegative matrix factorization with advanced graph regularization
- Theoretical guarantees for graph sparse coding
- Multiple graph regularized nonnegative matrix factorization
This page was built for publication: Graph regularized nonnegative matrix factorization with sparse coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665056)
