Search (5 results, page 1 of 1)

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 2348) [ClassicSimilarity], result of:
      0.01867095 = score(doc=2348,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 2348, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2348)
  0.33333334 = coord(1/3)

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.

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 1857) [ClassicSimilarity], result of:
      0.01867095 = score(doc=1857,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 1857, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1857)
  0.33333334 = coord(1/3)

Abstract

Examines 3 aspects of keyword searching to see if defaulting to keyword searches might serve as a solution to the problems users find when performing subject searches in OPACs. Investigates if keyword searching produces useful results; if people who use keyword searches to find information on a subject report that they are satisfied with the results; and how keyword searching and controlled vocabulary searching are offered and explained in currently available OPAC interfaces. Concludes that both keyword and controlled vocabulary searching ought to be easily available in an OPAC, and that improvements need to be made in explanation and help offered to subject searchers

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 6742) [ClassicSimilarity], result of:
      0.01867095 = score(doc=6742,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 6742, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6742)
  0.33333334 = coord(1/3)

Abstract

Reports results of a study to examine the performance of online catalogue searches involving personal names and to recommend improvements to the basic system approach to soliciting user queries and searching for them. The research questions addressed in the study wre: how online systems can chose searching approaches on their own that are likely to produce useful retrieval; how online systems solicit queries from users; and how users respond to an experimental online catalogue that prompts them for the different elements of their personal name queries. Improvements include: the implementation of a new design for online catalogue searching that features search trees; new methods for soliciting user queries bearing personal names; and enlisting the participation of online catalogue users in the evaluation of system prompts, instructions, and messages that request input from them

0.0053345575 = product of:
  0.016003672 = sum of:
    0.016003672 = weight(_text_:on in 6735) [ClassicSimilarity], result of:
      0.016003672 = score(doc=6735,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.14580199 = fieldWeight in 6735, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=6735)
  0.33333334 = coord(1/3)

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

0.005029469 = product of:
  0.015088406 = sum of:
    0.015088406 = weight(_text_:on in 4380) [ClassicSimilarity], result of:
      0.015088406 = score(doc=4380,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.13746344 = fieldWeight in 4380, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.03125 = fieldNorm(doc=4380)
  0.33333334 = coord(1/3)

Abstract

We return to arguments made 10 years ago that online catalogs are difficult to use because their design does not incorporate sufficient understanding of searching behavior. The earlier article examined studies of information retrieval system searching for their implications for online catalog design; this article examines the implications of card catalog design for online catalogs. With this analysis, we hope to contribute to a better understanding of user behavior and to lay to rest the card catalog design model for online catalogs. We discuss the problems with query matching systems, which were designed for skilled search intermediaries rather than end-users, and the knowledge and skills they require in the information-seeking process, illustrated with examples of searching card and online catalogs. Searching requires conceptual knowledge of the information retrieval process - translating an information need into a searchable query; semantic knowledge of how to implement a query in a given system - the how and when to use system features; and technical skills in executing the query - basic computing skills and the syntax of entering queries as specific search statements. In the short term, we can help make online catalogs easier to use through improved training and documentation that is based on information-seeking bahavior, with the caveat that good training is not a substitute for good system design. Our long term goal should be to design intuitive systems that require a minimum of instruction. Given the complexity of the information retrieval problem and the limited capabilities of today's systems, we are far from achieving that goal. If libraries are to provide primary information services for the networked world, they need to put research results on the information-seeking process into practice in designing the next generation of online public access information retrieval systems