Robust local-coordinate non-negative matrix factorization with adaptive graph for robust clustering
From MaRDI portal
Recommendations
- Robust graph regularized nonnegative matrix factorization for clustering
- Robust clustering with adaptive order graph learning
- Robust semisupervised nonnegative local coordinate factorization for data representation
- Robust distribution-based nonnegative matrix factorizations for dimensionality reduction
- Robust structure preserving nonnegative matrix factorization for dimensionality reduction
Cites work
- A novel graph clustering method with a greedy heuristic search algorithm for mining protein complexes from dynamic and static PPI networks
- Kernel truncated regression representation for robust subspace clustering
- Learning the parts of objects by non-negative matrix factorization
- Low-rank nonnegative matrix factorization on Stiefel manifold
- Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering
Cited in
(4)- Robust clustering with adaptive order graph learning
- Hypergraph-based convex semi-supervised unconstraint symmetric matrix factorization for image clustering
- Robust asymmetric non-negative matrix factorization for clustering nodes in directed networks
- A robust unsupervised feature selection based on subspace learning and adaptive graph structure
This page was built for publication: Robust local-coordinate non-negative matrix factorization with adaptive graph for robust clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122299)
