Search (5 results, page 1 of 1)

  • × theme_ss:"OPAC"
  • × theme_ss:"Retrievalalgorithmen"
  1. Khoo, C.S.G.; Wan, K.-W.: ¬A simple relevancy-ranking strategy for an interface to Boolean OPACs (2004) 0.02 
    0.015720665 = sum of:
  0.005675045 = product of:
    0.034050267 = sum of:
      0.034050267 = weight(_text_:authors in 2509) [ClassicSimilarity], result of:
        0.034050267 = score(doc=2509,freq=2.0), product of:
          0.19315039 = queryWeight, product of:
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.04236856 = 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.16666667 = coord(1/6)
  0.010045622 = product of:
    0.020091243 = sum of:
      0.020091243 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
        0.020091243 = score(doc=2509,freq=2.0), product of:
          0.14836748 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04236856 = 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)
    0.5 = coord(1/2)
    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.
    Source
    Electronic library. 22(2004) no.2, S.112-120
  2. Maylein, L.; Langenstein, A.: Neues vom Relevanz-Ranking im HEIDI-Katalog der Universitätsbibliothek Heidelberg : Perspektiven für bibliothekarische Dienstleistungen (2013) 0.01 
    0.005778817 = product of:
  0.011557634 = sum of:
    0.011557634 = product of:
      0.023115268 = sum of:
        0.023115268 = weight(_text_:h in 775) [ClassicSimilarity], result of:
          0.023115268 = score(doc=775,freq=2.0), product of:
            0.10526253 = queryWeight, product of:
              2.4844491 = idf(docFreq=10020, maxDocs=44218)
              0.04236856 = queryNorm
            0.21959636 = fieldWeight in 775, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4844491 = idf(docFreq=10020, maxDocs=44218)
              0.0625 = fieldNorm(doc=775)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    B.I.T.online. 16(2013) H.3, S.190-200
  3. Oberhauser, O.; Labner, J.: Relevance Ranking in Online-Katalogen : Informationsstand und Perspektiven (2003) 0.01 
    0.005056465 = product of:
  0.01011293 = sum of:
    0.01011293 = product of:
      0.02022586 = sum of:
        0.02022586 = weight(_text_:h in 2188) [ClassicSimilarity], result of:
          0.02022586 = score(doc=2188,freq=2.0), product of:
            0.10526253 = queryWeight, product of:
              2.4844491 = idf(docFreq=10020, maxDocs=44218)
              0.04236856 = queryNorm
            0.19214681 = fieldWeight in 2188, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4844491 = idf(docFreq=10020, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2188)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 56(2003) H.3/4, S.49-63
  4. Hora, M.: Methoden für das Ranking in Discovery-Systemen (2018) 0.01 
    0.005056465 = product of:
  0.01011293 = sum of:
    0.01011293 = product of:
      0.02022586 = sum of:
        0.02022586 = weight(_text_:h in 4968) [ClassicSimilarity], result of:
          0.02022586 = score(doc=4968,freq=2.0), product of:
            0.10526253 = queryWeight, product of:
              2.4844491 = idf(docFreq=10020, maxDocs=44218)
              0.04236856 = queryNorm
            0.19214681 = fieldWeight in 4968, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4844491 = idf(docFreq=10020, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4968)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    Perspektive Bibliothek. 7(2018) H.2, S.2-23
  5. Oberhauser, O.: Relevance Ranking in den Online-Katalogen der "nächsten Generation" (2010) 0.00 
    0.0043341126 = product of:
  0.008668225 = sum of:
    0.008668225 = product of:
      0.01733645 = sum of:
        0.01733645 = weight(_text_:h in 4308) [ClassicSimilarity], result of:
          0.01733645 = score(doc=4308,freq=2.0), product of:
            0.10526253 = queryWeight, product of:
              2.4844491 = idf(docFreq=10020, maxDocs=44218)
              0.04236856 = queryNorm
            0.16469726 = fieldWeight in 4308, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4844491 = idf(docFreq=10020, maxDocs=44218)
              0.046875 = fieldNorm(doc=4308)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 63(2010) H.1/2, S.25-37

Authors

Years

Languages