Hoenkamp, E.: Unitary operators on the document space (2003)
0.01
0.011609698 = product of:
0.03482909 = sum of:
0.03482909 = product of:
0.06965818 = sum of:
0.06965818 = weight(_text_:indexing in 3457) [ClassicSimilarity], result of:
0.06965818 = score(doc=3457,freq=6.0), product of:
0.19018644 = queryWeight, product of:
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.049684696 = queryNorm
0.3662626 = fieldWeight in 3457, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.8278677 = idf(docFreq=2614, maxDocs=44218)
0.0390625 = fieldNorm(doc=3457)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- When people search for documents, they eventually want content, not words. Hence, search engines should relate documents more by their underlying concepts than by the words they contain. One promising technique to do so is Latent Semantic Indexing (LSI). LSI dramatically reduces the dimension of the document space by mapping it into a space spanned by conceptual indices. Empirically, the number of concepts that can represent the documents are far fewer than the great variety of words in the textual representation. Although this almost obviates the problem of lexical matching, the mapping incurs a high computational cost compared to document parsing, indexing, query matching, and updating. This article accomplishes several things. First, it shows how the technique underlying LSI is just one example of a unitary operator, for which there are computationally more attractive alternatives. Second, it proposes the Haar transform as such an alternative, as it is memory efficient, and can be computed in linear to sublinear time. Third, it generalizes LSI by a multiresolution representation of the document space. The approach not only preserves the advantages of LSI at drastically reduced computational costs, it also opens a spectrum of possibilities for new research.
- Object
- Latent Semantic Indexing
