-
Bookstein, A.: Informetric distributions : I. Unified overview (1990)
0.02
0.024745772 = product of:
0.049491543 = sum of:
0.049491543 = product of:
0.09898309 = sum of:
0.09898309 = weight(_text_:22 in 6902) [ClassicSimilarity], result of:
0.09898309 = score(doc=6902,freq=2.0), product of:
0.1827397 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.052184064 = queryNorm
0.5416616 = fieldWeight in 6902, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=6902)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 7.2006 18:55:29
-
Bookstein, A.: Informetric distributions : II. Resilience to ambiguity (1990)
0.02
0.024745772 = product of:
0.049491543 = sum of:
0.049491543 = product of:
0.09898309 = sum of:
0.09898309 = weight(_text_:22 in 4689) [ClassicSimilarity], result of:
0.09898309 = score(doc=4689,freq=2.0), product of:
0.1827397 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.052184064 = queryNorm
0.5416616 = fieldWeight in 4689, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.109375 = fieldNorm(doc=4689)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 7.2006 18:55:55
-
Bookstein, A.; Klein, S.T.: Compression, information theory, and grammars : a unified approach (1990)
0.02
0.021780973 = product of:
0.043561947 = sum of:
0.043561947 = product of:
0.08712389 = sum of:
0.08712389 = weight(_text_:systems in 2970) [ClassicSimilarity], result of:
0.08712389 = score(doc=2970,freq=2.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.5432656 = fieldWeight in 2970, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.125 = fieldNorm(doc=2970)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Source
- ACM transaction on information systems. 8(1990), S.27-49
-
Bookstein, A.; Cooper, W.: ¬A general mathematical model for information retrieval systems (1976)
0.02
0.016505018 = product of:
0.033010036 = sum of:
0.033010036 = product of:
0.06602007 = sum of:
0.06602007 = weight(_text_:systems in 5461) [ClassicSimilarity], result of:
0.06602007 = score(doc=5461,freq=6.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.41167158 = fieldWeight in 5461, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0546875 = fieldNorm(doc=5461)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- This paper presents a mathematical model of an information retrieval system thought to be general enough to serve as an abstract representation of most document and reference retrieval systems. The model is made up of four components that, in one form or another, appear in every functioning system. It is proved that the basic organization of documents that the system provides for a user on receipt of a request follows from the properties and interrelations of the four components. Each component is then discussed in turn and it is seen that much of the existing theory regarding information systems can be viewed as an elaboration of this model
-
Bookstein, A.: Fuzzy requests : an approach to weighted Boolean searches (1979)
0.02
0.015401474 = product of:
0.030802948 = sum of:
0.030802948 = product of:
0.061605897 = sum of:
0.061605897 = weight(_text_:systems in 5504) [ClassicSimilarity], result of:
0.061605897 = score(doc=5504,freq=4.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.38414678 = fieldWeight in 5504, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0625 = fieldNorm(doc=5504)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- This article concerns the problem of how to permit a patron tp represent the relatice importance of various index terms in a Boolean request while retaining the desirable properties of a Boolean system. The character of classical Boolean systems is reviewed and related to the notion of fuzzy sets. The fuzzy set concept then forms the basis of the concept of a fuzzy request in which weights are assigned to index terms. The properties of such a system are discussed, and it is shown that such systems retain the manipulability of traditional Boolena requests
-
Bookstein, A.; Klein, S.T.; Raita, T.: Clumping properties of content-bearing words (1998)
0.01
0.009529176 = product of:
0.019058352 = sum of:
0.019058352 = product of:
0.038116705 = sum of:
0.038116705 = weight(_text_:systems in 442) [ClassicSimilarity], result of:
0.038116705 = score(doc=442,freq=2.0), product of:
0.16037072 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.052184064 = queryNorm
0.23767869 = fieldWeight in 442, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0546875 = fieldNorm(doc=442)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Information Retrieval Systems identify content bearing words, and possibly also assign weights, as part of the process of formulating requests. For optimal retrieval efficiency, it is desirable that this be done automatically. This article defines the notion of serial clustering of words in text, and explores the value of such clustering as an indicator of a word's bearing content. This approach is flexible in the sense that it is sensitive to context: a term may be assessed as content-bearing within one collection, but not another. Our approach, being numerical, may also be of value in assigning weights to terms in requests. Experimental support is obtained from natural text databases in three different languages
