Search (48 results, page 3 of 3)

0.0056292685 = product of:
  0.016887804 = sum of:
    0.016887804 = product of:
      0.03377561 = sum of:
        0.03377561 = weight(_text_:system in 5164) [ClassicSimilarity], result of:
          0.03377561 = score(doc=5164,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.20878783 = fieldWeight in 5164, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=5164)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The first studies of online catalog use demonstrated that the problems of too many and too few retrievals plagued the earliest online catalog users. Despite 15 years of system development, implementation, and evaluation, these problems still adversely affect the subject searches of today's online catalog users. In fact, the large-retrievals problem has grown more acute due to the growth of online catalog databases. This paper explores the use of library classifications for consolidating and summarizing high-posted subject searches and for handling subject searches that result in no or too few retrievals. Findings are presented in the form of generalization about retrievals and library classifications, needed improvements to classification terminology, and suggestions for improved functionality to facilitate the display of retrieved titles in online catalogs

0.0056292685 = product of:
  0.016887804 = sum of:
    0.016887804 = product of:
      0.03377561 = sum of:
        0.03377561 = weight(_text_:system in 3) [ClassicSimilarity], result of:
          0.03377561 = score(doc=3,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.20878783 = fieldWeight in 3, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=3)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Summarizes some experiences of the application of the priciples and postulates of S.R. Ranganathan's General Theory of Knowledge Classification, incorporating the freely faceted approach and analytico synthetic methods, to the design and development of specialized databases, including indexing, user interfaces and retrieval. Enumerates some of the earlier instances of the facet method in machine based systems, beginning with Hollerith's punched card system for the data processing of the US Census. Elaborates on Ranganathan's holistic approach to information systems and services provided by his normative principles. Notes similarities between the design of databases and faceted classification systems. Examples from working systems are given to demonstrate the usefulness of selected canons and principles of classification and the analytico synthetic methodology to database design. The examples are mostly operational database systems developed using Unesco's Micro CDS-ISIS software

0.0056292685 = product of:
  0.016887804 = sum of:
    0.016887804 = product of:
      0.03377561 = sum of:
        0.03377561 = weight(_text_:system in 4429) [ClassicSimilarity], result of:
          0.03377561 = score(doc=4429,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.20878783 = fieldWeight in 4429, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=4429)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The application of classification schemes and thesauri to improve online information retrieval can be traced back to the beginnings of online searching itself, but the true potential for using knowledge structures in the user interface has yet to be realized. View-based searching seeks to exploit the classified arrangements in thesauri and existing classification schemes to improve the performance of such systems. HIBROWSE for EMBASE is a system which demonstrates the power of applying an approach to information retrieval which is strongly related to faceted classification. It does this by employing a point a click user interface with mutually constraining views utilising knowledge structure hierarchies for both query specification and the presentation of results. The relevance of this approach to library OPACs is discussed in the context of the digital library, concluding that out legacy of research in classification and indexing is more relevant than ever in the design of systems to cope with the problems of information access

0.0056292685 = product of:
  0.016887804 = sum of:
    0.016887804 = product of:
      0.03377561 = sum of:
        0.03377561 = weight(_text_:system in 3842) [ClassicSimilarity], result of:
          0.03377561 = score(doc=3842,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.20878783 = fieldWeight in 3842, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=3842)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Ranganathan's canons, principles, and postulates can easily confuse readers, especially because he revised and added to them in various editions of his many books. The Classification Research Group, who drew on Ranganathan's work as their basis for classification theory but developed it in their own way, has never clearly organized all their equivalent canons and principles. In this article Spiteri gathers the fundamental rules from both systems and compares and contrasts them. She makes her own clearer set of principles for constructing facets, stating the subject of a document, and designing notation. Spiteri's "simplified model" is clear and understandable, but certainly not simplistic. The model does not include methods for making a faceted system, but will serve as a very useful guide in how to turn initial work into a rigorous classification. Highly recommended

0.0056292685 = product of:
  0.016887804 = sum of:
    0.016887804 = product of:
      0.03377561 = sum of:
        0.03377561 = weight(_text_:system in 5968) [ClassicSimilarity], result of:
          0.03377561 = score(doc=5968,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.20878783 = fieldWeight in 5968, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=5968)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Some empirical studies have explored the direct use of traditional classification schemes in the online environment; none has manipulated these manual classifications in such a way as to take full advantage of the power of both the classification and computer. It has been suggested that this power could be realized if the individual components of synthesized DDC numbers could be identified and indexed. Looks at the feasibility of automatically decomposing DDC synthesized numbers and the implications of such decompositions for informational retrieval. 1.701 sythesized numbers were decomposed by a computer system called DND (Dewey Number Decomposer). 600 were randomly selected for examination by 3 judges, each evaluating 200 numbers. The decomposition success rate was 100% and it was concluded that synthesized DDC numbers can be accurately decomposed automatically. The study has implications for information retrieval, expert systems for assigning DDC numbers, automatic indexing, switching language development and other important areas of cataloguing and classification

0.0056292685 = product of:
  0.016887804 = sum of:
    0.016887804 = product of:
      0.03377561 = sum of:
        0.03377561 = weight(_text_:system in 492) [ClassicSimilarity], result of:
          0.03377561 = score(doc=492,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.20878783 = fieldWeight in 492, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=492)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.0056292685 = product of:
  0.016887804 = sum of:
    0.016887804 = product of:
      0.03377561 = sum of:
        0.03377561 = weight(_text_:system in 726) [ClassicSimilarity], result of:
          0.03377561 = score(doc=726,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.20878783 = fieldWeight in 726, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=726)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

This article gives a cheerfully brief and undetailed account of how to make a faceted classification system, then describes information retrieval and searching on the web. It concludes by saying that facets would be excellent in helping users search and browse the web, but offers no real clues as to how this can be done.

0.0037528453 = product of:
  0.011258536 = sum of:
    0.011258536 = product of:
      0.022517072 = sum of:
        0.022517072 = weight(_text_:system in 4468) [ClassicSimilarity], result of:
          0.022517072 = score(doc=4468,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.13919188 = fieldWeight in 4468, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.03125 = fieldNorm(doc=4468)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The physical organisation of items on library shelves using any classification scheme is inevitable a compromise. The best efforts to achieve an arrangement that is helpful to users will be thwarted by the multifaceted nature of these items and the specific needs of the user and the library. Items on a particular subject will be scattered throughout the library building(s) across disciplines, by physical form, by frequency of use and whether and for how long they may be borrowed. Even thought he rich information content of multifaceted items may be represented in the notation, the items required by a user will be scattered across library shelves when the item is placed in a single relative location. This paper explores these issues uisng examples from a University Library classified using the DDC. The electronic context of the library OPAC can transcend the constraints imposed by the predominantly physical nature of library collections, yet the current use of classification schemes in on-line systems retains many of these limitations. Examples of such systems applying DDC on the WWW are discussed and compared with a system that seeks to use DDC in what is called view-based searching. The interface and the resulting browsing and searching capability of a view-based OPAC are described. Ways in which subject access to library collections can be improved and disciplinary scatter resolved by assigning multiple class number to items and exploiting the rich Dewey structure in a faceted form are discussed. It is suggested that the informative power of visual classificatory structures at the search interface will be beneficial to the broader learning experience of the user. The paper concludes that the application of classification schemes in electronic interfaces should not be bound by the the physical constraints that no longer apply in an electronic context but be exploited to provide a complete, flexible and individual interface as determined by the needs of each user