Search (6 results, page 1 of 1)

0.012845224 = product of:
  0.07707134 = sum of:
    0.07707134 = weight(_text_:wide in 7716) [ClassicSimilarity], result of:
      0.07707134 = score(doc=7716,freq=2.0), product of:
        0.19679762 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.044416238 = queryNorm
        0.3916274 = fieldWeight in 7716, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0625 = fieldNorm(doc=7716)
  0.16666667 = coord(1/6)

Abstract

Library users continue to experience difficulty in using the online catalog, particularly in the area of subject access. This project describes a test of a new design for subject access to online catalogs. The new design requires a wide range of subject searching capabilities and search trees to govern the system's selection of searching capabilities in response to user queries. Is the performance of search trees superior to subject searching approaches chosen at random? This project is geared to make that determination

0.011353682 = product of:
  0.06812209 = sum of:
    0.06812209 = weight(_text_:wide in 4382) [ClassicSimilarity], result of:
      0.06812209 = score(doc=4382,freq=4.0), product of:
        0.19679762 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.044416238 = queryNorm
        0.34615302 = fieldWeight in 4382, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4382)
  0.16666667 = coord(1/6)

Abstract

This article describes the findings of a research project that tested a new subject-access design in an experimental online catalog that had a wide range of subject-searching capabilities and search trees to govern the system's selection of searching capabilities in response to user queries. Library users at 2 academic libraries searched this experimental catalog for topics of their own choosing, judges the usefulness of retrieved titles, and answered post-search questions about their searching experiences. Mixed results from a quantitative analysis (i.e., precision scores) were supplemented with the more conclusive results from a qualitative analysis (i.e., failure analysis). Overall, analyses demonstrated that the new subject-access design that featured search trees was more effective in selecting a subject-searching approach that would prooduce useful information for the subjects users seek than users would select on their own. The qualitative analysis was especially helpful in providing recommendations for improving specific subject-searching approaches to increase their effenciency, increase user perseverance, and encourage browsing. It also suggested enhancements to the new subject-searching design to enable systems to respond to the wide variety of user queries for subjects

0.009633917 = product of:
  0.057803504 = sum of:
    0.057803504 = weight(_text_:wide in 5553) [ClassicSimilarity], result of:
      0.057803504 = score(doc=5553,freq=2.0), product of:
        0.19679762 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.044416238 = queryNorm
        0.29372054 = fieldWeight in 5553, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=5553)
  0.16666667 = coord(1/6)

Abstract

Search trees are sets of paths with branches or choices that enable systems to carry out the most sensible search approaches at each stage of searches. Report results of a research project, undertaken at Michigan University, which aimed to identify characteristics of the most difficult user queries and recommend enhancements to the new subject searching design to enable it to produce useful retrievals in response to the wide variety of queries users pose to online catalogues. Online catalogues governed by search trees are more effective than the users themselves in selecting subject searching approaches and the enhanced search trees described and tested enlist subject searching approaches that are not typical of the functionality of operational online catalogues. Concludes that design and development is required to upgrade existing online catalogues with search trees and new subject searching functionality to be successful in responding with useful retrievals to the most difficult user queries

0.009268723 = product of:
  0.05561234 = sum of:
    0.05561234 = weight(_text_:computer in 3679) [ClassicSimilarity], result of:
      0.05561234 = score(doc=3679,freq=4.0), product of:
        0.16231956 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.044416238 = queryNorm
        0.34261024 = fieldWeight in 3679, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.046875 = fieldNorm(doc=3679)
  0.16666667 = coord(1/6)

Abstract

Subject queries were extracted from 3 universities' online catalogues and analysed to determine the extend to which they matched subject headings in the LCSH. Computer analyses show that nearly 25% of the subject queries entered by online catalogue users are exact matches of LCSH. Yet, manual analyses show that, even though a user matches or closely matches LCSH-mr, the citations retrieved by this vocabulary are not necessarily satisfactory. Sometimes the closest LCSH-mr is not at all pertinent to a user's topic of interest. This study presents reasons why close matches of LCSH-mr are not always satisfactory and suggests approaches to finding the best matches of the catalogue's controlled vocabulary

0.008738637 = product of:
  0.05243182 = sum of:
    0.05243182 = weight(_text_:computer in 2101) [ClassicSimilarity], result of:
      0.05243182 = score(doc=2101,freq=2.0), product of:
        0.16231956 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.044416238 = queryNorm
        0.32301605 = fieldWeight in 2101, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.0625 = fieldNorm(doc=2101)
  0.16666667 = coord(1/6)

Abstract

A prototype expert system for the computer science section (QA75 to QA76.95) of Library of Congress Classification was built using the Mahogany Professional expert system shell. The prototype demonstrates an expert systes application in which the system is enlisted as an intelligent job aid to assist users during the actual performance of shelflisting

0.0030088935 = product of:
  0.01805336 = sum of:
    0.01805336 = product of:
      0.03610672 = sum of:
        0.03610672 = weight(_text_:22 in 1333) [ClassicSimilarity], result of:
          0.03610672 = score(doc=1333,freq=2.0), product of:
            0.1555381 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.044416238 = queryNorm
            0.23214069 = fieldWeight in 1333, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=1333)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Date

10. 9.2000 17:38:22