An effective initialization for orthogonal nonnegative matrix factorization
From MaRDI portal
Recommendations
- Lanczos bidiagonalization: a fast start for nonnegative matrix factorization
- Initialization of nonnegative matrix factorization based on Monte Carlo method
- SVD based initialization: A head start for nonnegative matrix factorization
- The extended algorithm for the initial selection of non-negative matrix factorization
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
Cited in
(9)- SVD based initialization: A head start for nonnegative matrix factorization
- A column-wise update algorithm for nonnegative matrix factorization in Bregman divergence with an orthogonal constraint
- The extended algorithm for the initial selection of non-negative matrix factorization
- Initialization of nonnegative matrix factorization based on Monte Carlo method
- Lanczos bidiagonalization: a fast start for nonnegative matrix factorization
- Subtractive clustering for seeding non-negative matrix factorizations
- Randomized algorithms for orthogonal nonnegative matrix factorization
- Two efficient algorithms for orthogonal nonnegative matrix factorization
- Accelerated SVD-based initialization for nonnegative matrix factorization
This page was built for publication: An effective initialization for orthogonal nonnegative matrix factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4900523)