Search (7 results, page 1 of 1)

  • × author_ss:"Larson, R.R."
  1. Larson, R.R.: Information retrieval systems (2009) 0.06
    0.05551693 = product of:
      0.08327539 = sum of:
        0.04025957 = weight(_text_:search in 3817) [ClassicSimilarity], result of:
          0.04025957 = score(doc=3817,freq=2.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.230407 = fieldWeight in 3817, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=3817)
        0.043015826 = product of:
          0.08603165 = sum of:
            0.08603165 = weight(_text_:engines in 3817) [ClassicSimilarity], result of:
              0.08603165 = score(doc=3817,freq=2.0), product of:
                0.25542772 = queryWeight, product of:
                  5.080822 = idf(docFreq=746, maxDocs=44218)
                  0.05027291 = queryNorm
                0.33681408 = fieldWeight in 3817, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  5.080822 = idf(docFreq=746, maxDocs=44218)
                  0.046875 = fieldNorm(doc=3817)
          0.5 = coord(1/2)
      0.6666667 = coord(2/3)
    
    Abstract
    Information retrieval (IR) systems aim to select relevant material from large collections of information in response to user queries. The approaches used to accomplish this have been the focus of much research and development over the past 50 years, and have led to the algorithms underlying many commercial and Web-based search engines today. This entry describes the common components that go into the design of IR systems (from text processing to inverted file indexes). The major classes (or models) of retrieval algorithms (Boolean, vector, and probabilistic) are described along with formal definitions of the basic form of these algorithms and some of the variations in common use in IR research. In addition, the entry examines query expansion techniques, and in particular relevance feedback, and how they are used in IR systems.
  2. Larson, R.R.: Evaluation of advanced retrieval techniques in an experimental online catalog (1992) 0.02
    0.023243874 = product of:
      0.06973162 = sum of:
        0.06973162 = weight(_text_:search in 481) [ClassicSimilarity], result of:
          0.06973162 = score(doc=481,freq=6.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.39907667 = fieldWeight in 481, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=481)
      0.33333334 = coord(1/3)
    
    Abstract
    Research on the use and users of online catalogs conducted in the early 1980s found that subject searches were the most common form of online catalog search. At the same time, many of the problems experienced by online catalog users have been traced to difficulties with the subject access mechanisms of the online catalog. Numerous proposals have been made for methods intended to improve subject access to online catalog records. These commonly involve enhancing the catalog's bibliographic records with additional terms, or incorporating subject authority files or additional thesauri in the database. Another stream of research has concentrated on applying retrieval techniques derived from information retrieval (IR) research to replace the Boolean search methods of conventional online catalog systems. This study describes the results of retrieval tests using a variety of these search methods in the CHESHIRE experimental online catalog system.
  3. Larson, R.R.: ¬The decline of subject searching : long-term trends and patterns of index use in an online catalog (1991) 0.02
    0.023243874 = product of:
      0.06973162 = sum of:
        0.06973162 = weight(_text_:search in 1104) [ClassicSimilarity], result of:
          0.06973162 = score(doc=1104,freq=6.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.39907667 = fieldWeight in 1104, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=1104)
      0.33333334 = coord(1/3)
    
    Abstract
    Search index usage in a large university online catalog system over a six-year period (representing about 15,3 million searches) was investigated using transaction monitor data. Mathematical models of trends and patterns in the data were developed and tested using regression techniques. The results of the analyses show a consistent decline in the frequency of subject index use by online catalog users, with a corresponding increase in the frequency of title keyword searching. Significant annual patterns in index usage were also identified. Analysis of the transaction data, and related previous studies of online catalog users, suggest a number of factors contributing to the decline in subject search frequency. Chief among these factors are user difficulties in formulating subject queries with LCSH, leading to search failure, and the problem of "information overload" as database size increases. This article presents the models and results of the transaction log analysis, discusses the underlying problems with subject searching contributing to the observed decline, and reviews some proposed improvements to online catalog systems to aid in overcoming these problems
  4. Larson, R.R.; McDonough, J.; O'Leary, P.; Kuntz, L.: Cheshire II : designing a next-generation online catalog (1996) 0.02
    0.017893143 = product of:
      0.053679425 = sum of:
        0.053679425 = weight(_text_:search in 4384) [ClassicSimilarity], result of:
          0.053679425 = score(doc=4384,freq=2.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.30720934 = fieldWeight in 4384, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0625 = fieldNorm(doc=4384)
      0.33333334 = coord(1/3)
    
    Abstract
    The Cheshire II online catalog system was designed to provide a bridge between th realms of purely bibliographical information and the rapidly expanding full-text and multimedia collections available online. It is based on a number of national and international standards for data description, communication, and interface technology. The system uses a client-server architecture with X window client communication with an SGML-based probabilistic search engine using the Z39.50 information retrieval protocol
  5. Larson, R.R.: Classification clustering, probabilistic information retrieval, and the online catalog (1991) 0.02
    0.015656501 = product of:
      0.0469695 = sum of:
        0.0469695 = weight(_text_:search in 1070) [ClassicSimilarity], result of:
          0.0469695 = score(doc=1070,freq=2.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.2688082 = fieldWeight in 1070, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1070)
      0.33333334 = coord(1/3)
    
    Abstract
    Research into online catalog use and users has found some pervasive problems with subject searching in these systems. Subject searches too often fail to retrieve anything, and those that do succeed often retrieve "too much" material. This article examnies these problems and how they might be remedied. The theoretical principles for the design of effective information retrieval systems are discussed, and an experimental online catalog system based on these principles is described. The system, CHESHIRE, uses a method called "classification clustering", combined with probabilistic retrieval techniques, to provide natural language searching (which helps to reduce search failure) and to provide effective control of "information overload" in subject searching
  6. Larson, R.R.: Bibliometrics of the World Wide Web : an exploratory analysis of the intellectual structure of cyberspace (1996) 0.02
    0.015656501 = product of:
      0.0469695 = sum of:
        0.0469695 = weight(_text_:search in 7334) [ClassicSimilarity], result of:
          0.0469695 = score(doc=7334,freq=2.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.2688082 = fieldWeight in 7334, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7334)
      0.33333334 = coord(1/3)
    
    Abstract
    Examines the explosive growth and the bibliometrics of the WWW based on both analysis of over 30 GBytes of WWW pages collected by the Inktomi Web Crawler and on the use of the DEC AltaVista search engine for cocitation analysis of a set of Earth Science related WWW sites. Examines the statistical characteristics of web documents and their links, and the characteristics of highly cited web documents
  7. Larson, R.R.: Experiments in automatic Library of Congress Classification (1992) 0.01
    0.013419857 = product of:
      0.04025957 = sum of:
        0.04025957 = weight(_text_:search in 1054) [ClassicSimilarity], result of:
          0.04025957 = score(doc=1054,freq=2.0), product of:
            0.1747324 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.05027291 = queryNorm
            0.230407 = fieldWeight in 1054, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=1054)
      0.33333334 = coord(1/3)
    
    Abstract
    This article presents the results of research into the automatic selection of Library of Congress Classification numbers based on the titles and subject headings in MARC records. The method used in this study was based on partial match retrieval techniques using various elements of new recors (i.e., those to be classified) as "queries", and a test database of classification clusters generated from previously classified MARC records. Sixty individual methods for automatic classification were tested on a set of 283 new records, using all combinations of four different partial match methods, five query types, and three representations of search terms. The results indicate that if the best method for a particular case can be determined, then up to 86% of the new records may be correctly classified. The single method with the best accuracy was able to select the correct classification for about 46% of the new records.