-
Khoo, C.S.G.; Wan, K.-W.: ¬A simple relevancy-ranking strategy for an interface to Boolean OPACs (2004)
0.08
0.08194647 = sum of:
0.010336881 = product of:
0.041347522 = sum of:
0.041347522 = weight(_text_:authors in 2509) [ClassicSimilarity], result of:
0.041347522 = score(doc=2509,freq=2.0), product of:
0.23454411 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.051448494 = queryNorm
0.17628889 = fieldWeight in 2509, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.02734375 = fieldNorm(doc=2509)
0.25 = coord(1/4)
0.07160959 = sum of:
0.047212623 = weight(_text_:v in 2509) [ClassicSimilarity], result of:
0.047212623 = score(doc=2509,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.1883776 = fieldWeight in 2509, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.02734375 = fieldNorm(doc=2509)
0.024396962 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
0.024396962 = score(doc=2509,freq=2.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = queryNorm
0.1354154 = fieldWeight in 2509, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02734375 = fieldNorm(doc=2509)
- Abstract
- A relevancy-ranking algorithm for a natural language interface to Boolean online public access catalogs (OPACs) was formulated and compared with that currently used in a knowledge-based search interface called the E-Referencer, being developed by the authors. The algorithm makes use of seven weIl-known ranking criteria: breadth of match, section weighting, proximity of query words, variant word forms (stemming), document frequency, term frequency and document length. The algorithm converts a natural language query into a series of increasingly broader Boolean search statements. In a small experiment with ten subjects in which the algorithm was simulated by hand, the algorithm obtained good results with a mean overall precision of 0.42 and mean average precision of 0.62, representing a 27 percent improvement in precision and 41 percent improvement in average precision compared to the E-Referencer. The usefulness of each step in the algorithm was analyzed and suggestions are made for improving the algorithm.
- Content
- "Most Web search engines accept natural language queries, perform some kind of fuzzy matching and produce ranked output, displaying first the documents that are most likely to be relevant. On the other hand, most library online public access catalogs (OPACs) an the Web are still Boolean retrieval systems that perform exact matching, and require users to express their search requests precisely in a Boolean search language and to refine their search statements to improve the search results. It is well-documented that users have difficulty searching Boolean OPACs effectively (e.g. Borgman, 1996; Ensor, 1992; Wallace, 1993). One approach to making OPACs easier to use is to develop a natural language search interface that acts as a middleware between the user's Web browser and the OPAC system. The search interface can accept a natural language query from the user and reformulate it as a series of Boolean search statements that are then submitted to the OPAC. The records retrieved by the OPAC are ranked by the search interface before forwarding them to the user's Web browser. The user, then, does not need to interact directly with the Boolean OPAC but with the natural language search interface or search intermediary. The search interface interacts with the OPAC system an the user's behalf. The advantage of this approach is that no modification to the OPAC or library system is required. Furthermore, the search interface can access multiple OPACs, acting as a meta search engine, and integrate search results from various OPACs before sending them to the user. The search interface needs to incorporate a method for converting the user's natural language query into a series of Boolean search statements, and for ranking the OPAC records retrieved. The purpose of this study was to develop a relevancyranking algorithm for a search interface to Boolean OPAC systems. This is part of an on-going effort to develop a knowledge-based search interface to OPACs called the E-Referencer (Khoo et al., 1998, 1999; Poo et al., 2000). E-Referencer v. 2 that has been implemented applies a repertoire of initial search strategies and reformulation strategies to retrieve records from OPACs using the Z39.50 protocol, and also assists users in mapping query keywords to the Library of Congress subject headings."
- Source
- Electronic library. 22(2004) no.2, S.112-120
-
Ravana, S.D.; Rajagopal, P.; Balakrishnan, V.: Ranking retrieval systems using pseudo relevance judgments (2015)
0.06
0.058367956 = product of:
0.11673591 = sum of:
0.11673591 = sum of:
0.067446604 = weight(_text_:v in 2591) [ClassicSimilarity], result of:
0.067446604 = score(doc=2591,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.26911086 = fieldWeight in 2591, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.0390625 = fieldNorm(doc=2591)
0.04928931 = weight(_text_:22 in 2591) [ClassicSimilarity], result of:
0.04928931 = score(doc=2591,freq=4.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = 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)
- Date
- 20. 1.2015 18:30:22
18. 9.2018 18:22:56
-
Shah, B.; Raghavan, V.; Dhatric, P.; Zhao, X.: ¬A cluster-based approach for efficient content-based image retrieval using a similarity-preserving space transformation method (2006)
0.05
0.054606955 = sum of:
0.020883653 = product of:
0.08353461 = sum of:
0.08353461 = weight(_text_:authors in 6118) [ClassicSimilarity], result of:
0.08353461 = score(doc=6118,freq=4.0), product of:
0.23454411 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.051448494 = queryNorm
0.35615736 = fieldWeight in 6118, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.0390625 = fieldNorm(doc=6118)
0.25 = coord(1/4)
0.033723302 = product of:
0.067446604 = sum of:
0.067446604 = weight(_text_:v in 6118) [ClassicSimilarity], result of:
0.067446604 = score(doc=6118,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.26911086 = fieldWeight in 6118, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.0390625 = fieldNorm(doc=6118)
0.5 = coord(1/2)
- Abstract
- The techniques of clustering and space transformation have been successfully used in the past to solve a number of pattern recognition problems. In this article, the authors propose a new approach to content-based image retrieval (CBIR) that uses (a) a newly proposed similarity-preserving space transformation method to transform the original low-level image space into a highlevel vector space that enables efficient query processing, and (b) a clustering scheme that further improves the efficiency of our retrieval system. This combination is unique and the resulting system provides synergistic advantages of using both clustering and space transformation. The proposed space transformation method is shown to preserve the order of the distances in the transformed feature space. This strategy makes this approach to retrieval generic as it can be applied to object types, other than images, and feature spaces more general than metric spaces. The CBIR approach uses the inexpensive "estimated" distance in the transformed space, as opposed to the computationally inefficient "real" distance in the original space, to retrieve the desired results for a given query image. The authors also provide a theoretical analysis of the complexity of their CBIR approach when used for color-based retrieval, which shows that it is computationally more efficient than other comparable approaches. An extensive set of experiments to test the efficiency and effectiveness of the proposed approach has been performed. The results show that the approach offers superior response time (improvement of 1-2 orders of magnitude compared to retrieval approaches that either use pruning techniques like indexing, clustering, etc., or space transformation, but not both) with sufficiently high retrieval accuracy.
-
Soulier, L.; Jabeur, L.B.; Tamine, L.; Bahsoun, W.: On ranking relevant entities in heterogeneous networks using a language-based model (2013)
0.04
0.038310055 = sum of:
0.020883653 = product of:
0.08353461 = sum of:
0.08353461 = weight(_text_:authors in 664) [ClassicSimilarity], result of:
0.08353461 = score(doc=664,freq=4.0), product of:
0.23454411 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.051448494 = queryNorm
0.35615736 = fieldWeight in 664, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.0390625 = fieldNorm(doc=664)
0.25 = coord(1/4)
0.017426401 = product of:
0.034852803 = sum of:
0.034852803 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
0.034852803 = score(doc=664,freq=2.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = queryNorm
0.19345059 = fieldWeight in 664, 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=664)
0.5 = coord(1/2)
- Abstract
- A new challenge, accessing multiple relevant entities, arises from the availability of linked heterogeneous data. In this article, we address more specifically the problem of accessing relevant entities, such as publications and authors within a bibliographic network, given an information need. We propose a novel algorithm, called BibRank, that estimates a joint relevance of documents and authors within a bibliographic network. This model ranks each type of entity using a score propagation algorithm with respect to the query topic and the structure of the underlying bi-type information entity network. Evidence sources, namely content-based and network-based scores, are both used to estimate the topical similarity between connected entities. For this purpose, authorship relationships are analyzed through a language model-based score on the one hand and on the other hand, non topically related entities of the same type are detected through marginal citations. The article reports the results of experiments using the Bibrank algorithm for an information retrieval task. The CiteSeerX bibliographic data set forms the basis for the topical query automatic generation and evaluation. We show that a statistically significant improvement over closely related ranking models is achieved.
- Date
- 22. 3.2013 19:34:49
-
Yu, K.; Tresp, V.; Yu, S.: ¬A nonparametric hierarchical Bayesian framework for information filtering (2004)
0.03
0.033723302 = product of:
0.067446604 = sum of:
0.067446604 = product of:
0.13489321 = sum of:
0.13489321 = weight(_text_:v in 4117) [ClassicSimilarity], result of:
0.13489321 = score(doc=4117,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.5382217 = fieldWeight in 4117, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.078125 = fieldNorm(doc=4117)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986)
0.03
0.027882243 = product of:
0.055764485 = sum of:
0.055764485 = product of:
0.11152897 = sum of:
0.11152897 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
0.11152897 = score(doc=402,freq=2.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = queryNorm
0.61904186 = fieldWeight in 402, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.125 = fieldNorm(doc=402)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Source
- Information processing and management. 22(1986) no.6, S.465-476
-
Guerrero-Bote, V.P.; Moya Anegón, F. de; Herrero Solana, V.: Document organization using Kohonen's algorithm (2002)
0.03
0.02697864 = product of:
0.05395728 = sum of:
0.05395728 = product of:
0.10791456 = sum of:
0.10791456 = weight(_text_:v in 2564) [ClassicSimilarity], result of:
0.10791456 = score(doc=2564,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.43057737 = fieldWeight in 2564, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.0625 = fieldNorm(doc=2564)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Smeaton, A.F.; Rijsbergen, C.J. van: ¬The retrieval effects of query expansion on a feedback document retrieval system (1983)
0.02
0.024396962 = product of:
0.048793923 = sum of:
0.048793923 = product of:
0.097587846 = sum of:
0.097587846 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
0.097587846 = score(doc=2134,freq=2.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = queryNorm
0.5416616 = fieldWeight in 2134, 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=2134)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 30. 3.2001 13:32:22
-
Back, J.: ¬An evaluation of relevancy ranking techniques used by Internet search engines (2000)
0.02
0.024396962 = product of:
0.048793923 = sum of:
0.048793923 = product of:
0.097587846 = sum of:
0.097587846 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
0.097587846 = score(doc=3445,freq=2.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = queryNorm
0.5416616 = fieldWeight in 3445, 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=3445)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 25. 8.2005 17:42:22
-
Torra, V.; Miyamoto, S.; Lanau, S.: Exploration of textual document archives using a fuzzy hierarchical clustering algorithm in the GAMBAL system (2005)
0.02
0.023606312 = product of:
0.047212623 = sum of:
0.047212623 = product of:
0.094425246 = sum of:
0.094425246 = weight(_text_:v in 1028) [ClassicSimilarity], result of:
0.094425246 = score(doc=1028,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.3767552 = fieldWeight in 1028, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.0546875 = fieldNorm(doc=1028)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Ding, Y.; Yan, E.; Frazho, A.; Caverlee, J.: PageRank for ranking authors in co-citation networks (2009)
0.02
0.021702927 = product of:
0.043405853 = sum of:
0.043405853 = product of:
0.17362341 = sum of:
0.17362341 = weight(_text_:authors in 3161) [ClassicSimilarity], result of:
0.17362341 = score(doc=3161,freq=12.0), product of:
0.23454411 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.051448494 = queryNorm
0.7402591 = fieldWeight in 3161, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.046875 = fieldNorm(doc=3161)
0.25 = coord(1/4)
0.5 = coord(1/2)
- Abstract
- This paper studies how varied damping factors in the PageRank algorithm influence the ranking of authors and proposes weighted PageRank algorithms. We selected the 108 most highly cited authors in the information retrieval (IR) area from the 1970s to 2008 to form the author co-citation network. We calculated the ranks of these 108 authors based on PageRank with the damping factor ranging from 0.05 to 0.95. In order to test the relationship between different measures, we compared PageRank and weighted PageRank results with the citation ranking, h-index, and centrality measures. We found that in our author co-citation network, citation rank is highly correlated with PageRank with different damping factors and also with different weighted PageRank algorithms; citation rank and PageRank are not significantly correlated with centrality measures; and h-index rank does not significantly correlate with centrality measures but does significantly correlate with other measures. The key factors that have impact on the PageRank of authors in the author co-citation network are being co-cited with important authors.
-
Fuhr, N.: Ranking-Experimente mit gewichteter Indexierung (1986)
0.02
0.02091168 = product of:
0.04182336 = sum of:
0.04182336 = product of:
0.08364672 = sum of:
0.08364672 = weight(_text_:22 in 58) [ClassicSimilarity], result of:
0.08364672 = score(doc=58,freq=2.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = queryNorm
0.46428138 = fieldWeight in 58, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.09375 = fieldNorm(doc=58)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 14. 6.2015 22:12:44
-
Fuhr, N.: Rankingexperimente mit gewichteter Indexierung (1986)
0.02
0.02091168 = product of:
0.04182336 = sum of:
0.04182336 = product of:
0.08364672 = sum of:
0.08364672 = weight(_text_:22 in 2051) [ClassicSimilarity], result of:
0.08364672 = score(doc=2051,freq=2.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = queryNorm
0.46428138 = fieldWeight in 2051, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.09375 = fieldNorm(doc=2051)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 14. 6.2015 22:12:56
-
Aigrain, P.; Longueville, V.: ¬A model for the evaluation of expansion techniques in information retrieval systems (1994)
0.02
0.02023398 = product of:
0.04046796 = sum of:
0.04046796 = product of:
0.08093592 = sum of:
0.08093592 = weight(_text_:v in 5331) [ClassicSimilarity], result of:
0.08093592 = score(doc=5331,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.32293302 = fieldWeight in 5331, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.046875 = fieldNorm(doc=5331)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Nagelschmidt, M.: Verfahren zur Anfragemodifikation im Information Retrieval (2008)
0.02
0.02023398 = product of:
0.04046796 = sum of:
0.04046796 = product of:
0.08093592 = sum of:
0.08093592 = weight(_text_:v in 2774) [ClassicSimilarity], result of:
0.08093592 = score(doc=2774,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.32293302 = fieldWeight in 2774, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.046875 = fieldNorm(doc=2774)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Pages
- V, 110 S. + CD
-
Jindal, V.; Bawa, S.; Batra, S.: ¬A review of ranking approaches for semantic search on Web (2014)
0.02
0.02023398 = product of:
0.04046796 = sum of:
0.04046796 = product of:
0.08093592 = sum of:
0.08093592 = weight(_text_:v in 2799) [ClassicSimilarity], result of:
0.08093592 = score(doc=2799,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.32293302 = fieldWeight in 2799, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.046875 = fieldNorm(doc=2799)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Lavrenko, V.: ¬A generative theory of relevance (2009)
0.02
0.016861651 = product of:
0.033723302 = sum of:
0.033723302 = product of:
0.067446604 = sum of:
0.067446604 = weight(_text_:v in 3306) [ClassicSimilarity], result of:
0.067446604 = score(doc=3306,freq=2.0), product of:
0.25062758 = queryWeight, product of:
4.871427 = idf(docFreq=920, maxDocs=44218)
0.051448494 = queryNorm
0.26911086 = fieldWeight in 3306, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.871427 = idf(docFreq=920, maxDocs=44218)
0.0390625 = fieldNorm(doc=3306)
0.5 = coord(1/2)
0.5 = coord(1/2)
-
Ding, Y.: Topic-based PageRank on author cocitation networks (2011)
0.02
0.015346288 = product of:
0.030692575 = sum of:
0.030692575 = product of:
0.1227703 = sum of:
0.1227703 = weight(_text_:authors in 4348) [ClassicSimilarity], result of:
0.1227703 = score(doc=4348,freq=6.0), product of:
0.23454411 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.051448494 = queryNorm
0.52344227 = fieldWeight in 4348, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.046875 = fieldNorm(doc=4348)
0.25 = coord(1/4)
0.5 = coord(1/2)
- Abstract
- Ranking authors is vital for identifying a researcher's impact and standing within a scientific field. There are many different ranking methods (e.g., citations, publications, h-index, PageRank, and weighted PageRank), but most of them are topic-independent. This paper proposes topic-dependent ranks based on the combination of a topic model and a weighted PageRank algorithm. The author-conference-topic (ACT) model was used to extract topic distribution of individual authors. Two ways for combining the ACT model with the PageRank algorithm are proposed: simple combination (I_PR) or using a topic distribution as a weighted vector for PageRank (PR_t). Information retrieval was chosen as the test field and representative authors for different topics at different time phases were identified. Principal component analysis (PCA) was applied to analyze the ranking difference between I_PR and PR_t.
-
MacFarlane, A.; Robertson, S.E.; McCann, J.A.: Parallel computing for passage retrieval (2004)
0.01
0.013941121 = product of:
0.027882243 = sum of:
0.027882243 = product of:
0.055764485 = sum of:
0.055764485 = weight(_text_:22 in 5108) [ClassicSimilarity], result of:
0.055764485 = score(doc=5108,freq=2.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = queryNorm
0.30952093 = fieldWeight in 5108, 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=5108)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 20. 1.2007 18:30:22
-
Faloutsos, C.: Signature files (1992)
0.01
0.013941121 = product of:
0.027882243 = sum of:
0.027882243 = product of:
0.055764485 = sum of:
0.055764485 = weight(_text_:22 in 3499) [ClassicSimilarity], result of:
0.055764485 = score(doc=3499,freq=2.0), product of:
0.18016386 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051448494 = 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.5 = coord(1/2)
- Date
- 7. 5.1999 15:22:48
