In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
: Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d2 elements of the covariance (in d dimensions) is costly and could result ...