-
Bodoff, D.; Enache, D.; Kambil, A.; Simon, G.; Yukhimets, A.: ¬A unified maximum likelihood approach to document retrieval (2001)
0.01
0.0051744715 = product of:
0.020697886 = sum of:
0.012270111 = product of:
0.03681033 = sum of:
0.03681033 = weight(_text_:problem in 174) [ClassicSimilarity], result of:
0.03681033 = score(doc=174,freq=2.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.28137225 = fieldWeight in 174, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.046875 = fieldNorm(doc=174)
0.33333334 = coord(1/3)
0.008427775 = product of:
0.025283325 = sum of:
0.025283325 = weight(_text_:29 in 174) [ClassicSimilarity], result of:
0.025283325 = score(doc=174,freq=2.0), product of:
0.108422816 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.030822188 = queryNorm
0.23319192 = fieldWeight in 174, 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=174)
0.33333334 = coord(1/3)
0.25 = coord(2/8)
- Abstract
- Empirical work shows significant benefits from using relevance feedback data to improve information retrieval (IR) performance. Still, one fundamental difficulty has limited the ability to fully exploit this valuable data. The problem is that it is not clear whether the relevance feedback data should be used to train the system about what the users really mean, or about what the documents really mean. In this paper, we resolve the question using a maximum likelihood framework. We show how all the available data can be used to simultaneously estimate both documents and queries in proportions that are optimal in a maximum likelihood sense. The resulting algorithm is directly applicable to many approaches to IR, and the unified framework can help explain previously reported results as well as guidethe search for new methods that utilize feedback data in IR
- Date
- 29. 9.2001 17:52:51
-
Maron, M.E.: ¬An historical note on the origins of probabilistic indexing (2008)
0.00
0.0028920928 = product of:
0.023136742 = sum of:
0.023136742 = product of:
0.06941023 = sum of:
0.06941023 = weight(_text_:problem in 2047) [ClassicSimilarity], result of:
0.06941023 = score(doc=2047,freq=4.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.5305606 = fieldWeight in 2047, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.0625 = fieldNorm(doc=2047)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- The motivation behind "Probabilistic Indexing" was to replace two-valued thinking about information retrieval with probabilistic notions. This involved a new view of the information retrieval problem - viewing it as problem of inference and prediction, and introducing probabilistically weighted indexes and probabilistically ranked output. These ideas were first formulated and written up in August 1958.
-
Cheng, C.-S.; Chung, C.-P.; Shann, J.J.-J.: Fast query evaluation through document identifier assignment for inverted file-based information retrieval systems (2006)
0.00
0.002556273 = product of:
0.020450184 = sum of:
0.020450184 = product of:
0.06135055 = sum of:
0.06135055 = weight(_text_:problem in 979) [ClassicSimilarity], result of:
0.06135055 = score(doc=979,freq=8.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.46895373 = fieldWeight in 979, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.0390625 = fieldNorm(doc=979)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- Compressing an inverted file can greatly improve query performance of an information retrieval system (IRS) by reducing disk I/Os. We observe that a good document identifier assignment (DIA) can make the document identifiers in the posting lists more clustered, and result in better compression as well as shorter query processing time. In this paper, we tackle the NP-complete problem of finding an optimal DIA to minimize the average query processing time in an IRS when the probability distribution of query terms is given. We indicate that the greedy nearest neighbor (Greedy-NN) algorithm can provide excellent performance for this problem. However, the Greedy-NN algorithm is inappropriate if used in large-scale IRSs, due to its high complexity O(N2 × n), where N denotes the number of documents and n denotes the number of distinct terms. In real-world IRSs, the distribution of query terms is skewed. Based on this fact, we propose a fast O(N × n) heuristic, called partition-based document identifier assignment (PBDIA) algorithm, which can efficiently assign consecutive document identifiers to those documents containing frequently used query terms, and improve compression efficiency of the posting lists for those terms. This can result in reduced query processing time. The experimental results show that the PBDIA algorithm can yield a competitive performance versus the Greedy-NN for the DIA problem, and that this optimization problem has significant advantages for both long queries and parallel information retrieval (IR).
-
Na, S.-H.; Kang, I.-S.; Roh, J.-E.; Lee, J.-H.: ¬An empirical study of query expansion and cluster-based retrieval in language modeling approach (2007)
0.00
0.0025305813 = product of:
0.02024465 = sum of:
0.02024465 = product of:
0.06073395 = sum of:
0.06073395 = weight(_text_:problem in 906) [ClassicSimilarity], result of:
0.06073395 = score(doc=906,freq=4.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.46424055 = fieldWeight in 906, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.0546875 = fieldNorm(doc=906)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- The term mismatch problem in information retrieval is a critical problem, and several techniques have been developed, such as query expansion, cluster-based retrieval and dimensionality reduction to resolve this issue. Of these techniques, this paper performs an empirical study on query expansion and cluster-based retrieval. We examine the effect of using parsimony in query expansion and the effect of clustering algorithms in cluster-based retrieval. In addition, query expansion and cluster-based retrieval are compared, and their combinations are evaluated in terms of retrieval performance by performing experimentations on seven test collections of NTCIR and TREC.
-
Sánchez-de-Madariaga, R.; Fernández-del-Castillo, J.R.: ¬The bootstrapping of the Yarowsky algorithm in real corpora (2009)
0.00
0.0025305813 = product of:
0.02024465 = sum of:
0.02024465 = product of:
0.06073395 = sum of:
0.06073395 = weight(_text_:problem in 2451) [ClassicSimilarity], result of:
0.06073395 = score(doc=2451,freq=4.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.46424055 = fieldWeight in 2451, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.0546875 = fieldNorm(doc=2451)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- The Yarowsky bootstrapping algorithm resolves the homograph-level word sense disambiguation (WSD) problem, which is the sense granularity level required for real natural language processing (NLP) applications. At the same time it resolves the knowledge acquisition bottleneck problem affecting most WSD algorithms and can be easily applied to foreign language corpora. However, this paper shows that the Yarowsky algorithm is significantly less accurate when applied to domain fluctuating, real corpora. This paper also introduces a new bootstrapping methodology that performs much better when applied to these corpora. The accuracy achieved in non-domain fluctuating corpora is not reached due to inherent domain fluctuation ambiguities.
-
Archuby, C.G.: Interfaces se recuperacion para catalogos en linea con salidas ordenadas por probable relevancia (2000)
0.00
0.002483057 = product of:
0.019864457 = sum of:
0.019864457 = product of:
0.05959337 = sum of:
0.05959337 = weight(_text_:29 in 5727) [ClassicSimilarity], result of:
0.05959337 = score(doc=5727,freq=4.0), product of:
0.108422816 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.030822188 = queryNorm
0.5496386 = fieldWeight in 5727, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.078125 = fieldNorm(doc=5727)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Date
- 29. 1.1996 18:23:13
- Source
- Ciencia da informacao. 29(2000) no.3, S.5-13
-
Crestani, F.: Combination of similarity measures for effective spoken document retrieval (2003)
0.00
0.0024581011 = product of:
0.01966481 = sum of:
0.01966481 = product of:
0.058994424 = sum of:
0.058994424 = weight(_text_:29 in 4690) [ClassicSimilarity], result of:
0.058994424 = score(doc=4690,freq=2.0), product of:
0.108422816 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.030822188 = queryNorm
0.5441145 = fieldWeight in 4690, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.109375 = fieldNorm(doc=4690)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Source
- Journal of information science. 29(2003) no.2, S.87-96
-
Back, J.: ¬An evaluation of relevancy ranking techniques used by Internet search engines (2000)
0.00
0.002435989 = product of:
0.019487912 = sum of:
0.019487912 = product of:
0.058463734 = sum of:
0.058463734 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
0.058463734 = score(doc=3445,freq=2.0), product of:
0.10793405 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.030822188 = 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.33333334 = coord(1/3)
0.125 = coord(1/8)
- Date
- 25. 8.2005 17:42:22
-
Okada, M.; Ando, K.; Lee, S.S.; Hayashi, Y.; Aoe, J.I.: ¬An efficient substring search method by using delayed keyword extraction (2001)
0.00
0.0021069439 = product of:
0.01685555 = sum of:
0.01685555 = product of:
0.05056665 = sum of:
0.05056665 = weight(_text_:29 in 6415) [ClassicSimilarity], result of:
0.05056665 = score(doc=6415,freq=2.0), product of:
0.108422816 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.030822188 = queryNorm
0.46638384 = fieldWeight in 6415, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.09375 = fieldNorm(doc=6415)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Date
- 29. 3.2002 17:24:03
-
Carpineto, C.; Romano, G.: Order-theoretical ranking (2000)
0.00
0.0018075579 = product of:
0.014460463 = sum of:
0.014460463 = product of:
0.04338139 = sum of:
0.04338139 = weight(_text_:problem in 4766) [ClassicSimilarity], result of:
0.04338139 = score(doc=4766,freq=4.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.33160037 = fieldWeight in 4766, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.0390625 = fieldNorm(doc=4766)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- Current best-match ranking (BMR) systems perform well but cannot handle word mismatch between a query and a document. The best known alternative ranking method, hierarchical clustering-based ranking (HCR), seems to be more robust than BMR with respect to this problem, but it is hampered by theoretical and practical limitations. We present an approach to document ranking that explicitly addresses the word mismatch problem by exploiting interdocument similarity information in a novel way. Document ranking is seen as a query-document transformation driven by a conceptual representation of the whole document collection, into which the query is merged. Our approach is nased on the theory of concept (or Galois) lattices, which, er argue, provides a powerful, well-founded, and conputationally-tractable framework to model the space in which documents and query are represented and to compute such a transformation. We compared information retrieval using concept lattice-based ranking (CLR) to BMR and HCR. The results showed that HCR was outperformed by CLR as well as BMR, and suggested that, of the two best methods, BMR achieved better performance than CLR on the whole document set, whereas CLR compared more favorably when only the first retrieved documents were used for evaluation. We also evaluated the three methods' specific ability to rank documents that did not match the query, in which case the speriority of CLR over BMR and HCR was apparent
-
French, J.C.; Powell, A.L.; Schulman, E.: Using clustering strategies for creating authority files (2000)
0.00
0.0015337638 = product of:
0.012270111 = sum of:
0.012270111 = product of:
0.03681033 = sum of:
0.03681033 = weight(_text_:problem in 4811) [ClassicSimilarity], result of:
0.03681033 = score(doc=4811,freq=2.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.28137225 = fieldWeight in 4811, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.046875 = fieldNorm(doc=4811)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective retrieval of information. Authority work, the need to discover and reconcile variant forms of strings in bibliographical entries, will become more critical in the future. Spelling variants, misspellings, and transliteration differences will all increase the difficulty of retrieving information. We investigate a number of approximate string matching techniques that have traditionally been used to help with this problem. We then introduce the notion of approximate word matching and show how it can be used to improve detection and categorization of variant forms. We demonstrate the utility of these approaches using data from the Astrophysics Data System and show how we can reduce the human effort involved in the creation of authority files
-
Ding, Y.; Chowdhury, G.; Foo, S.: Organsising keywords in a Web search environment : a methodology based on co-word analysis (2000)
0.00
0.0015337638 = product of:
0.012270111 = sum of:
0.012270111 = product of:
0.03681033 = sum of:
0.03681033 = weight(_text_:problem in 105) [ClassicSimilarity], result of:
0.03681033 = score(doc=105,freq=2.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.28137225 = fieldWeight in 105, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.046875 = fieldNorm(doc=105)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- The rapid development of the Internet and World Wide Web has caused some critical problem for information retrieval. Researchers have made several attempts to solve these problems. Thesauri and subject heading lists as traditional information retrieval tools have been criticised for their efficiency to tackle these newly emerging problems. This paper proposes an information retrieval tool generated by cocitation analysis, comprising keyword clusters with relationships based on the co-occurrences of keywords in the literature. Such a tool can play the role of an associative thesaurus that can provide information about the keywords in a domain that might be useful for information searching and query expansion
-
Beitzel, S.M.; Jensen, E.C.; Chowdhury, A.; Grossman, D.; Frieder, O; Goharian, N.: Fusion of effective retrieval strategies in the same information retrieval system (2004)
0.00
0.0015337638 = product of:
0.012270111 = sum of:
0.012270111 = product of:
0.03681033 = sum of:
0.03681033 = weight(_text_:problem in 2502) [ClassicSimilarity], result of:
0.03681033 = score(doc=2502,freq=2.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.28137225 = fieldWeight in 2502, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.046875 = fieldNorm(doc=2502)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- Prior efforts have shown that under certain situations retrieval effectiveness may be improved via the use of data fusion techniques. Although these improvements have been observed from the fusion of result sets from several distinct information retrieval systems, it has often been thought that fusing different document retrieval strategies in a single information retrieval system will lead to similar improvements. In this study, we show that this is not the case. We hold constant systemic differences such as parsing, stemming, phrase processing, and relevance feedback, and fuse result sets generated from highly effective retrieval strategies in the same information retrieval system. From this, we show that data fusion of highly effective retrieval strategies alone shows little or no improvement in retrieval effectiveness. Furthermore, we present a detailed analysis of the performance of modern data fusion approaches, and demonstrate the reasons why they do not perform weIl when applied to this problem. Detailed results and analyses are included to support our conclusions.
-
Singh, S.; Dey, L.: ¬A rough-fuzzy document grading system for customized text information retrieval (2005)
0.00
0.0015337638 = product of:
0.012270111 = sum of:
0.012270111 = product of:
0.03681033 = sum of:
0.03681033 = weight(_text_:problem in 1007) [ClassicSimilarity], result of:
0.03681033 = score(doc=1007,freq=2.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.28137225 = fieldWeight in 1007, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.046875 = fieldNorm(doc=1007)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- Due to the large repository of documents available on the web, users are usually inundated by a large volume of information, most of which is found to be irrelevant. Since user perspectives vary, a client-side text filtering system that learns the user's perspective can reduce the problem of irrelevant retrieval. In this paper, we have provided the design of a customized text information filtering system which learns user preferences and modifies the initial query to fetch better documents. It uses a rough-fuzzy reasoning scheme. The rough-set based reasoning takes care of natural language nuances, like synonym handling, very elegantly. The fuzzy decider provides qualitative grading to the documents for the user's perusal. We have provided the detailed design of the various modules and some results related to the performance analysis of the system.
-
Efron, M.: Query expansion and dimensionality reduction : Notions of optimality in Rocchio relevance feedback and latent semantic indexing (2008)
0.00
0.0015337638 = product of:
0.012270111 = sum of:
0.012270111 = product of:
0.03681033 = sum of:
0.03681033 = weight(_text_:problem in 2020) [ClassicSimilarity], result of:
0.03681033 = score(doc=2020,freq=2.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.28137225 = fieldWeight in 2020, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.046875 = fieldNorm(doc=2020)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- Rocchio relevance feedback and latent semantic indexing (LSI) are well-known extensions of the vector space model for information retrieval (IR). This paper analyzes the statistical relationship between these extensions. The analysis focuses on each method's basis in least-squares optimization. Noting that LSI and Rocchio relevance feedback both alter the vector space model in a way that is in some sense least-squares optimal, we ask: what is the relationship between LSI's and Rocchio's notions of optimality? What does this relationship imply for IR? Using an analytical approach, we argue that Rocchio relevance feedback is optimal if we understand retrieval as a simplified classification problem. On the other hand, LSI's motivation comes to the fore if we understand it as a biased regression technique, where projection onto a low-dimensional orthogonal subspace of the documents reduces model variance.
-
Zhao, L.; Wu, L.; Huang, X.: Using query expansion in graph-based approach for query-focused multi-document summarization (2009)
0.00
0.0015337638 = product of:
0.012270111 = sum of:
0.012270111 = product of:
0.03681033 = sum of:
0.03681033 = weight(_text_:problem in 2449) [ClassicSimilarity], result of:
0.03681033 = score(doc=2449,freq=2.0), product of:
0.13082431 = queryWeight, product of:
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.030822188 = queryNorm
0.28137225 = fieldWeight in 2449, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.244485 = idf(docFreq=1723, maxDocs=44218)
0.046875 = fieldNorm(doc=2449)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Abstract
- This paper presents a novel query expansion method, which is combined in the graph-based algorithm for query-focused multi-document summarization, so as to resolve the problem of information limit in the original query. Our approach makes use of both the sentence-to-sentence relations and the sentence-to-word relations to select the query biased informative words from the document set and use them as query expansions to improve the sentence ranking result. Compared to previous query expansion approaches, our approach can capture more relevant information with less noise. We performed experiments on the data of document understanding conference (DUC) 2005 and DUC 2006, and the evaluation results show that the proposed query expansion method can significantly improve the system performance and make our system comparable to the state-of-the-art systems.
-
Thompson, P.: Looking back: on relevance, probabilistic indexing and information retrieval (2008)
0.00
0.0014046291 = product of:
0.011237033 = sum of:
0.011237033 = product of:
0.033711098 = sum of:
0.033711098 = weight(_text_:29 in 2074) [ClassicSimilarity], result of:
0.033711098 = score(doc=2074,freq=2.0), product of:
0.108422816 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.030822188 = queryNorm
0.31092256 = fieldWeight in 2074, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0625 = fieldNorm(doc=2074)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Date
- 31. 7.2008 19:58:29
-
Vechtomova, O.; Karamuftuoglu, M.: Lexical cohesion and term proximity in document ranking (2008)
0.00
0.0014046291 = product of:
0.011237033 = sum of:
0.011237033 = product of:
0.033711098 = sum of:
0.033711098 = weight(_text_:29 in 2101) [ClassicSimilarity], result of:
0.033711098 = score(doc=2101,freq=2.0), product of:
0.108422816 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.030822188 = queryNorm
0.31092256 = fieldWeight in 2101, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0625 = fieldNorm(doc=2101)
0.33333334 = coord(1/3)
0.125 = coord(1/8)
- Date
- 1. 8.2008 12:29:05
-
MacFarlane, A.; Robertson, S.E.; McCann, J.A.: Parallel computing for passage retrieval (2004)
0.00
0.0013919937 = product of:
0.01113595 = sum of:
0.01113595 = product of:
0.03340785 = sum of:
0.03340785 = weight(_text_:22 in 5108) [ClassicSimilarity], result of:
0.03340785 = score(doc=5108,freq=2.0), product of:
0.10793405 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.030822188 = 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.33333334 = coord(1/3)
0.125 = coord(1/8)
- Date
- 20. 1.2007 18:30:22
-
Losada, D.E.; Barreiro, A.: Emebedding term similarity and inverse document frequency into a logical model of information retrieval (2003)
0.00
0.0013919937 = product of:
0.01113595 = sum of:
0.01113595 = product of:
0.03340785 = sum of:
0.03340785 = weight(_text_:22 in 1422) [ClassicSimilarity], result of:
0.03340785 = score(doc=1422,freq=2.0), product of:
0.10793405 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.030822188 = 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.33333334 = coord(1/3)
0.125 = coord(1/8)
- Date
- 22. 3.2003 19:27:23
