Accelerated SVD-based initialization for nonnegative matrix factorization
From MaRDI portal
Recommendations
- SVD based initialization: A head start for nonnegative matrix factorization
- Initialization of nonnegative matrix factorization based on Monte Carlo method
- Lanczos bidiagonalization: a fast start for nonnegative matrix factorization
- An effective initialization for orthogonal nonnegative matrix factorization
- The extended algorithm for the initial selection of non-negative matrix factorization
Cites work
- A continuous characterization of the maximum-edge biclique problem
- Adaptive restart for accelerated gradient schemes
- An effective initialization for orthogonal nonnegative matrix factorization
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
- Lectures on convex optimization
- Nonnegative matrix factorization
- Rank-One NMF-Based Initialization for NMF and Relative Error Bounds Under a Geometric Assumption
- SVD based initialization: A head start for nonnegative matrix factorization
This page was built for publication: Accelerated SVD-based initialization for nonnegative matrix factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616157)