Search (6 results, page 1 of 1)

0.035214003 = product of:
  0.07042801 = sum of:
    0.07042801 = product of:
      0.14085601 = sum of:
        0.14085601 = weight(_text_:language in 2261) [ClassicSimilarity], result of:
          0.14085601 = score(doc=2261,freq=2.0), product of:
            0.2030952 = queryWeight, product of:
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.051766515 = queryNorm
            0.6935467 = fieldWeight in 2261, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.125 = fieldNorm(doc=2261)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

0.017607002 = product of:
  0.035214003 = sum of:
    0.035214003 = product of:
      0.07042801 = sum of:
        0.07042801 = weight(_text_:language in 3649) [ClassicSimilarity], result of:
          0.07042801 = score(doc=3649,freq=8.0), product of:
            0.2030952 = queryWeight, product of:
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.051766515 = queryNorm
            0.34677336 = fieldWeight in 3649, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.03125 = fieldNorm(doc=3649)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

F. W. Lancaster is known for his writing an the state of the art in librarylinformation science. His skill in identifying significant contributions and synthesizing literature in fields as diverse as online systems, vocabulary control, measurement and evaluation, and the paperless society have earned him esteem as a chronicler of information science. Equally deserving of repute is his own contribution to research in the discipline-his evaluation of the MEDLARS operating system. The MEDLARS study is notable for several reasons. It was the first large-scale application of retrieval experiment methodology to the evaluation of an actual operating system. As such, problems had to be faced that do not arise in laboratory-like conditions. One example is the problem of recall: how to determine, for a very large and dynamic database, the number of documents relevant to a given search request. By solving this problem and others attendant upon transferring an experimental methodology to the real world, Lancaster created a constructive procedure that could be used to improve the design and functioning of retrieval systems. The MEDLARS study is notable also for its contribution to our understanding of what constitutes a good index language and good indexing. The ideal retrieval system would be one that retrieves all and only relevant documents. The failures that occur in real operating systems, when a relevant document is not retrieved (a recall failure) or an irrelevant document is retrieved (a precision failure), can be analysed to assess the impact of various factors an the performance of the system. This is exactly what Lancaster did. He found both the MEDLARS indexing and the McSH index language to be significant factors affecting retrieval performance. The indexing, primarily because it was insufficiently exhaustive, explained a large number of recall failures. The index language, largely because of its insufficient specificity, accounted for a large number of precision failures. The purpose of identifying factors responsible for a system's failures is ultimately to improve the system. Unlike many user studies, the MEDLARS evaluation yielded recommendations that were eventually implemented.* Indexing exhaustivity was increased and the McSH index language was enriched with more specific terms and a larger entry vocabulary.

0.015406125 = product of:
  0.03081225 = sum of:
    0.03081225 = product of:
      0.0616245 = sum of:
        0.0616245 = weight(_text_:language in 752) [ClassicSimilarity], result of:
          0.0616245 = score(doc=752,freq=2.0), product of:
            0.2030952 = queryWeight, product of:
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.051766515 = queryNorm
            0.30342668 = fieldWeight in 752, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.0546875 = fieldNorm(doc=752)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Content

Enthält folgende Kapitel: Pre-coordinate indexes; consistency of indexing: quality of indexing; abstracts: types and functions, writing the abstract, natural language in information retrieval, automatic indexing. There are exercises in both indexing and abstracting procedures

0.014027297 = product of:
  0.028054593 = sum of:
    0.028054593 = product of:
      0.056109186 = sum of:
        0.056109186 = weight(_text_:22 in 217) [ClassicSimilarity], result of:
          0.056109186 = score(doc=217,freq=2.0), product of:
            0.18127751 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051766515 = queryNorm
            0.30952093 = fieldWeight in 217, 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=217)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 4.2007 10:07:51

0.01320525 = product of:
  0.0264105 = sum of:
    0.0264105 = product of:
      0.052821 = sum of:
        0.052821 = weight(_text_:language in 1788) [ClassicSimilarity], result of:
          0.052821 = score(doc=1788,freq=2.0), product of:
            0.2030952 = queryWeight, product of:
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.051766515 = queryNorm
            0.26008 = fieldWeight in 1788, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.046875 = fieldNorm(doc=1788)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Reports results of an analysis of 205 randomly selected records from the OCLC OLUC, to test the assumption that online catalogues have greatly improved subject searching capabilities, over card catalogues, by making other fields in the records searchable as subject access points (SAPs). Results showed considerable overlap (duplication) among the SAPs provided by the title, subject heading and classification number fields. On average, little more than 4 unique, unduplicated access points were found per record. Where title and classification number fields do add some access points not provided by subject headings, the increase is less than many librarians might be expected. Suggests that OPACs might outperform catalogues more in precision than in recall by allowing greater discrimination in searching; terms from different fields may be combined; titles offer greater specifity; searches can be limited by date, language or other criteria

0.01320525 = product of:
  0.0264105 = sum of:
    0.0264105 = product of:
      0.052821 = sum of:
        0.052821 = weight(_text_:language in 4913) [ClassicSimilarity], result of:
          0.052821 = score(doc=4913,freq=2.0), product of:
            0.2030952 = queryWeight, product of:
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.051766515 = queryNorm
            0.26008 = fieldWeight in 4913, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9232929 = idf(docFreq=2376, maxDocs=44218)
              0.046875 = fieldNorm(doc=4913)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Content

Covers: indexing principles and practice; precoordinate indexes; consistency and quality of indexing; types and functions of abstracts; writing an abstract; evaluation theory and practice; approaches used in indexing and abstracting services; indexing enhancement; natural language in information retrieval; indexing and abstracting of imaginative works; databases of images and sound; automatic indexing and abstracting; the future of indexing and abstracting services