Chen, H.; Martinez, J.; Kirchhoff, A.; Ng, T.D.; Schatz, B.R.: Alleviating search uncertainty through concept associations : automatic indexing, co-occurence analysis, and parallel computing (1998)
0.01
0.005761182 = product of:
0.017283546 = sum of:
0.017283546 = weight(_text_:to in 5202) [ClassicSimilarity], result of:
0.017283546 = score(doc=5202,freq=6.0), product of:
0.08279609 = queryWeight, product of:
1.818051 = idf(docFreq=19512, maxDocs=44218)
0.045541126 = queryNorm
0.20874833 = fieldWeight in 5202, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.818051 = idf(docFreq=19512, maxDocs=44218)
0.046875 = fieldNorm(doc=5202)
0.33333334 = coord(1/3)
- Abstract
- In this article, we report research on an algorithmic approach to alleviating search uncertainty in a large information space. Grounded on object filtering, automatic indexing, and co-occurence analysis, we performed a large-scale experiment using a parallel supercomputer (SGI Power Challenge) to analyze 400.000+ abstracts in an INSPEC computer engineering collection. Two system-generated thesauri, one based on a combined object filtering and automatic indexing method, and the other based on automatic indexing only, were compaed with the human-generated INSPEC subject thesaurus. Our user evaluation revealed that the system-generated thesauri were better than the INSPEC thesaurus in 'concept recall', but in 'concept precision' the 3 thesauri were comparable. Our analysis also revealed that the terms suggested by the 3 thesauri were complementary and could be used to significantly increase 'variety' in search terms the thereby reduce search uncertainty
