Kwok, K.L.: ¬A network approach to probabilistic information retrieval (1995)
0.03
0.029989695 = product of:
0.08996908 = sum of:
0.08996908 = product of:
0.13495362 = sum of:
0.0992141 = weight(_text_:network in 5696) [ClassicSimilarity], result of:
0.0992141 = score(doc=5696,freq=6.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.51133573 = fieldWeight in 5696, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.046875 = fieldNorm(doc=5696)
0.035739526 = weight(_text_:29 in 5696) [ClassicSimilarity], result of:
0.035739526 = score(doc=5696,freq=2.0), product of:
0.15326229 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.043569047 = queryNorm
0.23319192 = fieldWeight in 5696, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.046875 = fieldNorm(doc=5696)
0.6666667 = coord(2/3)
0.33333334 = coord(1/3)
- Abstract
- Shows how probabilistic information retrieval based on document components may be implemented as a feedforward (feedbackward) artificial neural network. The network supports adaptation of connection weights as well as the growing of new edges between queries and terms based on user relevance feedback data for training, and it reflects query modification and expansion in information retrieval. A learning rule is applied that can also be viewed as supporting sequential learning using a harmonic sequence learning rate. Experimental results with 4 standard small collections and a large Wall Street Journal collection show that small query expansion levels of about 30 terms can achieve most of the gains at the low-recall high-precision region, while larger expansion levels continue to provide gains at the high-recall low-precision region of a precision recall curve
- Date
- 29. 1.1996 18:42:14
