Search (30 results, page 1 of 2)

  • × type_ss:"a"
  • × author_ss:"Robertson, S.E."
  1. Robertson, S.E.; Sparck Jones, K.: Relevance weighting of search terms (1976) 0.02 
    0.019893078 = product of:
  0.08951885 = sum of:
    0.06711562 = weight(_text_:applications in 71) [ClassicSimilarity], result of:
      0.06711562 = score(doc=71,freq=2.0), product of:
        0.17247584 = queryWeight, product of:
          4.4025097 = idf(docFreq=1471, maxDocs=44218)
          0.03917671 = queryNorm
        0.38913056 = fieldWeight in 71, 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=71)
    0.022403233 = weight(_text_:of in 71) [ClassicSimilarity], result of:
      0.022403233 = score(doc=71,freq=14.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.36569026 = fieldWeight in 71, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0625 = fieldNorm(doc=71)
  0.22222222 = coord(2/9)
    Abstract
    Examines statistical techniques for exploiting relevance information to weight search terms. These techniques are presented as a natural extension of weighting methods using information about the distribution of index terms in documents in general. A series of relevance weighting functions is derived and is justified by theoretical considerations. In particular, it is shown that specific weighted search methods are implied by a general probabilistic theory of retrieval. Different applications of relevance weighting are illustrated by experimental results for test collections
    Source
    Journal of the American Society for Information Science. 27(1976), S.129-146
  2. Robertson, S.E.; Hancock-Beaulieu, M.M.: On the evaluation of IR systems (1992) 0.02 
    0.018298382 = product of:
  0.082342714 = sum of:
    0.016935252 = weight(_text_:of in 2619) [ClassicSimilarity], result of:
      0.016935252 = score(doc=2619,freq=2.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.27643585 = fieldWeight in 2619, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.125 = fieldNorm(doc=2619)
    0.06540746 = weight(_text_:systems in 2619) [ClassicSimilarity], result of:
      0.06540746 = score(doc=2619,freq=2.0), product of:
        0.12039685 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.03917671 = queryNorm
        0.5432656 = fieldWeight in 2619, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.125 = fieldNorm(doc=2619)
  0.22222222 = coord(2/9)
  3. Robertson, S.E.: Overview of the Okapi projects (1997) 0.02 
    0.016518667 = product of:
  0.074334 = sum of:
    0.02808394 = weight(_text_:of in 4703) [ClassicSimilarity], result of:
      0.02808394 = score(doc=4703,freq=22.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.458417 = fieldWeight in 4703, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0625 = fieldNorm(doc=4703)
    0.046250064 = weight(_text_:systems in 4703) [ClassicSimilarity], result of:
      0.046250064 = score(doc=4703,freq=4.0), product of:
        0.12039685 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.03917671 = queryNorm
        0.38414678 = fieldWeight in 4703, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.0625 = fieldNorm(doc=4703)
  0.22222222 = coord(2/9)
    Abstract
    Gives a brief description of the Okapi projects and of the work of the centre for Interactive Systems Research in the Department of Information Science at City University, London,UK, where these projects have been developed. Describes firstly one version of an information retrieval system which contains some of the central features of the Okapi projects, and follows this with an indication of the variety of systems now implemented or implementable within the present setup
    Source
    Journal of documentation. 53(1997) no.1, S.3-7
  4. MacFarlane, A.; Robertson, S.E.; McCann, J.A.: Parallel computing in information retrieval : an updated review (1997) 0.01 
    0.014041183 = product of:
  0.06318532 = sum of:
    0.016935252 = weight(_text_:of in 7450) [ClassicSimilarity], result of:
      0.016935252 = score(doc=7450,freq=8.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.27643585 = fieldWeight in 7450, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0625 = fieldNorm(doc=7450)
    0.046250064 = weight(_text_:systems in 7450) [ClassicSimilarity], result of:
      0.046250064 = score(doc=7450,freq=4.0), product of:
        0.12039685 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.03917671 = queryNorm
        0.38414678 = fieldWeight in 7450, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.0625 = fieldNorm(doc=7450)
  0.22222222 = coord(2/9)
    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
    Source
    Journal of documentation. 53(1997) no.3, S.274-315
  5. Robertson, S.E.; Walker, S.; Beaulieu, M.: Laboratory experiments with Okapi : participation in the TREC programme (1997) 0.01 
    0.0118198255 = product of:
  0.053189214 = sum of:
    0.024573447 = weight(_text_:of in 2216) [ClassicSimilarity], result of:
      0.024573447 = score(doc=2216,freq=22.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.40111488 = fieldWeight in 2216, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2216)
    0.028615767 = weight(_text_:systems in 2216) [ClassicSimilarity], result of:
      0.028615767 = score(doc=2216,freq=2.0), product of:
        0.12039685 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.03917671 = queryNorm
        0.23767869 = fieldWeight in 2216, 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=2216)
  0.22222222 = coord(2/9)
    Abstract
    Briefly reviews the history of laboratory testing of information retrieval systems, focusing on the idea of a general purpose test collection of documents, queries and relevance judgements. Gives an overview of the methods used in TREC (Text Retrieval Conference) which is concerned with an ideal test collection, and discusses the Okapi team's participation in TREC. Also discusses some of the issues surrounding the difficult problem of interactive evaluation in TREC. The reconciliation of the requirements of the laboratory context with the concerns of interactive retrieval has a long way to go
    Source
    Journal of documentation. 53(1997) no.1, S.20-34
  6. Robertson, S.E.; Beaulieu, M.: Research and evaluation in information retrieval (1997) 0.01 
    0.011030885 = product of:
  0.049638983 = sum of:
    0.016935252 = weight(_text_:of in 7445) [ClassicSimilarity], result of:
      0.016935252 = score(doc=7445,freq=8.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.27643585 = fieldWeight in 7445, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0625 = fieldNorm(doc=7445)
    0.03270373 = weight(_text_:systems in 7445) [ClassicSimilarity], result of:
      0.03270373 = score(doc=7445,freq=2.0), product of:
        0.12039685 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.03917671 = queryNorm
        0.2716328 = fieldWeight in 7445, 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=7445)
  0.22222222 = coord(2/9)
    Abstract
    Offered as a discussion document drawing on the experiences of the Okapi team in developing information retrieval systems. Raises some of the issues currently exercising the information retrieval community in the context of experimentation and evaluation
    Source
    Journal of documentation. 53(1997) no.1, S.51-57
  7. MacFarlane, A.; McCann, J.A.; Robertson, S.E.: Parallel methods for the generation of partitioned inverted files (2005) 0.01 
    0.0094423 = product of:
  0.04249035 = sum of:
    0.017962547 = weight(_text_:of in 651) [ClassicSimilarity], result of:
      0.017962547 = score(doc=651,freq=16.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.2932045 = fieldWeight in 651, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.046875 = fieldNorm(doc=651)
    0.0245278 = weight(_text_:systems in 651) [ClassicSimilarity], result of:
      0.0245278 = score(doc=651,freq=2.0), product of:
        0.12039685 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.03917671 = queryNorm
        0.2037246 = fieldWeight in 651, 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=651)
  0.22222222 = coord(2/9)
    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.
  8. Vechtomova, O.; Karamuftuoglum, M.; Robertson, S.E.: On document relevance and lexical cohesion between query terms (2006) 0.01 
    0.008907516 = product of:
  0.04008382 = sum of:
    0.015556021 = weight(_text_:of in 987) [ClassicSimilarity], result of:
      0.015556021 = score(doc=987,freq=12.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.25392252 = fieldWeight in 987, 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=987)
    0.0245278 = weight(_text_:systems in 987) [ClassicSimilarity], result of:
      0.0245278 = score(doc=987,freq=2.0), product of:
        0.12039685 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.03917671 = queryNorm
        0.2037246 = fieldWeight in 987, 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=987)
  0.22222222 = coord(2/9)
    Abstract
    Lexical cohesion is a property of text, achieved through lexical-semantic relations between words in text. Most information retrieval systems make use of lexical relations in text only to a limited extent. In this paper we empirically investigate whether the degree of lexical cohesion between the contexts of query terms' occurrences in a document is related to its relevance to the query. Lexical cohesion between distinct query terms in a document is estimated on the basis of the lexical-semantic relations (repetition, synonymy, hyponymy and sibling) that exist between there collocates - words that co-occur with them in the same windows of text. Experiments suggest significant differences between the lexical cohesion in relevant and non-relevant document sets exist. A document ranking method based on lexical cohesion shows some performance improvements.
  9. MacFarlane, A.; Robertson, S.E.; McCann, J.A.: Parallel computing for passage retrieval (2004) 0.01 
    0.006599831 = product of:
  0.02969924 = sum of:
    0.008467626 = weight(_text_:of in 5108) [ClassicSimilarity], result of:
      0.008467626 = score(doc=5108,freq=2.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.13821793 = fieldWeight in 5108, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0625 = fieldNorm(doc=5108)
    0.021231614 = product of:
      0.042463228 = sum of:
        0.042463228 = weight(_text_:22 in 5108) [ClassicSimilarity], result of:
          0.042463228 = score(doc=5108,freq=2.0), product of:
            0.13719016 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03917671 = 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.22222222 = coord(2/9)
    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
  10. Robertson, S.E.: ¬The parametric description of retrieval tests : Part I: The basic parameters (1969) 0.00 
    0.0023284785 = product of:
  0.020956306 = sum of:
    0.020956306 = weight(_text_:of in 4155) [ClassicSimilarity], result of:
      0.020956306 = score(doc=4155,freq=16.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.34207192 = fieldWeight in 4155, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4155)
  0.11111111 = coord(1/9)
    Abstract
    Some parameters and techniques in use for describing the results of test on IR system are analysed. Several considerations outside the scope of the usual 2X2 table are relevant to the choice of parameters. In particular, a variable which produces a 'performance curve' of a system corresponds to an extension of the 2x2 table. Also, the statistical relationships between parameters are all-important. It is considered that precision is not such a useful measure of performance (in conjunction with recall)as fallout. A more powerful alternative to Cleverdon's 'invitable inverse relationship between recall and precision'is proposed and justified, namely that the recall-fallout graph is convex.
    Source
    Journal of documentation. 25(1969) no.1, S.1-27
  11. Robertson, S.E.: ¬The parametric description of retrieval tests : Part II: Overall measures (1969) 0.00 
    0.0023284785 = product of:
  0.020956306 = sum of:
    0.020956306 = weight(_text_:of in 4156) [ClassicSimilarity], result of:
      0.020956306 = score(doc=4156,freq=16.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.34207192 = fieldWeight in 4156, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4156)
  0.11111111 = coord(1/9)
    Abstract
    Two general requirements for overall measures of retrieval effectiveness are proposed, namely that the measures should be as far as possible independent of generality (this is interpreted to mean that it can be described in terms of recall and fallout), and that it should be able to measure the effectiveness of a performance curve (it should not be restricted to a simple 2X2 table). Several measures that have been proposed are examined with these conditions in mind. It turns out that most of the satisfactory ones are directly or indirectly related to swet's measure A, the area under the recall-fallout curve. In particular, Brookes' measure S and Rocchio's normalized recall are versions of A.
    Source
    Journal of documentation. 25(1969) no.2, S.93-106
  12. Huang, X.; Robertson, S.E.: Application of probilistic methods to Chinese text retrieval (1997) 0.00 
    0.0021780923 = product of:
  0.01960283 = sum of:
    0.01960283 = weight(_text_:of in 4706) [ClassicSimilarity], result of:
      0.01960283 = score(doc=4706,freq=14.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.31997898 = fieldWeight in 4706, 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=4706)
  0.11111111 = coord(1/9)
    Abstract
    Discusses the use of text retrieval methods based on the probabilistic model with Chinese language material. Since Chinese text has no natural word boundaries, either a dictionary based word segmentation method must be applied to the text, or indexing and searching must be done in terms of single Chinese characters. In either case, it becomes important to have a good way of dealing with phrases or contoguous strings of characters; the probabilistic model does not at present have such a facility. Proposes some ad hoc modifications of the probabilistic weighting function and matching method for this purpose
    Source
    Journal of documentation. 53(1997) no.1, S.74-79
  13. Vechtomova, O.; Robertson, S.E.: ¬A domain-independent approach to finding related entities (2012) 0.00 
    0.0021169065 = product of:
  0.019052157 = sum of:
    0.019052157 = weight(_text_:of in 2733) [ClassicSimilarity], result of:
      0.019052157 = score(doc=2733,freq=18.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.3109903 = fieldWeight in 2733, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.046875 = fieldNorm(doc=2733)
  0.11111111 = coord(1/9)
    Abstract
    We propose an approach to the retrieval of entities that have a specific relationship with the entity given in a query. Our research goal is to investigate whether related entity finding problem can be addressed by combining a measure of relatedness of candidate answer entities to the query, and likelihood that the candidate answer entity belongs to the target entity category specified in the query. An initial list of candidate entities, extracted from top ranked documents retrieved for the query, is refined using a number of statistical and linguistic methods. The proposed method extracts the category of the target entity from the query, identifies instances of this category as seed entities, and computes similarity between candidate and seed entities. The evaluation was conducted on the Related Entity Finding task of the Entity Track of TREC 2010, as well as the QA list questions from TREC 2005 and 2006. Evaluation results demonstrate that the proposed methods are effective in finding related entities.
  14. Robertson, S.E.: Theories and models in information retrieval (1977) 0.00 
    0.0021037988 = product of:
  0.018934188 = sum of:
    0.018934188 = weight(_text_:of in 1844) [ClassicSimilarity], result of:
      0.018934188 = score(doc=1844,freq=10.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.3090647 = fieldWeight in 1844, 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=1844)
  0.11111111 = coord(1/9)
    Abstract
    This paper is concerned with recent work in the theory of information retrieval. More particularly, it is concerned with theories which tackle the problem of retrieval performance, in a sense which will be explained. The aim is not an exhaustive survey of such work; rather it is an analysis and synthesis of those contributions which I feel to be important or find interesting
    Source
    Journal of documentation. 33(1977), S.126-148
  15. Robertson, S.E.: Some recent theories and models in information retrieval (1980) 0.00 
    0.0019958385 = product of:
  0.017962547 = sum of:
    0.017962547 = weight(_text_:of in 1326) [ClassicSimilarity], result of:
      0.017962547 = score(doc=1326,freq=4.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.2932045 = fieldWeight in 1326, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.09375 = fieldNorm(doc=1326)
  0.11111111 = coord(1/9)
    Source
    Theory and application of information research. Proc. of the 2nd Int. Research Forum on Information Science, 3.-6.8.1977, Copenhagen. Ed.: O. Harbo u. L. Kajberg
  16. Robertson, S.E.; Belkin, N.J.: Ranking in principle (1978) 0.00 
    0.0018816947 = product of:
  0.016935252 = sum of:
    0.016935252 = weight(_text_:of in 1143) [ClassicSimilarity], result of:
      0.016935252 = score(doc=1143,freq=2.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.27643585 = fieldWeight in 1143, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.125 = fieldNorm(doc=1143)
  0.11111111 = coord(1/9)
    Source
    Journal of documentation. 34(1978), S.93-100
  17. Robertson, S.E.: ¬The probabilistic character of relevance (1977) 0.00 
    0.0018816947 = product of:
  0.016935252 = sum of:
    0.016935252 = weight(_text_:of in 7399) [ClassicSimilarity], result of:
      0.016935252 = score(doc=7399,freq=2.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.27643585 = fieldWeight in 7399, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.125 = fieldNorm(doc=7399)
  0.11111111 = coord(1/9)
  18. Robertson, S.E.: ¬The methodology of information retrieval experiment (1981) 0.00 
    0.0018816947 = product of:
  0.016935252 = sum of:
    0.016935252 = weight(_text_:of in 3146) [ClassicSimilarity], result of:
      0.016935252 = score(doc=3146,freq=2.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.27643585 = fieldWeight in 3146, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.125 = fieldNorm(doc=3146)
  0.11111111 = coord(1/9)
  19. Robertson, S.E.; Walker, S.; Hancock-Beaulieu, M.M.: Large test collection experiments of an operational, interactive system : OKAPI at TREC (1995) 0.00 
    0.0018408239 = product of:
  0.016567415 = sum of:
    0.016567415 = weight(_text_:of in 6964) [ClassicSimilarity], result of:
      0.016567415 = score(doc=6964,freq=10.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.2704316 = fieldWeight in 6964, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6964)
  0.11111111 = coord(1/9)
    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
  20. MacFarlane, A.; McCann, J.A.; Robertson, S.E.: Parallel methods for the update of partitioned inverted files (2007) 0.00 
    0.0017640886 = product of:
  0.015876798 = sum of:
    0.015876798 = weight(_text_:of in 819) [ClassicSimilarity], result of:
      0.015876798 = score(doc=819,freq=18.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.25915858 = fieldWeight in 819, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0390625 = fieldNorm(doc=819)
  0.11111111 = coord(1/9)
    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.

Authors

Years

Themes