-
MacFarlane, A.; Robertson, S.E.; McCann, J.A.: Parallel computing for passage retrieval (2004)
0.04
0.036669686 = product of:
0.14667875 = sum of:
0.14667875 = sum of:
0.095923 = weight(_text_:processing in 5108) [ClassicSimilarity], result of:
0.095923 = score(doc=5108,freq=4.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.5060184 = fieldWeight in 5108, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0625 = fieldNorm(doc=5108)
0.050755743 = weight(_text_:22 in 5108) [ClassicSimilarity], result of:
0.050755743 = score(doc=5108,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = 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.25 = coord(1/4)
- Abstract
- In this paper methods for both speeding up passage processing and examining more passages using parallel computers are explored. The number of passages processed are varied in order to examine the effect on retrieval effectiveness and efficiency. The particular algorithm applied has previously been used to good effect in Okapi experiments at TREC. This algorithm and the mechanism for applying parallel computing to speed up processing are described.
- Date
- 20. 1.2007 18:30:22
-
Robertson, S.E.; Walker, S.; Hancock-Beaulieu, M.M.: Large test collection experiments of an operational, interactive system : OKAPI at TREC (1995)
0.03
0.032942846 = product of:
0.06588569 = sum of:
0.036211025 = weight(_text_:data in 6964) [ClassicSimilarity], result of:
0.036211025 = score(doc=6964,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.24455236 = fieldWeight in 6964, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0546875 = fieldNorm(doc=6964)
0.029674664 = product of:
0.05934933 = sum of:
0.05934933 = weight(_text_:processing in 6964) [ClassicSimilarity], result of:
0.05934933 = score(doc=6964,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.3130829 = fieldWeight in 6964, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0546875 = fieldNorm(doc=6964)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- The Okapi system has been used in a series of experiments on the TREC collections, investiganting probabilistic methods, relevance feedback, and query expansion, and interaction issues. Some new probabilistic models have been developed, resulting in simple weigthing functions that take account of document length and within document and within query term frequency. All have been shown to be beneficial when based on large quantities of relevance data as in the routing task. Interaction issues are much more difficult to evaluate in the TREC framework, and no benefits have yet been demonstrated from feedback based on small numbers of 'relevant' items identified by intermediary searchers
- Source
- Information processing and management. 31(1995) no.3, S.345-360
-
Robertson, S.E.; Hancock-Beaulieu, M.M.: On the evaluation of IR systems (1992)
0.02
0.016956951 = product of:
0.067827806 = sum of:
0.067827806 = product of:
0.13565561 = sum of:
0.13565561 = weight(_text_:processing in 2619) [ClassicSimilarity], result of:
0.13565561 = score(doc=2619,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.7156181 = fieldWeight in 2619, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.125 = fieldNorm(doc=2619)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 28(1992) no.4, S.457-466
-
Robertson, S.E.: ¬The probabilistic character of relevance (1977)
0.02
0.016956951 = product of:
0.067827806 = sum of:
0.067827806 = product of:
0.13565561 = sum of:
0.13565561 = weight(_text_:processing in 7399) [ClassicSimilarity], result of:
0.13565561 = score(doc=7399,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.7156181 = fieldWeight in 7399, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.125 = fieldNorm(doc=7399)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 13(1977), S.247-251
-
Sparck Jones, K.; Walker, S.; Robertson, S.E.: ¬A probabilistic model of information retrieval : development and comparative experiments - part 1 (2000)
0.01
0.012717713 = product of:
0.05087085 = sum of:
0.05087085 = product of:
0.1017417 = sum of:
0.1017417 = weight(_text_:processing in 4181) [ClassicSimilarity], result of:
0.1017417 = score(doc=4181,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.53671354 = fieldWeight in 4181, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.09375 = fieldNorm(doc=4181)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 36(2000) no.6, S.779-808
-
Sparck Jones, K.; Walker, S.; Robertson, S.E.: ¬A probabilistic model of information retrieval : development and comparative experiments - part 2 (2000)
0.01
0.012717713 = product of:
0.05087085 = sum of:
0.05087085 = product of:
0.1017417 = sum of:
0.1017417 = weight(_text_:processing in 4286) [ClassicSimilarity], result of:
0.1017417 = score(doc=4286,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.53671354 = fieldWeight in 4286, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.09375 = fieldNorm(doc=4286)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 36(2000) no.6, S.809-840
-
Robertson, S.E.; Walker, S.; Beaulieu, M.: Experimentation as a way of life : Okapi at TREC (2000)
0.01
0.012717713 = product of:
0.05087085 = sum of:
0.05087085 = product of:
0.1017417 = sum of:
0.1017417 = weight(_text_:processing in 6030) [ClassicSimilarity], result of:
0.1017417 = score(doc=6030,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.53671354 = fieldWeight in 6030, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.09375 = fieldNorm(doc=6030)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 36(2000) no.1, S.95-108
-
MacFarlane, A.; Robertson, S.E.; McCann, J.A.: Parallel computing in information retrieval : an updated review (1997)
0.01
0.008478476 = product of:
0.033913903 = sum of:
0.033913903 = product of:
0.067827806 = sum of:
0.067827806 = weight(_text_:processing in 7450) [ClassicSimilarity], result of:
0.067827806 = score(doc=7450,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.35780904 = fieldWeight in 7450, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0625 = fieldNorm(doc=7450)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Reviews the progress of parallel computing in information retrieval. Stresses the importance of the motivation is using parallel computing for text retrieval. Analyzes parallel IR systems using a classification defined by Rasmussen and describes some parallel IR systems. Gives a description of the retrieval models used in parallel information processing and notes areas where research is needed
-
MacFarlane, A.; McCann, J.A.; Robertson, S.E.: Parallel methods for the generation of partitioned inverted files (2005)
0.01
0.0077595054 = product of:
0.031038022 = sum of:
0.031038022 = weight(_text_:data in 651) [ClassicSimilarity], result of:
0.031038022 = score(doc=651,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.2096163 = fieldWeight in 651, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046875 = fieldNorm(doc=651)
0.25 = coord(1/4)
- Abstract
- Purpose - The generation of inverted indexes is one of the most computationally intensive activities for information retrieval systems: indexing large multi-gigabyte text databases can take many hours or even days to complete. We examine the generation of partitioned inverted files in order to speed up the process of indexing. Two types of index partitions are investigated: TermId and DocId. Design/methodology/approach - We use standard measures used in parallel computing such as speedup and efficiency to examine the computing results and also the space costs of our trial indexing experiments. Findings - The results from runs on both partitioning methods are compared and contrasted, concluding that DocId is the more efficient method. Practical implications - The practical implications are that the DocId partitioning method would in most circumstances be used for distributing inverted file data in a parallel computer, particularly if indexing speed is the primary consideration. Originality/value - The paper is of value to database administrators who manage large-scale text collections, and who need to use parallel computing to implement their text retrieval services.
-
MacFarlane, A.; McCann, J.A.; Robertson, S.E.: Parallel methods for the update of partitioned inverted files (2007)
0.01
0.0074939844 = product of:
0.029975938 = sum of:
0.029975938 = product of:
0.059951875 = sum of:
0.059951875 = weight(_text_:processing in 819) [ClassicSimilarity], result of:
0.059951875 = score(doc=819,freq=4.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.3162615 = fieldWeight in 819, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.0390625 = fieldNorm(doc=819)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Purpose - An issue that tends to be ignored in information retrieval is the issue of updating inverted files. This is largely because inverted files were devised to provide fast query service, and much work has been done with the emphasis strongly on queries. This paper aims to study the effect of using parallel methods for the update of inverted files in order to reduce costs, by looking at two types of partitioning for inverted files: document identifier and term identifier. Design/methodology/approach - Raw update service and update with query service are studied with these partitioning schemes using an incremental update strategy. The paper uses standard measures used in parallel computing such as speedup to examine the computing results and also the costs of reorganising indexes while servicing transactions. Findings - Empirical results show that for both transaction processing and index reorganisation the document identifier method is superior. However, there is evidence that the term identifier partitioning method could be useful in a concurrent transaction processing context. Practical implications - There is an increasing need to service updates, which is now becoming a requirement of inverted files (for dynamic collections such as the web), demonstrating that a shift in requirements of inverted file maintenance is needed from the past. Originality/value - The paper is of value to database administrators who manage large-scale and dynamic text collections, and who need to use parallel computing to implement their text retrieval services.
-
Robertson, S.E.; Sparck Jones, K.: Simple, proven approaches to text retrieval (1997)
0.01
0.006466255 = product of:
0.02586502 = sum of:
0.02586502 = weight(_text_:data in 4532) [ClassicSimilarity], result of:
0.02586502 = score(doc=4532,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.17468026 = fieldWeight in 4532, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=4532)
0.25 = coord(1/4)
- Abstract
- This technical note describes straightforward techniques for document indexing and retrieval that have been solidly established through extensive testing and are easy to apply. They are useful for many different types of text material, are viable for very large files, and have the advantage that they do not require special skills or training for searching, but are easy for end users. The document and text retrieval methods described here have a sound theoretical basis, are well established by extensive testing, and the ideas involved are now implemented in some commercial retrieval systems. Testing in the last few years has, in particular, shown that the methods presented here work very well with full texts, not only title and abstracts, and with large files of texts containing three quarters of a million documents. These tests, the TREC Tests (see Harman 1993 - 1997; IP&M 1995), have been rigorous comparative evaluations involving many different approaches to information retrieval. These techniques depend an the use of simple terms for indexing both request and document texts; an term weighting exploiting statistical information about term occurrences; an scoring for request-document matching, using these weights, to obtain a ranked search output; and an relevance feedback to modify request weights or term sets in iterative searching. The normal implementation is via an inverted file organisation using a term list with linked document identifiers, plus counting data, and pointers to the actual texts. The user's request can be a word list, phrases, sentences or extended text.
-
Vechtomova, O.; Karamuftuoglum, M.; Robertson, S.E.: On document relevance and lexical cohesion between query terms (2006)
0.01
0.0063588563 = product of:
0.025435425 = sum of:
0.025435425 = product of:
0.05087085 = sum of:
0.05087085 = weight(_text_:processing in 987) [ClassicSimilarity], result of:
0.05087085 = score(doc=987,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.26835677 = fieldWeight in 987, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046875 = fieldNorm(doc=987)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 42(2006) no.5, S.1230-1247
-
Vechtomova, O.; Robertson, S.E.: ¬A domain-independent approach to finding related entities (2012)
0.01
0.0063588563 = product of:
0.025435425 = sum of:
0.025435425 = product of:
0.05087085 = sum of:
0.05087085 = weight(_text_:processing in 2733) [ClassicSimilarity], result of:
0.05087085 = score(doc=2733,freq=2.0), product of:
0.18956426 = queryWeight, product of:
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046827413 = queryNorm
0.26835677 = fieldWeight in 2733, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.048147 = idf(docFreq=2097, maxDocs=44218)
0.046875 = fieldNorm(doc=2733)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Information processing and management. 48(2012) no.4, S.654-670
