Ranky : An Approach to Solve Distributed SVD on Large Sparse Matrices

09/21/2020
by   Resul Tugay, et al.
0

Singular Value Decomposition (SVD) is a well studied research topic in many fields and applications from data mining to image processing. Data arising from these applications can be represented as a matrix where it is large and sparse. Most existing algorithms are used to calculate singular values, left and right singular vectors of a large-dense matrix but not large and sparse matrix. Even if they can find SVD of a large matrix, calculation of large-dense matrix has high time complexity due to sequential algorithms. Distributed approaches are proposed for computing SVD of large matrices. However, rank of the matrix is still being a problem when solving SVD with these distributed algorithms. In this paper we propose Ranky, set of methods to solve rank problem on large and sparse matrices in a distributed manner. Experimental results show that the Ranky approach recovers singular values, singular left and right vectors of a given large and sparse matrix with negligible error.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/06/2020

Randomized Quaternion Singular Value Decomposition for Low-Rank Approximation

Quaternion matrix approximation problems construct the approximated matr...
04/03/2021

Convergence Analysis of the Rank-Restricted Soft SVD Algorithm

The soft SVD is a robust matrix decomposition algorithm and a key compon...
03/10/2020

Error Estimation for Sketched SVD via the Bootstrap

In order to compute fast approximations to the singular value decomposit...
03/24/2021

On the ℓ^∞-norms of the Singular Vectors of Arbitrary Powers of a Difference Matrix with Applications to Sigma-Delta Quantization

Let A _max := max_i,j |A_i,j| denote the maximum magnitude of entries of...
11/29/2012

SVD Based Image Processing Applications: State of The Art, Contributions and Research Challenges

Singular Value Decomposition (SVD) has recently emerged as a new paradig...
10/25/2021

Fast estimation method for rank of a high-dimensional sparse matrix

Numerical computing the rank of a matrix is a fundamental problem in sci...
08/16/2016

A Geometrical Approach to Topic Model Estimation

In the probabilistic topic models, the quantity of interest---a low-rank...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.