Latent semantic analysis and Fiedler retrieval
From MaRDI portal
Publication:869904
DOI10.1016/J.LAA.2006.09.026zbMATH Open1108.68045OpenAlexW2013161329MaRDI QIDQ869904FDOQ869904
Authors: Bruce A. Hendrickson 
Publication date: 9 March 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.09.026
Recommendations
Cites Work
- ARPACK Users' Guide
- Title not available (Why is that?)
- Title not available (Why is that?)
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Title not available (Why is that?)
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- A review of algebraic multigrid
- Title not available (Why is that?)
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Optimal linear labelings and eigenvalues of graphs
- Using Linear Algebra for Intelligent Information Retrieval
- Matrices, Vector Spaces, and Information Retrieval
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Latent semantic space for web clustering
- Title not available (Why is that?)
- Experiments with LSA scoring: Optimal rank and basis
- Title not available (Why is that?)
- Latent semantic analysis of the languages of life
- The uncovering of hidden structures by latent semantic analysis
- Title not available (Why is that?)
- Fast extraction of semantic features from a latent semantic indexed text corpus
- Taking a new look at the latent semantic analysis approach to information retrieval
Uses Software
This page was built for publication: Latent semantic analysis and Fiedler retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869904)
