Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering
DOI10.1007/S10915-021-01489-WzbMATH Open1466.62359OpenAlexW3155437292MaRDI QIDQ831249FDOQ831249
Authors: Jiayi Tang, Zhong Wan 
Publication date: 11 May 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-021-01489-w
Recommendations
- Graph dual regularization non-negative matrix factorization for co-clustering
- Constrained dual graph regularized orthogonal nonnegative matrix tri-factorization for co-clustering
- Robust graph regularized nonnegative matrix factorization for clustering
- Simultaneous method of orthogonal non-metric non-negative matrix factorization and constrained non-hierarchical clustering
- Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering
- Multiple graph regularized nonnegative matrix factorization
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22) Factorization of matrices (15A23)
Cites Work
- Principal component analysis: a review and recent developments
- The Geometry of Algorithms with Orthogonality Constraints
- On the equivalence between non-negative matrix factorization and probabilistic latent semantic indexing
- Non-negative matrix factorization with sparseness constraints
- A Multilinear Singular Value Decomposition
- Learning the parts of objects by non-negative matrix factorization
- Graph dual regularization non-negative matrix factorization for co-clustering
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- A modified spectral PRP conjugate gradient projection method for solving large-scale monotone equations and its application in compressed sensing
- Orthogonal nonnegative matrix tri-factorization based on Tweedie distributions
- Low-rank nonnegative matrix factorization on Stiefel manifold
- NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS
Cited In (5)
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- Graph dual regularization non-negative matrix factorization for co-clustering
- An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering
- Robust local-coordinate non-negative matrix factorization with adaptive graph for robust clustering
This page was built for publication: Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831249)
