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 with relevant documents. Documents can be represented by the terms that appear within them, but literal matching of terms does not necessarily retrieve all relevant documents. There are a number of information retrieval systems based on inexact matches. Latent Semantic Indexing represents documents by approximations and tends to cluster documents on similar topics even if their term profiles are somewhat different. This approximate representation is usually accomplished using a low-rank singular value decomposition (SVD) approximation. In this paper, we use an alternate decomposition, the semi-discrete decomposition (SDD). For equal query times, the SDD does as well as the SVD and uses less than one-tenth the storage for the MEDLINE test set.
PDF and postscript files are preprints from January 1997.
@incollection{KoOl99,
author = {Tamara G. Kolda and Dianne P. O'Leary},
title = {Latent Semantic Indexing Via a Semi-discrete Matrix Decomposition},
booktitle = {The Mathematics of Information Coding, Extraction and Distribution},
editor = {G. Cybenko and Dianne P. O'Leary and Jorma Rissanen},
series = {IMA Volumes in Mathematics and Its Applications},
volume = {107},
publisher = {Springer New York},
pages = {73--80},
year = {1999},
doi = {10.1007/978-1-4612-1524-0_5},
}