Fast computation of low rank matrix approximations

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 611-618

  Achlioptas, Dimitris ^a   McSherry, Frank ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; PROBABILITY; RANDOM PROCESSES; SAMPLING;

MATRIX APPROXIMATIONS;

COMPUTATION THEORY;

EID: 0034830284     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380858     Document Type: Conference Paper

References (14)

1. Matrices, vector spaces, and information retrieval
2. Using linear algebra for intelligent information retrieval
3. Indexing by latent semantic analysis
4. Clustering in large graphs and matrices
5. Fast monte- carlo algorithms for finding low-rank approximations
6. The eigenvalues of random symmetric matrices
7. On the spectrum of a random graph
8. Authoritative sources in a hyperlinked environment
9. Latent semantic indexing: A probabilistic analysis
10. Eigenfaces for recognition
11. On the distribution of the roots of certain symmetric matrices