Show simple item record

A Semi-Discrete Matrix Decomposition for Latent Semantic Indexing in Information Retrieval

dc.contributor.authorKolda, Tamara G.en_US
dc.contributor.authorO'Leary, Dianne P.en_US
dc.description.abstractThe 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 represented by the terms that appear within them, but literal matching of terms does not necessarily retrieve all relevant documents. 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). In our tests, for equal query times, the SDD does as well as the SVD and uses less than one-tenth the storage. Additionally, we show how to update the SDD for a dynamically changing document collection. (Also cross-referenced as UMIACS-TR-96-92)en_US
dc.format.extent324501 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3724en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-96-92en_US
dc.titleA Semi-Discrete Matrix Decomposition for Latent Semantic Indexing in Information Retrievalen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record