Harter, S.P.; Cheng, Y.-R.: Colinked descriptors : improving vocabulary selection for end-user searching (1996)
0.02
0.023243874 = product of:
0.06973162 = sum of:
0.06973162 = weight(_text_:search in 4216) [ClassicSimilarity], result of:
0.06973162 = score(doc=4216,freq=6.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.39907667 = fieldWeight in 4216, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=4216)
0.33333334 = coord(1/3)
- Abstract
- This article introduces a new concept and technique for information retrieval called 'colinked descriptors'. Borrowed from an analogous idea in bibliometrics - cocited references - colinked descriptors provide a theory and method for identifying search terms that, by hypothesis, will be superior to those entered initially by a searcher. The theory suggests a means of moving automatically from 2 or more initial search terms, to other terms that should be superior in retrieval performance to the 2 original terms. A research project designed to test this colinked descriptor hypothesis is reported. The results suggest that the approach is effective, although methodological problems in testing the idea are reported. Algorithms to generate colinked descriptors can be incorporated easily into system interfaces, front-end or pre-search systems, or help software, in any database that employs a thesaurus. The potential use of colinked descriptors is a strong argument for building richer and more complex thesauri that reflect as many legitimate links among descriptors as possible
