Latent semantic analysis and Fiedler retrieval

Linear Algebra and Its Applications

Volumn 421, Issue 2-3 SPEC. ISS., 2007, Pages 345-355

  Hendrickson, Bruce ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Eigenvector; Information retrieval; Laplacian matrix; Latent semantic analysis

Indexed keywords

COMPUTATIONAL GEOMETRY; EIGENVALUES AND EIGENFUNCTIONS; LINEAR ALGEBRA; PARAMETER ESTIMATION; SEMANTICS;

LAPLACIAN MATRICES; LATENT SEMANTIC ANALYSIS (LSA); SINGULAR VALUE DECOMPOSITION;

INFORMATION RETRIEVAL;

EID: 33846235190     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.09.026     Document Type: Article

References (21)

1. C.J. Alpert, S.-Z. Yao, Spectral partitioning: the more eigenvectors, the better, in: Proceedings of the Annual ACM Design Automation Conference, 1995, pp. 195-200.
2. Bartell B.T., Cottrell G.W., and Belew R.K. Latent semantic indexing is an optimal special case of multidimensional scaling. Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1992), ACM 161-167
3. Belkin M., and Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15 (2003) 1373-1396
4. Berry M., and Browne M. Understanding Search Engines: Mathematical Modeling and Text Retrieval (1999), SIAM, Philadelphia
5. Berry M., Drmac Z., and Jessup E. Matrices, vector spaces, and information retrieval. SIAM Rev. 41 (1999) 335-362
6. Berry M., Dumais S., and O'Brien G. Using linear algebra for intelligent information retrieval. SIAM Rev. 37 (1995) 573-595
7. M.W. Berry, SVDPACK: A Fortran-77 Software Library for the Sparse Singular Value Decomposition, Tech. Report CS-92-159, University of Tennessee, Knoxville, TN, June 1992.
8. Berry M.W., Hendrickson B., and Raghavan P. Sparse matrix reordering schemes for browsing hypertext. Lectures in Applied Mathematics vol. 32 (1996), AMS 99-123
9. Deerwester S., Dumais S., Furnas G., Landauer T., and Harshman R. Indexing by latent semantic analysis. J. Am. Soc. Inform. Sci. 41 (1990) 391-407
10. Dhillon I.S. Co-clustering documents and words using bipartite spectral graph partitioning. Proceedings of the Seventh International Conference on Knowledge Discovery and Data Mining (2001), ACM
11. Fiedler M. Algebraic connectivity of graphs. Czech. Math. J. 23 (1973) 298-305
12. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J. 25 (1975) 619-633
13. Hendrickson B., and Leland R. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Comput. 16 (1995) 452-469
14. Juvan M., and Mohar B. Optimal linear labelings and eigenvalues of graphs. Discrete Appl. Math. 36 (1992) 153-168
15. T.G. Kolda, B.W. Bader, J.P. Kenny, Higher-order web link analysis using multilinear algebra, in: Proceedings of the IEEE International Conference on Data Mining, November 2005.
16. Lehoucq R.B., Sorensen D.C., and Yang C. ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods (1998), SIAM, Philadelphia, PA
17. Newton M.C., Sykora O., and Vrto I. Two new heuristics for the 2-sided bipartite crossing number. Proceedings of the Tenth International Symposium on Graph Drawing. Lecture Notes in Computer Science 2528 (2002), Springer 312-319
18. Salton G., and McGill M. Introduction to Modern Information Retrieval (1983), McGraw Hill, New York
19. D.A. Spielman, S.-H. Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, in: Proceedings of the ACM Symposium on Theory of Computing (STOC), 2004, pp. 81-90.
20. Stüben K. A review of algebraic multigrid. J. Comput. Appl. Math. 128 (2001) 281-309
21. Zha H., He X., Ding C., Gu M., and Simon H. Bipartite graph partitioning and data clustering. Proceedings of the Tenth International Conference on Information and Knowledge Management (2001), ACM