Now showing items 1-3 of 3
Computation and Uses of the Semidiscrete Matrix Decomposition
We derive algorithms for computing a semidiscrete approximation to a matrix in the Frobenius and weighted norms. The approximation is formed as a weighted sum of outer products of vectors whose elements are plus or minus ...
A Semi-Discrete Matrix Decomposition for Latent Semantic Indexing in Information Retrieval
The vast amount of textual information available today is useless unless it can be effectively and efficiently searched. In information retrieval, we wish to match queries with relevant documents. Documents can be ...
Large Latent Semantic Indexing via a Semi-Discrete Matrix Decomposition
With the electronic storage of documents comes the possibility of building search engines that can automatically choose documents relevant to a given set of topics. In information retrieval, we wish to match queries ...