-
Joss, M.W.; Wszola, S.: ¬The engines that can : text search and retrieval software, their strategies, and vendors (1996)
0.08
0.084378034 = product of:
0.2531341 = sum of:
0.015556021 = weight(_text_:of in 5123) [ClassicSimilarity], result of:
0.015556021 = score(doc=5123,freq=12.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.25392252 = fieldWeight in 5123, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.08174701 = weight(_text_:software in 5123) [ClassicSimilarity], result of:
0.08174701 = score(doc=5123,freq=8.0), product of:
0.15541996 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.03917671 = queryNorm
0.525975 = fieldWeight in 5123, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.15583107 = sum of:
0.123983644 = weight(_text_:packages in 5123) [ClassicSimilarity], result of:
0.123983644 = score(doc=5123,freq=2.0), product of:
0.2706874 = queryWeight, product of:
6.9093957 = idf(docFreq=119, maxDocs=44218)
0.03917671 = queryNorm
0.45803255 = fieldWeight in 5123, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
6.9093957 = idf(docFreq=119, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.031847417 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
0.031847417 = score(doc=5123,freq=2.0), product of:
0.13719016 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03917671 = queryNorm
0.23214069 = fieldWeight in 5123, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=5123)
0.33333334 = coord(3/9)
- Abstract
- Traces the development of text searching and retrieval software designed to cope with the increasing demands made by the storage and handling of large amounts of data, recorded on high data storage media, from CD-ROM to multi gigabyte storage media and online information services, with particular reference to the need to cope with graphics as well as conventional ASCII text. Includes details of: Boolean searching, fuzzy searching and matching; relevance ranking; proximity searching and improved strategies for dealing with text searching in very large databases. Concludes that the best searching tools for CD-ROM publishers are those optimized for searching and retrieval on CD-ROM. CD-ROM drives have relatively lower random seek times than hard discs and so the software most appropriate to the medium is that which can effectively arrange the indexes and text on the CD-ROM to avoid continuous random access searching. Lists and reviews a selection of software packages designed to achieve the sort of results required for rapid CD-ROM searching
- Date
- 12. 9.1996 13:56:22
-
Srinivasan, P.: Intelligent information retrieval using rough set approximations (1989)
0.04
0.04087495 = product of:
0.122624844 = sum of:
0.05872617 = weight(_text_:applications in 2526) [ClassicSimilarity], result of:
0.05872617 = score(doc=2526,freq=2.0), product of:
0.17247584 = queryWeight, product of:
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.03917671 = queryNorm
0.34048924 = fieldWeight in 2526, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.0546875 = fieldNorm(doc=2526)
0.023429861 = weight(_text_:of in 2526) [ClassicSimilarity], result of:
0.023429861 = score(doc=2526,freq=20.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.38244802 = fieldWeight in 2526, product of:
4.472136 = tf(freq=20.0), with freq of:
20.0 = termFreq=20.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0546875 = fieldNorm(doc=2526)
0.04046881 = weight(_text_:systems in 2526) [ClassicSimilarity], result of:
0.04046881 = score(doc=2526,freq=4.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.33612844 = fieldWeight in 2526, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0546875 = fieldNorm(doc=2526)
0.33333334 = coord(3/9)
- Abstract
- The theory of rough sets was introduced in 1982. It allows the classification of objects into sets of equivalent members based on their attributes. Any combination of the same objetcts (or even their attributes) may be examined using the resultant classification. The theory has direct applications in the design and evaluation of classification schemes and the selection of discriminating attributes. Introductory papers discuss its application in the domain of medical diagnostic systems and the design of information retrieval systems accessing collections of documents. Advantages offered by the theory are: the implicit inclusion of Boolean logic; term weighting; and the ability to rank retrieved documents.
-
Wong, S.K.M.: On modelling information retrieval with probabilistic inference (1995)
0.04
0.038161904 = product of:
0.11448571 = sum of:
0.06711562 = weight(_text_:applications in 1938) [ClassicSimilarity], result of:
0.06711562 = score(doc=1938,freq=2.0), product of:
0.17247584 = queryWeight, product of:
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.03917671 = queryNorm
0.38913056 = fieldWeight in 1938, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.0625 = fieldNorm(doc=1938)
0.014666359 = weight(_text_:of in 1938) [ClassicSimilarity], result of:
0.014666359 = score(doc=1938,freq=6.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.23940048 = fieldWeight in 1938, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0625 = fieldNorm(doc=1938)
0.03270373 = weight(_text_:systems in 1938) [ClassicSimilarity], result of:
0.03270373 = score(doc=1938,freq=2.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.2716328 = fieldWeight in 1938, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0625 = fieldNorm(doc=1938)
0.33333334 = coord(3/9)
- Abstract
- Examines and extends the logical models of information retrieval in the context of probability theory and extends the applications of these fundamental ideas to term weighting and relevance. Develops a unified framework for modelling the retrieval process with probabilistic inference to provide a common conceptual and mathematical basis for many retrieval models, such as Boolean, fuzzy sets, vector space, and conventional probabilistic models. Employs this framework to identify the underlying assumptions by each model and analyzes the inherent relationships between them. Although the treatment is primarily theoretical, practical methods for rstimating the required probabilities are provided by simple examples
- Source
- ACM transactions on information systems. 13(1995) no.1, S.38-68
-
Faloutsos, C.: Signature files (1992)
0.03
0.034337863 = product of:
0.10301359 = sum of:
0.06711562 = weight(_text_:applications in 3499) [ClassicSimilarity], result of:
0.06711562 = score(doc=3499,freq=2.0), product of:
0.17247584 = queryWeight, product of:
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.03917671 = queryNorm
0.38913056 = fieldWeight in 3499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.0625 = fieldNorm(doc=3499)
0.014666359 = weight(_text_:of in 3499) [ClassicSimilarity], result of:
0.014666359 = score(doc=3499,freq=6.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.23940048 = fieldWeight in 3499, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0625 = fieldNorm(doc=3499)
0.021231614 = product of:
0.042463228 = sum of:
0.042463228 = weight(_text_:22 in 3499) [ClassicSimilarity], result of:
0.042463228 = score(doc=3499,freq=2.0), product of:
0.13719016 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03917671 = queryNorm
0.30952093 = fieldWeight in 3499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=3499)
0.5 = coord(1/2)
0.33333334 = coord(3/9)
- Abstract
- Presents a survey and discussion on signature-based text retrieval methods. It describes the main idea behind the signature approach and its advantages over other text retrieval methods, it provides a classification of the signature methods that have appeared in the literature, it describes the main representatives of each class, together with the relative advantages and drawbacks, and it gives a list of applications as well as commercial or university prototypes that use the signature approach
- Date
- 7. 5.1999 15:22:48
-
Kantor, P.; Kim, M.H.; Ibraev, U.; Atasoy, K.: Estimating the number of relevant documents in enormous collections (1999)
0.03
0.032839723 = product of:
0.09851916 = sum of:
0.041947264 = weight(_text_:applications in 6690) [ClassicSimilarity], result of:
0.041947264 = score(doc=6690,freq=2.0), product of:
0.17247584 = queryWeight, product of:
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.03917671 = queryNorm
0.2432066 = fieldWeight in 6690, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.0390625 = fieldNorm(doc=6690)
0.021169065 = weight(_text_:of in 6690) [ClassicSimilarity], result of:
0.021169065 = score(doc=6690,freq=32.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.34554482 = fieldWeight in 6690, product of:
5.656854 = tf(freq=32.0), with freq of:
32.0 = termFreq=32.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0390625 = fieldNorm(doc=6690)
0.03540283 = weight(_text_:systems in 6690) [ClassicSimilarity], result of:
0.03540283 = score(doc=6690,freq=6.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.29405114 = fieldWeight in 6690, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0390625 = fieldNorm(doc=6690)
0.33333334 = coord(3/9)
- Abstract
- In assessing information retrieval systems, it is important to know not only the precision of the retrieved set, but also to compare the number of retrieved relevant items to the total number of relevant items. For large collections, such as the TREC test collections, or the World Wide Web, it is not possible to enumerate the entire set of relevant documents. If the retrieved documents are evaluated, a variant of the statistical "capture-recapture" method can be used to estimate the total number of relevant documents, providing the several retrieval systems used are sufficiently independent. We show that the underlying signal detection model supporting such an analysis can be extended in two ways. First, assuming that there are two distinct performance characteristics (corresponding to the chance of retrieving a relevant, and retrieving a given non-relevant document), we show that if there are three or more independent systems available it is possible to estimate the number of relevant documents without actually having to decide whether each individual document is relevant. We report applications of this 3-system method to the TREC data, leading to the conclusion that the independence assumptions are not satisfied. We then extend the model to a multi-system, multi-problem model, and show that it is possible to include statistical dependencies of all orders in the model, and determine the number of relevant documents for each of the problems in the set. Application to the TREC setting will be presented
- Series
- Proceedings of the American Society for Information Science; vol.36
- Source
- Knowledge: creation, organization and use. Proceedings of the 62nd Annual Meeting of the American Society for Information Science, 31.10.-4.11.1999. Ed.: L. Woods
-
Keen, M.: Query reformulation in ranked output interaction (1994)
0.03
0.031968117 = product of:
0.09590435 = sum of:
0.01960283 = weight(_text_:of in 1065) [ClassicSimilarity], result of:
0.01960283 = score(doc=1065,freq=14.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.31997898 = fieldWeight in 1065, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0546875 = fieldNorm(doc=1065)
0.028615767 = weight(_text_:systems in 1065) [ClassicSimilarity], result of:
0.028615767 = score(doc=1065,freq=2.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.23767869 = fieldWeight in 1065, 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=1065)
0.047685754 = weight(_text_:software in 1065) [ClassicSimilarity], result of:
0.047685754 = score(doc=1065,freq=2.0), product of:
0.15541996 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.03917671 = queryNorm
0.30681872 = fieldWeight in 1065, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0546875 = fieldNorm(doc=1065)
0.33333334 = coord(3/9)
- Abstract
- Reports on a research project to evaluate and compare Boolean searching and methods of query reformulation using ranked output retrieval. Illustrates the design and operating features of the ranked output system, called ROSE (Ranked Output Search Engine), by means of typical results obtained by searching a database of 1239 records on the subject of cystic fibrosis. Concludes that further work is needed to determine the best reformulation tactics needed to harness the professional searcher's intelligence with that much more limited intelligence provided by the search software
- Source
- Information retrieval: new systems and current research. Proceedings of the 15th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Glasgow 1993. Ed.: Ruben Leon
-
Zhang, W.; Yoshida, T.; Tang, X.: ¬A comparative study of TF*IDF, LSI and multi-words for text classification (2011)
0.03
0.027948596 = product of:
0.08384579 = sum of:
0.050336715 = weight(_text_:applications in 1165) [ClassicSimilarity], result of:
0.050336715 = score(doc=1165,freq=2.0), product of:
0.17247584 = queryWeight, product of:
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.03917671 = queryNorm
0.2918479 = fieldWeight in 1165, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.046875 = fieldNorm(doc=1165)
0.0089812735 = weight(_text_:of in 1165) [ClassicSimilarity], result of:
0.0089812735 = score(doc=1165,freq=4.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.14660224 = fieldWeight in 1165, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.046875 = fieldNorm(doc=1165)
0.0245278 = weight(_text_:systems in 1165) [ClassicSimilarity], result of:
0.0245278 = score(doc=1165,freq=2.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.2037246 = fieldWeight in 1165, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.046875 = fieldNorm(doc=1165)
0.33333334 = coord(3/9)
- Abstract
- One of the main themes in text mining is text representation, which is fundamental and indispensable for text-based intellegent information processing. Generally, text representation inludes two tasks: indexing and weighting. This paper has comparatively studied TF*IDF, LSI and multi-word for text representation. We used a Chinese and an English document collection to respectively evaluate the three methods in information retreival and text categorization. Experimental results have demonstrated that in text categorization, LSI has better performance than other methods in both document collections. Also, LSI has produced the best performance in retrieving English documents. This outcome has shown that LSI has both favorable semantic and statistical quality and is different with the claim that LSI can not produce discriminative power for indexing.
- Source
- Expert-systems with applications. 38(2011) no.3, S.2758-2765
-
González-Ibáñez, R.; Esparza-Villamán, A.; Vargas-Godoy, J.C.; Shah, C.: ¬A comparison of unimodal and multimodal models for implicit detection of relevance in interactive IR (2019)
0.03
0.026646521 = product of:
0.07993956 = sum of:
0.041947264 = weight(_text_:applications in 5417) [ClassicSimilarity], result of:
0.041947264 = score(doc=5417,freq=2.0), product of:
0.17247584 = queryWeight, product of:
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.03917671 = queryNorm
0.2432066 = fieldWeight in 5417, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.0390625 = fieldNorm(doc=5417)
0.017552461 = weight(_text_:of in 5417) [ClassicSimilarity], result of:
0.017552461 = score(doc=5417,freq=22.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.28651062 = fieldWeight in 5417, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0390625 = fieldNorm(doc=5417)
0.020439833 = weight(_text_:systems in 5417) [ClassicSimilarity], result of:
0.020439833 = score(doc=5417,freq=2.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.1697705 = fieldWeight in 5417, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0390625 = fieldNorm(doc=5417)
0.33333334 = coord(3/9)
- Abstract
- Implicit detection of relevance has been approached by many during the last decade. From the use of individual measures to the use of multiple features from different sources (multimodality), studies have shown the feasibility to automatically detect whether a document is relevant. Despite promising results, it is not clear yet to what extent multimodality constitutes an effective approach compared to unimodality. In this article, we hypothesize that it is possible to build unimodal models capable of outperforming multimodal models in the detection of perceived relevance. To test this hypothesis, we conducted three experiments to compare unimodal and multimodal classification models built using a combination of 24 features. Our classification experiments showed that a univariate unimodal model based on the left-click feature supports our hypothesis. On the other hand, our prediction experiment suggests that multimodality slightly improves early classification compared to the best unimodal models. Based on our results, we argue that the feasibility for practical applications of state-of-the-art multimodal approaches may be strongly constrained by technology, cultural, ethical, and legal aspects, in which case unimodality may offer a better alternative today for supporting relevance detection in interactive information retrieval systems.
- Source
- Journal of the Association for Information Science and Technology. 70(2019) no.11, S.1223-1235
-
Losada, D.E.; Barreiro, A.: Emebedding term similarity and inverse document frequency into a logical model of information retrieval (2003)
0.02
0.024289845 = product of:
0.07286953 = sum of:
0.018934188 = weight(_text_:of in 1422) [ClassicSimilarity], result of:
0.018934188 = score(doc=1422,freq=10.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.3090647 = fieldWeight in 1422, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0625 = fieldNorm(doc=1422)
0.03270373 = weight(_text_:systems in 1422) [ClassicSimilarity], result of:
0.03270373 = score(doc=1422,freq=2.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.2716328 = fieldWeight in 1422, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0625 = fieldNorm(doc=1422)
0.021231614 = product of:
0.042463228 = sum of:
0.042463228 = weight(_text_:22 in 1422) [ClassicSimilarity], result of:
0.042463228 = score(doc=1422,freq=2.0), product of:
0.13719016 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03917671 = queryNorm
0.30952093 = fieldWeight in 1422, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=1422)
0.5 = coord(1/2)
0.33333334 = coord(3/9)
- Abstract
- We propose a novel approach to incorporate term similarity and inverse document frequency into a logical model of information retrieval. The ability of the logic to handle expressive representations along with the use of such classical notions are promising characteristics for IR systems. The approach proposed here has been efficiently implemented and experiments against test collections are presented.
- Date
- 22. 3.2003 19:27:23
- Source
- Journal of the American Society for Information Science and technology. 54(2003) no.4, S.285-301
-
Furner, J.: ¬A unifying model of document relatedness for hybrid search engines (2003)
0.02
0.023891404 = product of:
0.07167421 = sum of:
0.021062955 = weight(_text_:of in 2717) [ClassicSimilarity], result of:
0.021062955 = score(doc=2717,freq=22.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.34381276 = fieldWeight in 2717, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.046875 = fieldNorm(doc=2717)
0.034687545 = weight(_text_:systems in 2717) [ClassicSimilarity], result of:
0.034687545 = score(doc=2717,freq=4.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.28811008 = fieldWeight in 2717, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.046875 = fieldNorm(doc=2717)
0.015923709 = product of:
0.031847417 = sum of:
0.031847417 = weight(_text_:22 in 2717) [ClassicSimilarity], result of:
0.031847417 = score(doc=2717,freq=2.0), product of:
0.13719016 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03917671 = queryNorm
0.23214069 = fieldWeight in 2717, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=2717)
0.5 = coord(1/2)
0.33333334 = coord(3/9)
- Abstract
- Previous work an search-engine design has indicated that information-seekers may benefit from being given the opportunity to exploit multiple sources of evidence of document relatedness. Few existing systems, however, give users more than minimal control over the selections that may be made among methods of exploitation. By applying the methods of "document network analysis" (DNA), a unifying, graph-theoretic model of content-, collaboration-, and context-based systems (CCC) may be developed in which the nature of the similarities between types of document relatedness and document ranking are clarified. The usefulness of the approach to system design suggested by this model may be tested by constructing and evaluating a prototype system (UCXtra) that allows searchers to maintain control over the multiple ways in which document collections may be ranked and re-ranked.
- Date
- 11. 9.2004 17:32:22
- Source
- Challenges in knowledge representation and organization for the 21st century: Integration of knowledge across boundaries. Proceedings of the 7th ISKO International Conference Granada, Spain, July 10-13, 2002. Ed.: M. López-Huertas
-
Ravana, S.D.; Rajagopal, P.; Balakrishnan, V.: Ranking retrieval systems using pseudo relevance judgments (2015)
0.02
0.021741673 = product of:
0.06522502 = sum of:
0.017552461 = weight(_text_:of in 2591) [ClassicSimilarity], result of:
0.017552461 = score(doc=2591,freq=22.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.28651062 = fieldWeight in 2591, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0390625 = fieldNorm(doc=2591)
0.02890629 = weight(_text_:systems in 2591) [ClassicSimilarity], result of:
0.02890629 = score(doc=2591,freq=4.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.24009174 = fieldWeight in 2591, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0390625 = fieldNorm(doc=2591)
0.018766273 = product of:
0.037532546 = sum of:
0.037532546 = weight(_text_:22 in 2591) [ClassicSimilarity], result of:
0.037532546 = score(doc=2591,freq=4.0), product of:
0.13719016 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03917671 = queryNorm
0.27358043 = fieldWeight in 2591, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=2591)
0.5 = coord(1/2)
0.33333334 = coord(3/9)
- Abstract
- Purpose In a system-based approach, replicating the web would require large test collections, and judging the relevancy of all documents per topic in creating relevance judgment through human assessors is infeasible. Due to the large amount of documents that requires judgment, there are possible errors introduced by human assessors because of disagreements. The paper aims to discuss these issues. Design/methodology/approach This study explores exponential variation and document ranking methods that generate a reliable set of relevance judgments (pseudo relevance judgments) to reduce human efforts. These methods overcome problems with large amounts of documents for judgment while avoiding human disagreement errors during the judgment process. This study utilizes two key factors: number of occurrences of each document per topic from all the system runs; and document rankings to generate the alternate methods. Findings The effectiveness of the proposed method is evaluated using the correlation coefficient of ranked systems using mean average precision scores between the original Text REtrieval Conference (TREC) relevance judgments and pseudo relevance judgments. The results suggest that the proposed document ranking method with a pool depth of 100 could be a reliable alternative to reduce human effort and disagreement errors involved in generating TREC-like relevance judgments. Originality/value Simple methods proposed in this study show improvement in the correlation coefficient in generating alternate relevance judgment without human assessors while contributing to information retrieval evaluation.
- Date
- 20. 1.2015 18:30:22
18. 9.2018 18:22:56
- Source
- Aslib journal of information management. 67(2015) no.6, S.700-714
-
Shiri, A.A.; Revie, C.: Query expansion behavior within a thesaurus-enhanced search environment : a user-centered evaluation (2006)
0.02
0.021355543 = product of:
0.064066626 = sum of:
0.016735615 = weight(_text_:of in 56) [ClassicSimilarity], result of:
0.016735615 = score(doc=56,freq=20.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.27317715 = fieldWeight in 56, product of:
4.472136 = tf(freq=20.0), with freq of:
20.0 = termFreq=20.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0390625 = fieldNorm(doc=56)
0.034061253 = weight(_text_:software in 56) [ClassicSimilarity], result of:
0.034061253 = score(doc=56,freq=2.0), product of:
0.15541996 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.03917671 = queryNorm
0.21915624 = fieldWeight in 56, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0390625 = fieldNorm(doc=56)
0.013269759 = product of:
0.026539518 = sum of:
0.026539518 = weight(_text_:22 in 56) [ClassicSimilarity], result of:
0.026539518 = score(doc=56,freq=2.0), product of:
0.13719016 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03917671 = queryNorm
0.19345059 = fieldWeight in 56, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=56)
0.5 = coord(1/2)
0.33333334 = coord(3/9)
- Abstract
- The study reported here investigated the query expansion behavior of end-users interacting with a thesaurus-enhanced search system on the Web. Two groups, namely academic staff and postgraduate students, were recruited into this study. Data were collected from 90 searches performed by 30 users using the OVID interface to the CAB abstracts database. Data-gathering techniques included questionnaires, screen capturing software, and interviews. The results presented here relate to issues of search-topic and search-term characteristics, number and types of expanded queries, usefulness of thesaurus terms, and behavioral differences between academic staff and postgraduate students in their interaction. The key conclusions drawn were that (a) academic staff chose more narrow and synonymous terms than did postgraduate students, who generally selected broader and related terms; (b) topic complexity affected users' interaction with the thesaurus in that complex topics required more query expansion and search term selection; (c) users' prior topic-search experience appeared to have a significant effect on their selection and evaluation of thesaurus terms; (d) in 50% of the searches where additional terms were suggested from the thesaurus, users stated that they had not been aware of the terms at the beginning of the search; this observation was particularly noticeable in the case of postgraduate students.
- Date
- 22. 7.2006 16:32:43
- Source
- Journal of the American Society for Information Science and Technology. 57(2006) no.4, S.462-478
-
Kelledy, F.; Smeaton, A.F.: Signature files and beyond (1996)
0.02
0.02111645 = product of:
0.06334935 = sum of:
0.022897845 = weight(_text_:of in 6973) [ClassicSimilarity], result of:
0.022897845 = score(doc=6973,freq=26.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.37376386 = fieldWeight in 6973, product of:
5.0990195 = tf(freq=26.0), with freq of:
26.0 = termFreq=26.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.046875 = fieldNorm(doc=6973)
0.0245278 = weight(_text_:systems in 6973) [ClassicSimilarity], result of:
0.0245278 = score(doc=6973,freq=2.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.2037246 = fieldWeight in 6973, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.046875 = fieldNorm(doc=6973)
0.015923709 = product of:
0.031847417 = sum of:
0.031847417 = weight(_text_:22 in 6973) [ClassicSimilarity], result of:
0.031847417 = score(doc=6973,freq=2.0), product of:
0.13719016 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03917671 = queryNorm
0.23214069 = fieldWeight in 6973, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=6973)
0.5 = coord(1/2)
0.33333334 = coord(3/9)
- Abstract
- Proposes that signature files be used as a viable alternative to other indexing strategies such as inverted files for searching through large volumes of text. Demonstrates through simulation, that search times can be further reduced by enhancing the basic signature file concept using deterministic partitioning algorithms which eliminate the need for an exhaustive search of the entire signature file. Reports research to evaluate the performance of some deterministic partitioning algorithms in a non simulated environment using 276 MB of raw newspaper text (taken from the Wall Street Journal) and real user queries. Presents a selection of results to illustrate trends and highlight important aspects of the performance of these methods under realistic rather than simulated operating conditions. As a result of the research reported here certain aspects of this approach to signature files are shown to be found wanting and require improvement. Suggests lines of future research on the partitioning of signature files
- Source
- Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon
-
Bauckhage, C.: Marginalizing over the PageRank damping factor (2014)
0.02
0.020995347 = product of:
0.09447906 = sum of:
0.08389453 = weight(_text_:applications in 928) [ClassicSimilarity], result of:
0.08389453 = score(doc=928,freq=2.0), product of:
0.17247584 = queryWeight, product of:
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.03917671 = queryNorm
0.4864132 = fieldWeight in 928, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.078125 = fieldNorm(doc=928)
0.010584532 = weight(_text_:of in 928) [ClassicSimilarity], result of:
0.010584532 = score(doc=928,freq=2.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.17277241 = fieldWeight in 928, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.078125 = fieldNorm(doc=928)
0.22222222 = coord(2/9)
- Abstract
- In this note, we show how to marginalize over the damping parameter of the PageRank equation so as to obtain a parameter-free version known as TotalRank. Our discussion is meant as a reference and intended to provide a guided tour towards an interesting result that has applications in information retrieval and classification.
-
Quint, B.: Check out the new RANK command on DIALOG (1993)
0.02
0.020995347 = product of:
0.09447906 = sum of:
0.08389453 = weight(_text_:applications in 6640) [ClassicSimilarity], result of:
0.08389453 = score(doc=6640,freq=2.0), product of:
0.17247584 = queryWeight, product of:
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.03917671 = queryNorm
0.4864132 = fieldWeight in 6640, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.078125 = fieldNorm(doc=6640)
0.010584532 = weight(_text_:of in 6640) [ClassicSimilarity], result of:
0.010584532 = score(doc=6640,freq=2.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.17277241 = fieldWeight in 6640, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.078125 = fieldNorm(doc=6640)
0.22222222 = coord(2/9)
- Abstract
- Describes the RANK command on DIALOG online information service. RANK conducts statistical analysis on an existing set of search results for fields specified by searchers. Details how to use RANK and applications. Points out drawbacks to its use
-
Baloh, P.; Desouza, K.C.; Hackney, R.: Contextualizing organizational interventions of knowledge management systems : a design science perspectiveA domain analysis (2012)
0.02
0.019909505 = product of:
0.05972851 = sum of:
0.017552461 = weight(_text_:of in 241) [ClassicSimilarity], result of:
0.017552461 = score(doc=241,freq=22.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.28651062 = fieldWeight in 241, product of:
4.690416 = tf(freq=22.0), with freq of:
22.0 = termFreq=22.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0390625 = fieldNorm(doc=241)
0.02890629 = weight(_text_:systems in 241) [ClassicSimilarity], result of:
0.02890629 = score(doc=241,freq=4.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.24009174 = fieldWeight in 241, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.0390625 = fieldNorm(doc=241)
0.013269759 = product of:
0.026539518 = sum of:
0.026539518 = weight(_text_:22 in 241) [ClassicSimilarity], result of:
0.026539518 = score(doc=241,freq=2.0), product of:
0.13719016 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03917671 = queryNorm
0.19345059 = fieldWeight in 241, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=241)
0.5 = coord(1/2)
0.33333334 = coord(3/9)
- Abstract
- We address how individuals' (workers) knowledge needs influence the design of knowledge management systems (KMS), enabling knowledge creation and utilization. It is evident that KMS technologies and activities are indiscriminately deployed in most organizations with little regard to the actual context of their adoption. Moreover, it is apparent that the extant literature pertaining to knowledge management projects is frequently deficient in identifying the variety of factors indicative for successful KMS. This presents an obvious business practice and research gap that requires a critical analysis of the necessary intervention that will actually improve how workers can leverage and form organization-wide knowledge. This research involved an extensive review of the literature, a grounded theory methodological approach and rigorous data collection and synthesis through an empirical case analysis (Parsons Brinckerhoff and Samsung). The contribution of this study is the formulation of a model for designing KMS based upon the design science paradigm, which aspires to create artifacts that are interdependent of people and organizations. The essential proposition is that KMS design and implementation must be contextualized in relation to knowledge needs and that these will differ for various organizational settings. The findings present valuable insights and further understanding of the way in which KMS design efforts should be focused.
- Date
- 11. 6.2012 14:22:34
- Source
- Journal of the American Society for Information Science and Technology. 63(2012) no.5, S.948-966
-
Willett, P.: Best-match text retrieval (1993)
0.02
0.019808581 = product of:
0.08913861 = sum of:
0.018332949 = weight(_text_:of in 7818) [ClassicSimilarity], result of:
0.018332949 = score(doc=7818,freq=6.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.2992506 = fieldWeight in 7818, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.078125 = fieldNorm(doc=7818)
0.07080566 = weight(_text_:systems in 7818) [ClassicSimilarity], result of:
0.07080566 = score(doc=7818,freq=6.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.5881023 = fieldWeight in 7818, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.078125 = fieldNorm(doc=7818)
0.22222222 = coord(2/9)
- Abstract
- Provides an introduction to the computational techniques that underlie best match searching retrieval systems. Discusses: problems of traditional Boolean systems; characteristics of best-match searching; automatic indexing; term conflation; matching of documents and queries (dealing with similarity measures, initial weights, relevance weights, and the matching algorithm); and describes operational best-match systems
-
Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998)
0.02
0.019223861 = product of:
0.05767158 = sum of:
0.010478153 = weight(_text_:of in 1319) [ClassicSimilarity], result of:
0.010478153 = score(doc=1319,freq=4.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.17103596 = fieldWeight in 1319, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.028615767 = weight(_text_:systems in 1319) [ClassicSimilarity], result of:
0.028615767 = score(doc=1319,freq=2.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.23767869 = fieldWeight in 1319, 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=1319)
0.018577661 = product of:
0.037155323 = sum of:
0.037155323 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
0.037155323 = score(doc=1319,freq=2.0), product of:
0.13719016 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03917671 = queryNorm
0.2708308 = fieldWeight in 1319, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=1319)
0.5 = coord(1/2)
0.33333334 = coord(3/9)
- Abstract
- Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web
- Date
- 1. 8.1996 22:08:06
- Footnote
- Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia
- Source
- Computer networks and ISDN systems. 30(1998) nos.1/7, S.621-623
-
Agosti, M.; Pretto, L.: ¬A theoretical study of a generalized version of kleinberg's HITS algorithm (2005)
0.02
0.01844225 = product of:
0.082990125 = sum of:
0.059322387 = weight(_text_:applications in 4) [ClassicSimilarity], result of:
0.059322387 = score(doc=4,freq=4.0), product of:
0.17247584 = queryWeight, product of:
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.03917671 = queryNorm
0.34394607 = fieldWeight in 4, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.4025097 = idf(docFreq=1471, maxDocs=44218)
0.0390625 = fieldNorm(doc=4)
0.023667734 = weight(_text_:of in 4) [ClassicSimilarity], result of:
0.023667734 = score(doc=4,freq=40.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.38633084 = fieldWeight in 4, product of:
6.3245554 = tf(freq=40.0), with freq of:
40.0 = termFreq=40.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0390625 = fieldNorm(doc=4)
0.22222222 = coord(2/9)
- Abstract
- Kleinberg's HITS (Hyperlink-Induced Topic Search) algorithm (Kleinberg 1999), which was originally developed in a Web context, tries to infer the authoritativeness of a Web page in relation to a specific query using the structure of a subgraph of the Web graph, which is obtained considering this specific query. Recent applications of this algorithm in contexts far removed from that of Web searching (Bacchin, Ferro and Melucci 2002, Ng et al. 2001) inspired us to study the algorithm in the abstract, independently of its particular applications, trying to mathematically illuminate its behaviour. In the present paper we detail this theoretical analysis. The original work starts from the definition of a revised and more general version of the algorithm, which includes the classic one as a particular case. We perform an analysis of the structure of two particular matrices, essential to studying the behaviour of the algorithm, and we prove the convergence of the algorithm in the most general case, finding the analytic expression of the vectors to which it converges. Then we study the symmetry of the algorithm and prove the equivalence between the existence of symmetry and the independence from the order of execution of some basic operations on initial vectors. Finally, we expound some interesting consequences of our theoretical results.
-
Perry, R.; Willett, P.: ¬A revies of the use of inverted files for best match searching in information retrieval systems (1983)
0.02
0.018421704 = product of:
0.08289766 = sum of:
0.025666127 = weight(_text_:of in 2701) [ClassicSimilarity], result of:
0.025666127 = score(doc=2701,freq=6.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.41895083 = fieldWeight in 2701, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.109375 = fieldNorm(doc=2701)
0.057231534 = weight(_text_:systems in 2701) [ClassicSimilarity], result of:
0.057231534 = score(doc=2701,freq=2.0), product of:
0.12039685 = queryWeight, product of:
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.03917671 = queryNorm
0.47535738 = fieldWeight in 2701, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.0731742 = idf(docFreq=5561, maxDocs=44218)
0.109375 = fieldNorm(doc=2701)
0.22222222 = coord(2/9)
- Source
- Journal of information science. 6(1983), S.59-66
