Search (3 results, page 1 of 1)

0.029046709 = product of:
  0.07261677 = sum of:
    0.051497146 = weight(_text_:study in 88) [ClassicSimilarity], result of:
      0.051497146 = score(doc=88,freq=4.0), product of:
        0.1448085 = queryWeight, product of:
          3.2514048 = idf(docFreq=4653, maxDocs=44218)
          0.044537213 = queryNorm
        0.3556224 = fieldWeight in 88, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2514048 = idf(docFreq=4653, maxDocs=44218)
          0.0546875 = fieldNorm(doc=88)
    0.021119623 = product of:
      0.042239245 = sum of:
        0.042239245 = weight(_text_:22 in 88) [ClassicSimilarity], result of:
          0.042239245 = score(doc=88,freq=2.0), product of:
            0.15596174 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.044537213 = queryNorm
            0.2708308 = fieldWeight in 88, 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=88)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

This paper presents a study conducted at the University of Colorado at Boulder (CU-Boulder) to assess the extent to which its catalogers were using Classification Web (Class Web), the subscription-based, online cataloging documentation resource provided by the Library of Congress. In addition, this paper will explore assumptions made by management regarding CU-Boulder catalogers' use of the product, possible reasons for the lower-than-expected use, and recommendations for promoting a more efficient and cost-effective use of Class Web at other institutions similar to CU-Boulder.

Date

10. 9.2000 17:38:22

0.024931317 = product of:
  0.062328294 = sum of:
    0.026009986 = weight(_text_:study in 5969) [ClassicSimilarity], result of:
      0.026009986 = score(doc=5969,freq=2.0), product of:
        0.1448085 = queryWeight, product of:
          3.2514048 = idf(docFreq=4653, maxDocs=44218)
          0.044537213 = queryNorm
        0.17961644 = fieldWeight in 5969, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2514048 = idf(docFreq=4653, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5969)
    0.03631831 = product of:
      0.07263662 = sum of:
        0.07263662 = weight(_text_:teaching in 5969) [ClassicSimilarity], result of:
          0.07263662 = score(doc=5969,freq=2.0), product of:
            0.24199244 = queryWeight, product of:
              5.433489 = idf(docFreq=524, maxDocs=44218)
              0.044537213 = queryNorm
            0.30016068 = fieldWeight in 5969, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.433489 = idf(docFreq=524, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5969)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Abstract

Much literature has been written speculating upon how classification can be used in online catalogs to improve information retrieval. While some empirical studies have been done exploring whether the direct use of traditional classification schemes designed for a manual environment is effective and efficient in the online environment, none has manipulated these manual classifications in such a w ay as to take full advantage of the power of both the classification and computer. It has been suggested by some authors, such as Wajenberg and Drabenstott, that this power could be realized if the individual components of synthesized DDC numbers could be identified and indexed. This paper looks at the feasibility of automatically decomposing DDC synthesized numbers and the implications of such decomposition for information retrieval. Based on an analysis of the instructions for synthesizing numbers in the main class Arts (700) and all DDC Tables, 17 decomposition rules were defined, 13 covering the Add Notes and four the Standard Subdivisions. 1,701 DDC synthesized numbers were decomposed by a computer system called DND (Dewey Number Decomposer), developed by the author. From the 1,701 numbers, 600 were randomly selected fo r examination by three 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, enhancing classifiers' work, teaching library school students, and providing quality control for DDC number assignments. These implications were explored using a prototype retrieval system.

