Wilbur, W.J.; Coffee, L.: ¬The effectiveness of document neighboring in search enhancement (1994)
0.00
3.255793E-4 = product of:
0.0048836893 = sum of:
0.0048836893 = product of:
0.009767379 = sum of:
0.009767379 = weight(_text_:information in 7419) [ClassicSimilarity], result of:
0.009767379 = score(doc=7419,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.1920054 = fieldWeight in 7419, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=7419)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- Abstract
- Considers two kinds of queries that may be applied to a database. The first is a query written by a searcher to express an information need. The second is a request for documents most similar to a document already judge relevant by the searcher. Examines the effectiveness of these two procedures and shows that in important cases the latter query types is more effective than the former. This provides a new view of the cluster hypothesis and a justification for document neighbouring procedures. If all the documents in a database have readily available precomputed nearest neighbours, a new search algorithm, called parallel neighbourhood searching. Shows that this feedback-based method provides significant improvement in recall over traditional linear searching methods, and appears superior to traditional feedback methods in overall performance
- Source
- Information processing and management. 30(1994) no.2, S.253-277
