Graph dual regularization non-negative matrix factorization for co-clustering
From MaRDI portal
Recommendations
- Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering
- Constrained dual graph regularized orthogonal nonnegative matrix tri-factorization for co-clustering
- Convex nonnegative matrix factorization with manifold regularization
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- Multiple graph regularized nonnegative matrix factorization
Cites work
- scientific article; zbMATH DE number 5957402 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- Algorithms and applications for approximate nonnegative matrix factorization
- Fast density-weighted low-rank approximation spectral clustering
- Generalized re-weighting local sampling mean discriminant analysis
- Learning the parts of objects by non-negative matrix factorization
- Logarithm bispectrum-based approach to radar range profile for automatic target recognition
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Nonnegative matrix factorization for spectral data analysis
- On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
- Radar HRRP target recognition based on higher order spectra
- Using underapproximations for sparse nonnegative matrix factorization
Cited in
(21)- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering
- Multi-manifold matrix decomposition for data co-clustering
- Robust bilinear factorization with missing and grossly corrupted observations
- Low-rank doubly stochastic matrix decomposition for cluster analysis
- A splitting method for the locality regularized semi-supervised subspace clustering
- Robust graph regularized nonnegative matrix factorization for clustering
- Global discriminative-based nonnegative spectral clustering
- Detecting communities in 2-mode networks via fast nonnegative matrix trifactorization
- A dual reformulation and solution framework for regularized convex clustering problems
- Constrained dual graph regularized orthogonal nonnegative matrix tri-factorization for co-clustering
- Fast semi-supervised clustering with enhanced spectral embedding
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Low-rank nonnegative matrix factorization on Stiefel manifold
- Dual graph-regularized sparse concept factorization for clustering
- Robust sparse coding via self-paced learning for data representation
- Low-rank matrix factorization with multiple hypergraph regularizer
- Multiple graph regularized nonnegative matrix factorization
- Large Scale Graph Regularized Non-Negative Matrix Factorization With ${\cal \ell}_1$ Normalization Based on Kullback–Leibler Divergence
- Multiview clustering via robust neighboring constraint nonnegative matrix factorization
- Improving nonnegative matrix factorization with advanced graph regularization
This page was built for publication: Graph dual regularization non-negative matrix factorization for co-clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408044)
