CLSI: A flexible approximation scheme from clustered term-document matrices

Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005

Volumn , Issue , 2005, Pages 631-635

  Zeimpekis, Dimitrios ^a   Gallopoulos, Efstratios ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Clustering; Low rank approximations; LSI

Indexed keywords

APPROXIMATION THEORY; DATA MINING;

CLUSTERING; DOCUMENT MATRICES; FLEXIBLE APPROXIMATIONS; LOW RANK APPROXIMATIONS; MATRIX APPROXIMATION; RANK REDUCTION;

MATRIX ALGEBRA;

EID: 33749556153     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972757.75     Document Type: Conference Paper

References (22)

1. D. Achlioptas and F. McSherry, Fast computation of low rank matrix approximations, Proc. 33rd Annual ACM STOC, 2001, pp. 611-618.
2. M.W. Berry, Large scale singular value decomposition, Int. J. Supercomp. Appl. 6 (1992), 13-49.
3. M.W. Berry, S. A. Pulatova, and G. W. Stewart, Computing sparse reduced-rank approximations to sparse matrices, Tech. Rept. No. CS-04-525, Dept. Comput. Sci., Univ. Tennessee, Knoxville, May 2004.
4. V. Castelli, A. Thomasian, and C.-S. Li, CSVD: Clustering and singular value decomposition for approximate similarity search in high-dimensional spaces, IEEE Trans. Knowl. Data Eng. 15 (2003), no. 3, 671-685.
5. M. Chu and R. Funderlic, The centroid decomposition: Relationships between discrete variational decompositions and SVDs, SIAM J. Matrix Anal. Appl. 23 (2002), no. 4, 1025-1044.
6. I. S. Dhillon and D. S. Modha, Concept decompositions for large sparse text data using clustering, Machine Learning 42 (2001), no. 1, 143-175.
7. P. Drineas, R. Kannan, A. Frieze, S. Vempala, and V. Vinay, Clustering of large graphs via the singular value decomposition, Machine Learning 56 (2004), 9-33.
8. P. Drineas, R. Kannan, and M. Mahoney, Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix, Tech. Report TR-1270, Yale University, Department of Computer Science, February 2004.
9. A. Frieze, R. Kannan, and S. Vempala, Fast Monte-Carlo algorithms for finding low-rank approximations, Proc. 39th Annual Symp. FOCS, ACM, 1998, pp. 370-378.
10. J. Gao and J. Zhang, Clustered SVD strategies in latent semantic indexing, Tech. rept. no. 382-03, Dept. Comput. Science, Univ. Kentucky, Lexington, KY, 2003.
11. L. Guttman, General Theory and Methods for Matrix Factoring, Phychometrica9(1944), 1-16.
12. L. Hubert, J. Meulman, and W. Heiser, Two purposes for matrix factorization: A historical appraisal, SIAM Rev. 42 (2000), no. 1, 68-82.
13. E. Kokiopoulou and Y Saad, Polynomial filtering in latent semantic indexing for information retrieval, Proc. 27th ACM SIGIR (New York), ACM, 2004, pp. 104-111.
14. T. Kolda and D. O'Leary, A semidiscrete matrix decomposition for latent semantic indexing information retrieval, ACM Trans. Inform. Sys. 16 (1998), 322-346.
15. D. D. Lee and H. S. Seung, Algorithms for non-negative matrix factorizations, Advances in Neural Information Processing Systems 13 (2001), 556-562.
16. H. Park and L. Elden, Matrix rank reduction for data analysis and feature extraction, Tech. report, University of Minnesota CSE Tech. Rept., 2003.
17. H. Park, M. Jeon, and J.B. Rosen, Lower dimensional representation of text data based on centroids and least squares, BIT 43-2 (2003), 1-22.
18. G. Salton, C. Yang, and A. Wong, A Vector-Space Model for Automatic Indexing, CACM 18 (1975), no. 11, 613-620.
19. G. W. Stewart, Four algorithms for the efficient computation of truncated pivoted QR approximations to a sparse matrix, Numer. Math. 83 (1999), 313-323.
20. D. Zeimpekis and E. Gallopoulos, TMG: A MATLAB toolbox for generating term-document matrices from text collections, Technical Report, HPCLAB-SCG 1/6-04, Comput. Eng. & Inform. Dept., U. Patras, Greece, June 2004.
21. Z. Zhang and H. Zha, Structure and perturbation analysis of truncated SVD for column-partitioned matrices, SIAM J. Matrix Anal. Appl. 22 (2001), 1245-1262.
22. Z. Zhang, H. Zha, and H. Simon, Low-rank approximations with sparse factors I: Basic algorithms and error analysis, SIAM J. Matrix Anal. Appl. 23 (2002), no. 3, 706-727.