Search (6 results, page 1 of 1)

  • × author_ss:"Frei, H.P."
  1. Frei, H.P.; Meienberg, S.: Evaluating weighted search terms as Boolean queries (1991) 0.02 
    0.024272542 = product of:
  0.048545085 = sum of:
    0.048545085 = sum of:
      0.007674878 = weight(_text_:a in 4159) [ClassicSimilarity], result of:
        0.007674878 = score(doc=4159,freq=6.0), product of:
          0.043477926 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.037706986 = queryNorm
          0.17652355 = fieldWeight in 4159, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0625 = fieldNorm(doc=4159)
      0.04087021 = weight(_text_:22 in 4159) [ClassicSimilarity], result of:
        0.04087021 = score(doc=4159,freq=2.0), product of:
          0.13204344 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.037706986 = queryNorm
          0.30952093 = fieldWeight in 4159, 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=4159)
  0.5 = coord(1/2)
    Abstract
    A method for automatically generating Boolean queries from weighted search terms is described. The method is intended to exploit traditional Boolean information retrieval systems in a more user-friendly way. The principal advantage of the method we present is that its computational complexity is low in comparison to many other known methods
    Pages
    S.11-22
    Type
    a
  2. Frei, H.P.; Jauslin, J.F.: Graphical representation of information services : a user-oriented interface (1983) 0.00 
    0.0027415988 = product of:
  0.0054831975 = sum of:
    0.0054831975 = product of:
      0.010966395 = sum of:
        0.010966395 = weight(_text_:a in 6495) [ClassicSimilarity], result of:
          0.010966395 = score(doc=6495,freq=4.0), product of:
            0.043477926 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.037706986 = queryNorm
            0.25222903 = fieldWeight in 6495, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.109375 = fieldNorm(doc=6495)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Type
    a
  3. Qiu, Y.; Frei, H.P.: Concept based query expansion (1993) 0.00 
    0.0023499418 = product of:
  0.0046998835 = sum of:
    0.0046998835 = product of:
      0.009399767 = sum of:
        0.009399767 = weight(_text_:a in 2678) [ClassicSimilarity], result of:
          0.009399767 = score(doc=2678,freq=4.0), product of:
            0.043477926 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.037706986 = queryNorm
            0.2161963 = fieldWeight in 2678, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.09375 = fieldNorm(doc=2678)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Presentation of a probabilistic query expansion based on an automatically constructed similarity thesaurus. Such thesauri reflect the domain knowledge of their origin collection
    Type
    a
  4. Frei, H.P.; Stieger, D.: ¬The use of semantic links in hypertext information retrieval (1995) 0.00 
    0.0019582848 = product of:
  0.0039165695 = sum of:
    0.0039165695 = product of:
      0.007833139 = sum of:
        0.007833139 = weight(_text_:a in 1169) [ClassicSimilarity], result of:
          0.007833139 = score(doc=1169,freq=4.0), product of:
            0.043477926 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.037706986 = queryNorm
            0.18016359 = fieldWeight in 1169, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.078125 = fieldNorm(doc=1169)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    It is shown how the semantic content of hypertext links can be used for retrieval purposes. Indexing and retrieval algorithms are presented that exploit the link content in addition to the content of the nodes. The results of some retrieval experiments in a hypertext test collection are presented
    Type
    a
  5. Frei, H.P.; Schäuble, P.: Determining the effectiveness of retrieval algorithms (1991) 0.00 
    0.0018577921 = product of:
  0.0037155843 = sum of:
    0.0037155843 = product of:
      0.0074311686 = sum of:
        0.0074311686 = weight(_text_:a in 787) [ClassicSimilarity], result of:
          0.0074311686 = score(doc=787,freq=10.0), product of:
            0.043477926 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.037706986 = queryNorm
            0.1709182 = fieldWeight in 787, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=787)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    A new effectiveness measure ('usefulness measure') is proposed to circumvent the problems associated with the classical recall and precision measures. It is difficult to evaluate systems that filter extremly dynamic information; the determination of all relevant dodcuments in a real life collection is hardly affordable, and the specification of binary relevance assessments is often problematic. The new measure relies on an statistical approach with which two retrieval algorithms are compared. In contrast to the classical recall and precision measures, the new measure requires only relative judgments, and the reply of the retrieval system os compared directly with the information need of the user rather than with the query. The new measure has the added ability to determine an error probability that indicates haw stable the usefulness measure is. Using a test collection of abstracts from CACM, it is shown that our new measure is also capable of disclosing the effect of manually assigned descriptors and yields a results similar to that of the traditional recall and precision measures.
    Type
    a
  6. Frei, H.P.; Meienberg, S.; Schäuble, P.: ¬The perils of interpreting recall and precision values (1991) 0.00 
    0.0015666279 = product of:
  0.0031332558 = sum of:
    0.0031332558 = product of:
      0.0062665115 = sum of:
        0.0062665115 = weight(_text_:a in 786) [ClassicSimilarity], result of:
          0.0062665115 = score(doc=786,freq=4.0), product of:
            0.043477926 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.037706986 = queryNorm
            0.14413087 = fieldWeight in 786, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=786)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The traditional recall and precision measure is inappropriate when retrieval algorithms that retrieve information from Wide Area Networks are evaluated. The principle reason is that information available in WANs is dynamic and its size os orders of magnitude greater than the size of the usual test collections. To overcome these problems, a new efffectiveness measure has been developed, which we call the 'usefulness measure'
    Type
    a

Authors

Years

Themes