0.008299059 = product of:
  0.020747647 = sum of:
    0.01471347 = weight(_text_:study in 2047) [ClassicSimilarity], result of:
      0.01471347 = score(doc=2047,freq=4.0), product of:
        0.1448085 = queryWeight, product of:
          3.2514048 = idf(docFreq=4653, maxDocs=44218)
          0.044537213 = queryNorm
        0.1016064 = fieldWeight in 2047, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2514048 = idf(docFreq=4653, maxDocs=44218)
          0.015625 = fieldNorm(doc=2047)
    0.0060341777 = product of:
      0.012068355 = sum of:
        0.012068355 = weight(_text_:22 in 2047) [ClassicSimilarity], result of:
          0.012068355 = score(doc=2047,freq=2.0), product of:
            0.15596174 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.044537213 = queryNorm
            0.07738023 = fieldWeight in 2047, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.015625 = fieldNorm(doc=2047)
      0.5 = coord(1/2)
  0.4 = coord(2/5)

Date

2. 1.2004 10:35:22

Footnote

SELVI (Knowledge Classification of Digital Information Materials with Special Reference to Clustering Technique) finds that it is essential to classify digital material since the amount of material that is becoming available is growing. Selvi suggests using automated classification to "group together those digital information materials or documents that are "most similar" (p. 65). This can be attained by using Cluster analysis methods. PRADHAN and THULASI (A Study of the Use of Classification and Indexing Systems by Web Resource Directories) compare and contrast the classificatory structures of Google, Yahoo, and Looksmart's directories and compare the directories to Dewey Decimal Classification, Library of Congress Classification and Colon Classification's classificatory structures. They find differentes between the directories' and the bibliographic classification systems' classificatory structures and principles. These differentes stem from the fact that bibliographic classification systems are used to "classify academic resources for the research community" (p. 83) and directories "aim to categorize a wider breath of information groups, entertainment, recreation, govt. information, commercial information" (p. 83). NEELAMEGHAN (Hierarchy, Hierarchical Relation and Hierarchical Arrangement) reviews the concept of hierarchy and the formation of hierarchical structures across a variety of domains. NEELAMEGHAN and PRADAD (Digitized Schemes for Subject Classification and Thesauri: Complementary Roles) demonstrate how thesaural relationships (NT, BT, and RT) can be applied to a classification scheme, the Colon Classification in this Gase. NEELAMEGHAN and ASUNDI (Metadata Framework for Describing Embodied Knowledge and Subject Content) propose to use the Generalized Facet Structure framework which is based an Ranganathan's General Theory of Knowledge Classification as a framework for describing the content of documents in a metadata element set for the representation of web documents. CHUDAMANI (Classified Catalogue as a Tool for Subject Based Information Retrieval in both Traditional and Electronic Library Environment) explains why the classified catalogue is superior to the alphabetic cata logue and argues that the same is true in the digital environment.
PARAMESWARAN (Classification and Indexing: Impact of Classification Theory an PRECIS) reviews the PRECIS system and finds that "it Gould not escape from the impact of the theory of classification" (p. 131). The author further argues that the purpose of classification and subject indexing is the same and that both approaches depends an syntax. This leads to the conclusion that "there is an absolute syntax as the Indian theory of classification points out" (p. 131). SATYAPAL and SANJIVINI SATYAPAL (Classifying Documents According to Postulational Approach: 1. SA TSAN- A Computer Based Learning Package) and SATYAPAL and SANJIVINI SATYAPAL (Classifying Documents According to Postulational Approach: 2. Semi-Automatic Synthesis of CC Numbers) present an application to automate classification using a facet classification system, in this Gase, the Colon Classification system. GAIKAIWARI (An Interactive Application for Faceted Classification Systems) presents an application, called SRR, for managing and using a faceted classification scheme in a digital environment. IYER (Use of Instructional Technology to Support Traditional Classroom Learning: A Case Study) describes a course an "Information and Knowledge Organization" that she teaches at the University at Albany (SUNY). The course is a conceptual course that introduces the student to various aspects of knowledge organization. GOPINATH (Universal Classification: How can it be used?) lists fifteen uses of universal classifications and discusses the entities of a number of disciplines. GOPINATH (Knowledge Classification: The Theory of Classification) briefly reviews the foundations for research in automatic classification, summarizes the history of classification, and places Ranganathan's thought in the history of classification.