Bounded matrix low rank approximation
From MaRDI portal
Publication:2807180
DOI10.1007/978-3-662-48331-2_4zbMATH Open1338.65113OpenAlexW4241933935MaRDI QIDQ2807180FDOQ2807180
Authors: Ramakrishnan Kannan, Mariya Ishteva, Barry Drake, Haesun Park
Publication date: 19 May 2016
Published in: Signals and Communication Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48331-2_4
Recommendations
low rank approximationalternating least squaresconvergencesingular value decompositionalgorithmstochastic gradient descent
Cites Work
- Title not available (Why is that?)
- Projected Gradient Methods for Nonnegative Matrix Factorization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Title not available (Why is that?)
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
Cited In (6)
- Structured low rank approximation of a Bezout matrix
- Lower bounds for matrix factorization
- Lower bounds for matrix factorization
- LLORMA: local low-rank matrix approximation
- Low-Rank Matrix Approximation Using Point-Wise Operators
- Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
This page was built for publication: Bounded matrix low rank approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807180)