Search (7 results, page 1 of 1)

  • × theme_ss:"Retrievalstudien"
  • × theme_ss:"OPAC"
  1. Hancock-Beaulieu, M.; McKenzie, L.; Irving, A.: Evaluative protocols for searching behaviour in online library catalogues (1991) 0.02
    0.02320939 = product of:
      0.09283756 = sum of:
        0.09283756 = weight(_text_:library in 347) [ClassicSimilarity], result of:
          0.09283756 = score(doc=347,freq=6.0), product of:
            0.1317883 = queryWeight, product of:
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.050121464 = queryNorm
            0.7044446 = fieldWeight in 347, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.109375 = fieldNorm(doc=347)
      0.25 = coord(1/4)
    
    Imprint
    London : British Library
    Series
    British Library research and development report; no.6031
  2. Johnson, K.E.: OPAC missing record retrieval (1996) 0.01
    0.014067013 = product of:
      0.05626805 = sum of:
        0.05626805 = weight(_text_:library in 6735) [ClassicSimilarity], result of:
          0.05626805 = score(doc=6735,freq=12.0), product of:
            0.1317883 = queryWeight, product of:
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.050121464 = queryNorm
            0.42695788 = fieldWeight in 6735, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.046875 = fieldNorm(doc=6735)
      0.25 = coord(1/4)
    
    Abstract
    Reports results of a study, conducted at Rhode Island University Library, to determine whether cataloguing records known to be missing from a library consortium OPAC database could be identified using the database search features. Attempts to create lists of bibliographic records held by other libraries in the consortium using Boolean searching features failed due to search feature limitations. Samples of search logic were created, collections of records based on this logic were assembled manually and then compared with card catalogue of the single library. Results suggest that use of the Boolean OR operator to conduct the broadest possible search could find 56.000 of the library's missing records that were held by other libraries. Use of the Boolean AND operator to conduct the narrowest search found 85.000 missing records. A specific library search made of the records of the most likely consortium library to have overlaid the single library's holdings found that 80.000 of the single library's missing records were held by a specific library
  3. Lancaster, F.W.; Connell, T.H.; Bishop, N.; McCowan, S.: Identifying barriers to effective subject access in library catalogs (1991) 0.01
    0.011604695 = product of:
      0.04641878 = sum of:
        0.04641878 = weight(_text_:library in 2259) [ClassicSimilarity], result of:
          0.04641878 = score(doc=2259,freq=6.0), product of:
            0.1317883 = queryWeight, product of:
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.050121464 = queryNorm
            0.3522223 = fieldWeight in 2259, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2259)
      0.25 = coord(1/4)
    
    Abstract
    51 subject searches were performed in an online catalog containing about 4,5 million records. Their success was judges in terms of lists of items, known to be relevant to the various topics, compiled by subject specialists (faculty members or authors of articles in specialized encyclopedias). Many of the items known to be relevant were not retrieved, even in very broad searches that sometimes retrieved several hundred records, and very little could be done to make them retrievable within the constraints of present cataloging practice. Librarians should recognize that library catalogs, as now implemented, offer only the most primitive of subject access and should seek to develop different types of subject access tools. - Vgl auch Letter (B.H. Weinberg) in: LTRS 36(1992) S.123-124.
    Source
    Library resources and technical services. 35(1991), S.377-391
  4. Peters, T.A.; Kurth, M.: Controlled and uncontrolled vocabulary subject searching in an academic library online catalog (1991) 0.01
    0.009475192 = product of:
      0.03790077 = sum of:
        0.03790077 = weight(_text_:library in 2348) [ClassicSimilarity], result of:
          0.03790077 = score(doc=2348,freq=4.0), product of:
            0.1317883 = queryWeight, product of:
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.050121464 = queryNorm
            0.28758827 = fieldWeight in 2348, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2348)
      0.25 = coord(1/4)
    
    Abstract
    An analysis of transaction logs from an academic library online catalog describes instances in which users have tried both controlled and uncontrolled (title keyword) vocabulary subject access during the same search session. Eight hypotheses were tested. Over 6.6% of all dial access search sessions contained both methods of subject access. Over 58% of the isolated sessions began with an uncontrolled vocabulary attempt. Over 76% contained only one vocabulary shift. On average, user persistence was greater during controlled vocabulary search logs, but search output was greater during uncontrolled vocabulary search logs. Several recommendations regarding catalog design and instruction are made.
  5. Kilgour, F.G.; Moran, B.B.: Surname plus recallable title word searches for known items by scholars (2000) 0.01
    0.0076571116 = product of:
      0.030628446 = sum of:
        0.030628446 = weight(_text_:library in 4296) [ClassicSimilarity], result of:
          0.030628446 = score(doc=4296,freq=2.0), product of:
            0.1317883 = queryWeight, product of:
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.050121464 = queryNorm
            0.23240642 = fieldWeight in 4296, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.0625 = fieldNorm(doc=4296)
      0.25 = coord(1/4)
    
    Abstract
    This experiment searches an online library catalog employing author surnames, plus title words of books in citations of 8 scholarly works whose authors selected the title words used as being recallable. Searches comprising surname together with two recallable title words, or one if only one was available, yielded a single-screen miniature catalog (minicat) 99.0% of the time
  6. Kilgour, F.G.; Moran, B.B.; Barden, J.R.: Retrieval effectiveness of surname-title-word searches for known items by academic library users (1999) 0.01
    0.006699973 = product of:
      0.026799891 = sum of:
        0.026799891 = weight(_text_:library in 3061) [ClassicSimilarity], result of:
          0.026799891 = score(doc=3061,freq=2.0), product of:
            0.1317883 = queryWeight, product of:
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.050121464 = queryNorm
            0.20335563 = fieldWeight in 3061, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3061)
      0.25 = coord(1/4)
    
  7. Cooper, M.D.; Chen, H.-M.: Predicting the relevance of a library catalog search (2001) 0.01
    0.0054143956 = product of:
      0.021657582 = sum of:
        0.021657582 = weight(_text_:library in 6519) [ClassicSimilarity], result of:
          0.021657582 = score(doc=6519,freq=4.0), product of:
            0.1317883 = queryWeight, product of:
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.050121464 = queryNorm
            0.16433616 = fieldWeight in 6519, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.6293786 = idf(docFreq=8668, maxDocs=44218)
              0.03125 = fieldNorm(doc=6519)
      0.25 = coord(1/4)
    
    Abstract
    Relevance has been a difficult concept to define, let alone measure. In this paper, a simple operational definition of relevance is proposed for a Web-based library catalog: whether or not during a search session the user saves, prints, mails, or downloads a citation. If one of those actions is performed, the session is considered relevant to the user. An analysis is presented illustrating the advantages and disadvantages of this definition. With this definition and good transaction logging, it is possible to ascertain the relevance of a session. This was done for 905,970 sessions conducted with the University of California's Melvyl online catalog. Next, a methodology was developed to try to predict the relevance of a session. A number of variables were defined that characterize a session, none of which used any demographic information about the user. The values of the variables were computed for the sessions. Principal components analysis was used to extract a new set of variables out of the original set. A stratified random sampling technique was used to form ten strata such that each new strata of 90,570 sessions contained the same proportion of relevant to nonrelevant sessions. Logistic regression was used to ascertain the regression coefficients for nine of the ten strata. Then, the coefficients were used to predict the relevance of the sessions in the missing strata. Overall, 17.85% of the sessions were determined to be relevant. The predicted number of relevant sessions for all ten strata was 11 %, a 6.85% difference. The authors believe that the methodology can be further refined and the prediction improved. This methodology could also have significant application in improving user searching and also in predicting electronic commerce buying decisions without the use of personal demographic data