Generalized low rank approximations of matrices

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 887-894

  Ye, Jieping ^a  

^a University of Minnesota   (United States)

Author keywords

Classification; Matrix approximation; Singular Value Decomposition

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; VECTORS;

CLASSIFICATION; DATA COLLECTION; MATRIX APPROXIMATION; SINGULAR VALUE DECOMPOSITION;

MATRIX ALGEBRA;

EID: 14344249521     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Achlioptas, D., & McSherry, F. (2001). Fast computation of low rank matrix approximations. ACM STOC Conference Proceedings (pp. 611-618).
2. Aggarwal, C. C. (2001). On the effects of dimensionality reduction on high dimensional similarity search. ACM PODS Conference Proceedings. Santa Barbara, California, USA.
3. Berry, M., Dumais, S., & O'Brie, G. (1995). Using linear algebra for intelligent information retrieval. SIAM Review, 37, 573-595.
4. Castelli, V., Thomasian, A., & Li, C.-S. (2003). CSVD: Clustering and singular value decomposition for approximate similarity searches in high dimensional space. IEEE TKDE, 15, 671-685.
5. Deerwester, S., Dumais, S., Furnas, G., Landauer, T., & Harshman, R. (1990). Indexing by latent semantic analysis. Journal of the Society for Information Scienc, 41, 391-407.
6. Dhillon, I., & Modha, D. (2001). Concept decompositions for large sparse text data using clustering. Machine Learning, 42, 143-175.
7. Drineas, P., Frieze, A., Kannan, R., Vempala, S., & Vinay, V. (1999). Clustering in large graphs and matrices. ACM SODA Conference Proceedings (pp. 291-299).
8. Edelman, A., Arias, T. A., & Smith, S. T. (1998). The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications, 20, 303-353.
9. Frieze, A., Kannan, R., & Vempala, S. (1998). Fast monte-carlo algorithms for finding low-rank approximations. A CM FOCS Conference Proceedings (pp. 370-378).
10. Golub, G. H., & Van Loan, C. F. (1996). Matrix computations. Baltimore, MD, USA: The Johns Hopkins University Press. Third edition.
11. Gu, M., & Eisenstat, S. C. (1993). A fast and stable algorithm for updating the singular value decomposition (Technical Report Technical Report YALEU/DCS/RR-966, Department of Computer Science, Yale University).
12. Kanth, K. V. R., Agrawal, D., Abbadi, A. E., & Singh, A. (1998). Dimensionality reduction for similarity searching in dynamic databases. ACM SIGMOD Conference Proceedings (pp. 166-176).
13. Kleinberg, J., & Tomkins, A. (1999). Applications of linear algebra in information retrieval and hypertext analysis. ACM PODS Conference Proceedings.
14. Martinez, A., & Benavente, R. (1998). The AR face database (Technical Report CVC Tech. Report No. 24).
15. Sim, T., Baker, S., & Bsat, M. (2002). The CMU pose, illumination, and expression (PIE) database. Proc. 4th Intl. Conf., on FG'02.
16. Srebro, N., & Jaakkola, T. (2003). Weighted low-rank approximations. ICML Conference Proceedings (pp. 720-727).
17. Ye, J., Janardan, R., & Li, Q. (2004). GPCA: An efficient dimension reduction scheme for image compression and retrieval. In submission.