Graph dual regularization non-negative matrix factorization for co-clustering
DOI10.1016/J.PATCOG.2011.12.015zbMATH Open1234.68356OpenAlexW2036285176MaRDI QIDQ408044FDOQ408044
Licheng Jiao, Fei Wang, Fanhua Shang
Publication date: 28 March 2012
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2011.12.015
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
co-clusteringgraph Laplaciangraph dual regularizationlow-rank matrix factorizationnon-negative matrix factorization (NMF)
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Algorithms and applications for approximate nonnegative matrix factorization
- Learning the parts of objects by non-negative matrix factorization
- On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
- Using underapproximations for sparse nonnegative matrix factorization
- Title not available (Why is that?)
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Logarithm bispectrum-based approach to radar range profile for automatic target recognition
- Nonnegative matrix factorization for spectral data analysis
- Title not available (Why is that?)
- Fast density-weighted low-rank approximation spectral clustering
- Radar HRRP target recognition based on higher order spectra
- Generalized re-weighting local sampling mean discriminant analysis
Cited In (17)
- 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
- 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
- Dual graph-regularized sparse concept factorization for clustering
- Robust sparse coding via self-paced learning for data representation
- 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
Uses Software
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)
