Indexing by latent semantic analysis (1990)
Cached
Download Links
- [www.cs.bham.ac.uk]
- [ssrc.cse.ucsc.edu]
- [www.si.umich.edu]
- [www.stat.cmu.edu]
- [www.kibazen.com]
- [www.aifb.uni-karlsruhe.de]
- [www.cis.temple.edu]
- [www.scils.rutgers.edu]
- [superbook.bellcore.com]
- [lsa.colorado.edu]
- [lsi.argreenhouse.com]
- [lsi.research.telcordia.com]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE |
| Citations: | 2168 - 30 self |
BibTeX
@ARTICLE{Deerwester90indexingby,
author = {Scott Deerwester and Susan T. Dumais and George W. Furnas and Thomas K. Landauer and Richard Harshman},
title = {Indexing by latent semantic analysis},
journal = {JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE},
year = {1990},
volume = {41},
number = {6},
pages = {391--407}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (“semantic structure”) in order to improve the detection of relevant documents on the basis of terms found in queries. The particular technique used is singular-value decomposition, in which a large term by document matrix is decomposed into a set of ca. 100 or-thogonal factors from which the original matrix can be approximated by linear combination. Documents are represented by ca. 100 item vectors of factor weights. Queries are represented as pseudo-document vectors formed from weighted combinations of terms, and documents with supra-threshold cosine values are re-turned. initial tests find this completely automatic method for retrieval to be promising.
