Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

@article{Drineas2006FastMC,
  title={Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix},
  author={Petros Drineas and Ravi Kannan and Michael W. Mahoney},
  journal={SIAM J. Comput.},
  year={2006},
  volume={36},
  pages={158-183}
}
In many applications, the data consist of (or may be naturally formulated as) an m×n matrix A. It is often of interest to find a low-rank approximation to A, i.e., an approximation D to the matrix A of rank not greater than a specified rank k, where k is much smaller than m and n. Methods such as the singular value decomposition (SVD) may be used to find an approximation to A which is the best in a well-defined sense. These methods require memory and time which are superlinear in m and n; for… CONTINUE READING
Highly Influential
This paper has highly influenced 42 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 472 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 279 extracted citations

472 Citations

0204060'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 472 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

  • P. Drineas, R. Kannan, M. W. Mahoney
  • Tech. Report YALEU/DCS/TR-1270, Department of…
  • 2004
1 Excerpt

The Complexity of Massive Data Set Computations

  • Z. Bar-Yossef
  • Ph.D. thesis, University of California, Berkeley
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…