Sciweavers

Share
IPM
2006

A framework for understanding Latent Semantic Indexing (LSI) performance

9 years 1 months ago
A framework for understanding Latent Semantic Indexing (LSI) performance
In this paper we present a theoretical model for understanding the performance of Latent Semantic Indexing (LSI) search and retrieval applications. Many models for understanding LSI have been proposed. Ours is the first to study the values produced by LSI in the term by dimension vectors. The framework presented here is based on term co-occurrence data. We show a strong correlation between second-order term co-occurrence and the values produced by the Singular Value Decomposition (SVD) algorithm that forms the foundation for LSI. We also present a mathematical proof that the SVD algorithm encapsulates term co-occurrence information. Key words: Latent Semantic Indexing, Term Co-occurrence, Singular Value Decomposition, Information Retrieval Theory
April Kontostathis, William M. Pottenger
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where IPM
Authors April Kontostathis, William M. Pottenger
Comments (0)
books