Ellipsoidal rounding for nonnegative matrix factorization under noisy separability
From MaRDI portal
Recommendations
- Refinement of Hottopixx method for nonnegative matrix factorization under noisy separability
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Robust near-separable nonnegative matrix factorization using linear optimization
- Computing a nonnegative matrix factorization -- provably
- Computing a nonnegative matrix factorization -- provably
Cited in
(10)- Optimization over a probability simplex
- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
- Enhancing pure-pixel identification performance via preconditioning
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Convex programming based spectral clustering
- Refinement of Hottopixx method for nonnegative matrix factorization under noisy separability
- Assigning topics to documents by successive projections
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
- On the robustness of the successive projection algorithm
This page was built for publication: Ellipsoidal rounding for nonnegative matrix factorization under noisy separability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934020)