Deerwester, S.C.; Dumais, S.T.; Landauer, T.K.; Furnas, G.W.; Harshman, R.A.: Indexing by latent semantic analysis (1990)
0.01
0.013931636 = product of:
0.041794907 = sum of:
0.041794907 = product of:
0.083589815 = sum of:
0.083589815 = weight(_text_:indexing in 2399) [ClassicSimilarity], result of:
0.083589815 = score(doc=2399,freq=6.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.4395151 = fieldWeight in 2399, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.046875 = fieldNorm(doc=2399)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- 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 orthogonal 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 returned. Initial tests find this completely automatic method for retrieval to be promising.
- Object
- Latent Semantic Indexing
