On the robustness of the successive projection algorithm
From MaRDI portal
Cites work
- A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
- Ellipsoidal rounding for nonnegative matrix factorization under noisy separability
- Enhancing pure-pixel identification performance via preconditioning
- Estimating Higher-Order Mixed Memberships via the l2,∞ Tensor Perturbation Bound
- Estimating Mixed Memberships With Sharp Eigenvector Deviations
- Finding a latent k–simplex in O* (k · nnz(data)) time via Subset Smoothing
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Learning the parts of objects by non-negative matrix factorization
- Mixed Membership Estimation for Social Networks
- On the set of solutions of the nonnegative matrix factorization problem
- Probabilistic simplex component analysis
- Refinement of Hottopixx method for nonnegative matrix factorization under noisy separability
- Robust near-separable nonnegative matrix factorization using linear optimization
- Robust principal component analysis?
- Robustness analysis of Hottopixx, a linear programming model for factoring nonnegative matrices
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms
- Smoothed separable nonnegative matrix factorization
- Successive nonnegative projection algorithm for robust nonnegative blind source separation
This page was built for publication: On the robustness of the successive projection algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6917929)
