Search (2 results, page 1 of 1)

0.025387865 = product of:
  0.05077573 = sum of:
    0.026868545 = weight(_text_:information in 1772) [ClassicSimilarity], result of:
      0.026868545 = score(doc=1772,freq=10.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.3035872 = fieldWeight in 1772, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1772)
    0.023907183 = product of:
      0.047814365 = sum of:
        0.047814365 = weight(_text_:22 in 1772) [ClassicSimilarity], result of:
          0.047814365 = score(doc=1772,freq=2.0), product of:
            0.17654699 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050415643 = queryNorm
            0.2708308 = fieldWeight in 1772, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1772)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

Library OPACs have long been the gateways between users and information. They present to users the achievements of library automation, and are the most widely available automated retrieval systems and the first that many user encounter. Current trends in OPAC design are toward a user oriented, individual information service which can meet the different needs of users with a variety of background and interests. Compared with the rather inactive, short term and general information service of conventional systems, this type of system focuses on active, long term and personalized service. Proposes a framework for the design of such an OPAC and discusses some recent developments in personalized information service

Date

4. 8.1998 19:36:22

0.0030344925 = product of:
  0.01213797 = sum of:
    0.01213797 = weight(_text_:information in 587) [ClassicSimilarity], result of:
      0.01213797 = score(doc=587,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13714671 = fieldWeight in 587, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=587)
  0.25 = coord(1/4)

Abstract

Subject content analysis of Web query terms is essential to understand Web searching interests. Such analysis includes exploring search topics and observing changes in their frequency distributions with time. To provide a basis for in-depth analysis of users' search interests on a larger scale, this article presents a query categorization approach to automatically classifying Web query terms into broad subject categories. Because a query is short in length and simple in structure, its intended subject(s) of search is difficult to judge. Our approach, therefore, combines the search processes of real-world search engines to obtain highly ranked Web documents based on each unknown query term. These documents are used to extract cooccurring terms and to create a feature set. An effective ranking function has also been developed to find the most appropriate categories. Three search engine logs in Taiwan were collected and tested. They contained over 5 million queries from different periods of time. The achieved performance is quite encouraging compared with that of human categorization. The experimental results demonstrate that the approach is efficient in dealing with large numbers of queries and adaptable to the dynamic Web environment. Through good integration of human and machine efforts, the frequency distributions of subject categories in response to changes in users' search interests can be systematically observed in real time. The approach has also shown potential for use in various information retrieval applications, and provides a basis for further Web searching studies.

Source

Journal of the American Society for Information Science and technology. 53(2002) no.8, S.617-630