Sciweavers

297 search results - page 2 / 60
» A fast and efficient algorithm for low-rank approximation of...
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 8 months ago
Clustered low rank approximation of graphs in information science applications
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...
Berkant Savas, Inderjit S. Dhillon
ICML
2003
IEEE
14 years 6 months ago
Weighted Low-Rank Approximations
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...
Nathan Srebro, Tommi Jaakkola
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 17 hour ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
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...
Amit Singer, Mihai Cucuringu
TSP
2008
178views more  TSP 2008»
13 years 5 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
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...
Pei Chen
IDEAL
2010
Springer
13 years 2 months ago
Approximating the Covariance Matrix of GMMs with Low-Rank Perturbations
: 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 ...
Malik Magdon-Ismail, Jonathan T. Purnell