Low-rank approximation algorithm using sparse projection and its applications
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 549935 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A random sampling algorithm for fully-connected tensor network decomposition with applications
- A randomised iterative method for solving factorised linear systems
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- A randomized algorithm for principal component analysis
- A sparse Johnson-Lindenstrauss transform
- Accelerated SVD-based initialization for nonnegative matrix factorization
- Alternating projection methods.
- An efficient algorithm for computing the approximate t-URV and its applications
- Finding frequent items in data streams
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
- Learning the parts of objects by non-negative matrix factorization
- Low-rank Tucker approximation of a tensor from streaming data
- Low-rank approximation and regression in input sparsity time
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Lower bounds for oblivious subspace embeddings
- New backward error bounds of Rayleigh–Ritz projection methods for quadratic eigenvalue problem
- Nonnegative low rank matrix approximation for nonnegative matrices
- Nonnegative low rank tensor approximations with multidimensional image applications
- Nonnegative tensor train for the multicomponent Smoluchowski equation
- OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings
- On local convergence of the method of alternating projections
- On perturbations for spectrum and singular value decompositions followed by deflation techniques
- Pass-efficient truncated UTV for low-rank approximations
- Practical sketching algorithms for low-rank matrix approximation
- Randomized LU decomposition
- Randomized LU decomposition using sparse projections
- Randomized QLP decomposition
- Randomized QR with column pivoting
- Randomized SVD methods in hyperspectral imaging
- Sketching for a low-rank nonnegative matrix approximation: numerical study
- Solving the quadratic eigenvalue problem expressed in non-monomial bases by the tropical scaling
- Sparser Johnson-Lindenstrauss transforms
- Streaming Tensor Train Approximation
- Subspace Iteration Randomization and Singular Value Problems
- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
- Tabulation based 4-universal hashing with applications to second moment estimation
- Tensor-train decomposition
- Why Are Big Data Matrices Approximately Low Rank?
This page was built for publication: Low-rank approximation algorithm using sparse projection and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6990083)
