Kulyukin, V.A.; Settle, A.: Ranked retrieval with semantic networks and vector spaces (2001)
0.01
0.0063011474 = product of:
0.015752869 = sum of:
0.009437811 = weight(_text_:a in 6934) [ClassicSimilarity], result of:
0.009437811 = score(doc=6934,freq=6.0), product of:
0.053464882 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046368346 = queryNorm
0.17652355 = fieldWeight in 6934, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0625 = fieldNorm(doc=6934)
0.006315058 = product of:
0.012630116 = sum of:
0.012630116 = weight(_text_:information in 6934) [ClassicSimilarity], result of:
0.012630116 = score(doc=6934,freq=2.0), product of:
0.08139861 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046368346 = queryNorm
0.1551638 = fieldWeight in 6934, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=6934)
0.5 = coord(1/2)
0.4 = coord(2/5)
- Abstract
- The equivalence of semantic networks with spreading activation and vector spaces with dot product is investigated under ranked retrieval. Semantic networks are viewed as networks of concepts organized in terms of abstraction and packaging relations. It is shown that the two models can be effectively constructed from each other. A formal method is suggested to analyze the models in terms of their relative performance in the same universe of objects
- Source
- Journal of the American Society for Information Science and technology. 52(2001) no.14, S.1224-1233
- Type
- a
