Shifted Randomized Singular Value Decomposition

11/26/2019
by   Ali Basirat, et al.
12

We extend the randomized singular value decomposition (SVD) algorithm <cit.> to estimate the SVD of a shifted data matrix without explicitly constructing the matrix in the memory. With no loss in the accuracy of the original algorithm, the extended algorithm provides for a more efficient way of matrix factorization. The algorithm facilitates the low-rank approximation and principal component analysis (PCA) of off-center data matrices. When applied to different types of data matrices, our experimental results confirm the advantages of the extensions made to the original algorithm.

READ FULL TEXT
research
11/26/2019

Sifted Randomized Singular Value Decomposition

We extend the randomized singular value decomposition (SVD) algorithm <c...
research
07/15/2019

Out-of-core singular value decomposition

Singular value decomposition (SVD) is a standard matrix factorization te...
research
11/26/2019

Matrix Decompositions and Sparse Graph Regularity

We introduce and study a matrix decomposition that is a common generaliz...
research
08/22/2019

Block Randomized Optimization for Adaptive Hypergraph Learning

The high-order relations between the content in social media sharing pla...
research
05/17/2020

Identification/Segmentation of Indian Regional Languages with Singular Value Decomposition based Feature Embedding

language identification (LID) is identifing a language in a given spoken...
research
12/12/2019

Fast non-convex low-rank matrix decomposition for separation of potential field data using minimal memory

A fast non-convex low-rank matrix decomposition method for potential fie...
research
09/04/2020

Efficient Model-Based Collaborative Filtering with Fast Adaptive PCA

A model-based collaborative filtering (CF) approach utilizing fast adapt...

Please sign up or login with your details

Forgot password? Click here to reset