Search (4 results, page 1 of 1)

  • × author_ss:"Smith, M.P."
  • × year_i:[1990 TO 2000}
  1. Pollitt, A.S.; Smith, M.P.; Treglown, M.; Braekevelt, P.: View-based searching systems : progress towards effective disintermediation (1996) 0.01 
    0.014940838 = product of:
  0.044822514 = sum of:
    0.044822514 = product of:
      0.08964503 = sum of:
        0.08964503 = weight(_text_:reports in 4428) [ClassicSimilarity], result of:
          0.08964503 = score(doc=4428,freq=2.0), product of:
            0.2251839 = queryWeight, product of:
              4.503953 = idf(docFreq=1329, maxDocs=44218)
              0.04999695 = queryNorm
            0.39809695 = fieldWeight in 4428, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.503953 = idf(docFreq=1329, maxDocs=44218)
              0.0625 = fieldNorm(doc=4428)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Presents the background and reports progress made in the development of 2 view-based searching systems - HIBROWSE and EMBASE, searching Europe's most important biomedical bibliographic databases, and HIBROWSE EPOQUE, improving access to the european Parliament's Online Query System
  2. Smith, M.P.; Pollitt, S.A.: ¬A comparison of ranking formulae and their ranks (1995) 0.01 
    0.013073232 = product of:
  0.039219696 = sum of:
    0.039219696 = product of:
      0.07843939 = sum of:
        0.07843939 = weight(_text_:reports in 5802) [ClassicSimilarity], result of:
          0.07843939 = score(doc=5802,freq=2.0), product of:
            0.2251839 = queryWeight, product of:
              4.503953 = idf(docFreq=1329, maxDocs=44218)
              0.04999695 = queryNorm
            0.34833482 = fieldWeight in 5802, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.503953 = idf(docFreq=1329, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5802)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Reports a study to compare the ranking produced by several well known probabilistic formulae. Values for the variables used in these formulae (collection frequency for a query term, number of relevant documents retrieved, and number of relevant documents retrieved, and number of relevant documents indexed by the query term) were derived using a random number generator, the number of documents in the collection was fixed at 500.000. This produced ranked bands for each formula using document term characteristics rather than actual documents. These rankings were compared with one another using the Spearman Rho ranked correlation co-efficient to determine how closely the algorithms rank documents. There is little difference in the rankings produced by the Expected Mutual Information measure EMIM and the simpler F4.5 weighting scheme
  3. Smith, M.P.; Smith, M.: ¬The use of genetic programming to build Boolean queries for text retrieval through relevance feedback (1997) 0.01 
    0.0112056285 = product of:
  0.033616886 = sum of:
    0.033616886 = product of:
      0.06723377 = sum of:
        0.06723377 = weight(_text_:reports in 761) [ClassicSimilarity], result of:
          0.06723377 = score(doc=761,freq=2.0), product of:
            0.2251839 = queryWeight, product of:
              4.503953 = idf(docFreq=1329, maxDocs=44218)
              0.04999695 = queryNorm
            0.29857272 = fieldWeight in 761, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.503953 = idf(docFreq=1329, maxDocs=44218)
              0.046875 = fieldNorm(doc=761)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Reports preliminary work on the use of evolutionary computing techniques to improve Boolean information retrieval system performance through relevance feedback, such as neural networks and genetic algorithms. One specific form of genetic algorithm technique was used: that of genetic programming. Terms from relevant documents are used to create randomly Boolean queries. Boolean queires are thought of as genetic programming organisms and, as such, are used for breeding to produce new organisms. Organisms which perform well, in terms of how good they are at retrieval, are given a better chance of being selected for breeding, with the result being that the overall fitness of the organisms improve to some extent. The aim is to develop the best Boolean query for an information need, given a small corpus of test documents, and then to use that query on the full collection to retrieve yet more relevant documents
  4. Smith, M.P.; Pollitt, A.S.: ¬The potential for incorporating document ranking in the MenUSE front-end search internemdiary system (1996) 0.01 
    0.0056449138 = product of:
  0.016934741 = sum of:
    0.016934741 = product of:
      0.033869483 = sum of:
        0.033869483 = weight(_text_:22 in 6980) [ClassicSimilarity], result of:
          0.033869483 = score(doc=6980,freq=2.0), product of:
            0.1750808 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04999695 = queryNorm
            0.19345059 = fieldWeight in 6980, 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=6980)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Source
    Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon

Authors

Themes