Pages that link to "Item:Q2817794"
From MaRDI portal
The following pages link to Computing a Nonnegative Matrix Factorization---Provably (Q2817794):
Displaying 9 items.
- A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill's global convergence (Q2089877) (← links)
- Exact solutions in low-rank approximation with zeros (Q2669183) (← links)
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms (Q4999395) (← links)
- Provably Robust Blind Source Separation of Linear-Quadratic Near-Separable Mixtures (Q5024389) (← links)
- Extension complexity of low-dimensional polytopes (Q5082401) (← links)
- Nonnegative Matrix Factorization Requires Irrationality (Q5283249) (← links)
- Nonnegative matrix factorization with local similarity learning (Q6081278) (← links)
- Robust machine learning algorithms for text analysis (Q6646164) (← links)
- Multivariate to bivariate reduction for noncommutative polynomial factorization (Q6647758) (← links)
