Search (5 results, page 1 of 1)

0.0064603165 = product of:
  0.05814285 = sum of:
    0.05814285 = weight(_text_:techniques in 1528) [ClassicSimilarity], result of:
      0.05814285 = score(doc=1528,freq=2.0), product of:
        0.17065717 = queryWeight, product of:
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.038739666 = queryNorm
        0.3406997 = fieldWeight in 1528, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.405231 = idf(docFreq=1467, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1528)
  0.11111111 = coord(1/9)

Abstract

Statistical methods for automated document indexing are becoming an alternative to the manual assignment of keywords. We argue that the quality of the thesaurus used as a basis for indexing in regard to its ability to adequately cover the contents to be indexed and as a basis for the specific indexing method used is of crucial importance in automatic indexing. We present an interactive tool for thesaurus evaluation that is based on a combination of statistical measures and appropriate visualisation techniques that supports the detection of potential problems in a thesaurus. We describe the methods used and show that the tool supports the detection and correction of errors, leading to a better indexing result.

0.0017586944 = product of:
  0.01582825 = sum of:
    0.01582825 = weight(_text_:information in 3301) [ClassicSimilarity], result of:
      0.01582825 = score(doc=3301,freq=8.0), product of:
        0.06800663 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.038739666 = queryNorm
        0.23274569 = fieldWeight in 3301, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3301)
  0.11111111 = coord(1/9)

Abstract

The federal system in Germany has created a segmented library landscape. Instead of a central entity responsible for cataloguing and indexing, regional library unions share the workload cooperatively among their members. One result of this approach is limited sharing of cataloguing and indexing information across union catalogues as well as heterogeneous indexing of items with almost equivalent content: different editions of the same work. In this paper, a method for clustering entries in library catalogues is proposed that can be used to reduce this heterogeneity as well as share indexing information across catalogue boundaries. In two experiments, the method is applied to several union catalogues and the results show that a surprisingly large number of previously not indexed entries can be enriched with indexing information. The quality of the indexing has been positively evaluated by human professionals and the results have already been imported into the production catalogues of two library unions.

0.0017495634 = product of:
  0.01574607 = sum of:
    0.01574607 = product of:
      0.03149214 = sum of:
        0.03149214 = weight(_text_:22 in 3051) [ClassicSimilarity], result of:
          0.03149214 = score(doc=3051,freq=2.0), product of:
            0.13565971 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.038739666 = queryNorm
            0.23214069 = fieldWeight in 3051, 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=3051)
      0.5 = coord(1/2)
  0.11111111 = coord(1/9)

Date

22. 8.2009 19:51:28

8.793472E-4 = product of:
  0.007914125 = sum of:
    0.007914125 = weight(_text_:information in 558) [ClassicSimilarity], result of:
      0.007914125 = score(doc=558,freq=2.0), product of:
        0.06800663 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.038739666 = queryNorm
        0.116372846 = fieldWeight in 558, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=558)
  0.11111111 = coord(1/9)

Content

Masterarbeit im Rahmen des postgradualen Fernstudiums Master of Arts (Library and Information Science)

8.793472E-4 = product of:
  0.007914125 = sum of:
    0.007914125 = weight(_text_:information in 3131) [ClassicSimilarity], result of:
      0.007914125 = score(doc=3131,freq=2.0), product of:
        0.06800663 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.038739666 = queryNorm
        0.116372846 = fieldWeight in 3131, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3131)
  0.11111111 = coord(1/9)

Abstract

Ist der Medienbestand einer Informationseinrichtung klassifikatorisch erschlossen, kann diese Information auf vielfältige Weise verwendet werden: Die hierarchische Struktur eines Klassifikationssystems kann mit Hilfe eines geeigneten Notationssystems als Basis für die Signaturvergabe genutzt werden und so die Anordnung der physischen Medien in Regalen inhaltlich strukturieren. In Katalogen und anderen Suchsystemen dienen Klassifikationssysteme als systematischer Zugang, zur inhaltlichen Eingrenzung von Treffermengen oder als Hilfsmittel, um thematisch verwandte Medien zu einem vorhandenen Medium zu finden. Etliche Visualisierungsmethoden bauen ebenfalls auf hierarchischen Strukturen von Klassifikationssystemen auf und können für eine Analyse der inhaltlichen Zusammensetzung von (Teil-)Beständen oder Treffermengen eingesetzt werden. In diesem Kapitel werden diese unterschiedlichen Anwendungsgebiete vorgestellt und anhand von Beispielen aus der Praxis erläutert.