Search (21 results, page 1 of 2)

0.041438706 = product of:
  0.24863222 = sum of:
    0.09184868 = weight(_text_:informatik in 1545) [ClassicSimilarity], result of:
      0.09184868 = score(doc=1545,freq=12.0), product of:
        0.1662844 = queryWeight, product of:
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.032588977 = queryNorm
        0.552359 = fieldWeight in 1545, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          5.1024737 = idf(docFreq=730, maxDocs=44218)
          0.03125 = fieldNorm(doc=1545)
    0.15678355 = weight(_text_:monographien in 1545) [ClassicSimilarity], result of:
      0.15678355 = score(doc=1545,freq=12.0), product of:
        0.21725276 = queryWeight, product of:
          6.666449 = idf(docFreq=152, maxDocs=44218)
          0.032588977 = queryNorm
        0.72166425 = fieldWeight in 1545, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          6.666449 = idf(docFreq=152, maxDocs=44218)
          0.03125 = fieldNorm(doc=1545)
  0.16666667 = coord(2/12)

Classification

ST 271 Informatik / Monographien / Software und -entwicklung / Datenbanken, Datenbanksysteme, Data base management, Informationssysteme / Einzelne Datenbanksprachen und Datenbanksysteme
ST 270 Informatik / Monographien / Software und -entwicklung / Datenbanken, Datenbanksysteme, Data base management, Informationssysteme
ST 304 Informatik / Monographien / Künstliche Intelligenz / Automatisches Programmieren, Deduction and theorem proving, Wissensrepräsentation

RVK

ST 271 Informatik / Monographien / Software und -entwicklung / Datenbanken, Datenbanksysteme, Data base management, Informationssysteme / Einzelne Datenbanksprachen und Datenbanksysteme
ST 270 Informatik / Monographien / Software und -entwicklung / Datenbanken, Datenbanksysteme, Data base management, Informationssysteme
ST 304 Informatik / Monographien / Künstliche Intelligenz / Automatisches Programmieren, Deduction and theorem proving, Wissensrepräsentation

0.010431945 = product of:
  0.06259167 = sum of:
    0.051553283 = weight(_text_:systeme in 374) [ClassicSimilarity], result of:
      0.051553283 = score(doc=374,freq=2.0), product of:
        0.17439179 = queryWeight, product of:
          5.3512506 = idf(docFreq=569, maxDocs=44218)
          0.032588977 = queryNorm
        0.2956176 = fieldWeight in 374, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3512506 = idf(docFreq=569, maxDocs=44218)
          0.0390625 = fieldNorm(doc=374)
    0.011038392 = product of:
      0.022076784 = sum of:
        0.022076784 = weight(_text_:22 in 374) [ClassicSimilarity], result of:
          0.022076784 = score(doc=374,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.19345059 = fieldWeight in 374, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=374)
      0.5 = coord(1/2)
  0.16666667 = coord(2/12)

Abstract

Beschäftigt man sich mit Inhaltserschließung, so sind zunächst zwei Dimensionen zu unterscheiden - die Wissensorganisationssysteme selbst (z. B. Normdateien, Thesauri, Schlagwortsprachen, Klassifikationen und Ontologien) und die Metadaten für Dokumente, die mit diesen Wissensorganisationssystemen erschlossen sind. Beides steht in einer Wechselwirkung zueinander: Die Wissensorganisationssysteme sind die Werkzeuge für die Erschließungsarbeit und bilden die Grundlage für die Erstellung konkreter Erschließungsmetadaten. Die praktische Anwendung der Wissensorganisationssysteme in der Erschließung wiederum ist die Basis für deren Pflege und Weiterentwicklung. Zugleich haben Wissensorganisationssysteme auch einen Eigenwert unabhängig von den Erschließungsmetadaten für einzelne Dokumente, indem sie bestimmte Bereiche von Welt- oder Fachwissen modellartig abbilden. Will man nun Aussagen über die Qualität von inhaltlicher Erschließung treffen, so genügt es nicht, den Input - also die Wissensorganisationssysteme und die damit generierten Metadaten - zu betrachten. Man muss auch den Output betrachten, also das, was die Recherchewerkzeuge daraus machen und was folglich bei den Nutzer:innen konkret ankommt. Im vorliegenden Beitrag werden Überlegungen zur Qualität von Recherchewerkzeugen in diesem Bereich angestellt - gewissermaßen als Fortsetzung und Vertiefung der dazu im Thesenpapier des Expertenteams RDA-Anwendungsprofil für die verbale Inhaltserschließung (ET RAVI) gegebenen Hinweise. Im Zentrum steht die verbale Erschließung nach den Regeln für die Schlagwortkatalogisierung (RSWK), wie sie sich in Bibliothekskatalogen manifestiert - gleich, ob es sich dabei um herkömmliche Kataloge oder um Resource-Discovery-Systeme (RDS) handelt.

Date

24. 9.2021 12:22:02

0.0048604906 = product of:
  0.058325887 = sum of:
    0.058325887 = weight(_text_:systeme in 753) [ClassicSimilarity], result of:
      0.058325887 = score(doc=753,freq=4.0), product of:
        0.17439179 = queryWeight, product of:
          5.3512506 = idf(docFreq=569, maxDocs=44218)
          0.032588977 = queryNorm
        0.33445317 = fieldWeight in 753, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.3512506 = idf(docFreq=569, maxDocs=44218)
          0.03125 = fieldNorm(doc=753)
  0.083333336 = coord(1/12)

Abstract

Der 70. Band der BIPRA-Reihe beschäftigt sich mit der Qualität in der Inhaltserschließung im Kontext etablierter Verfahren und technologischer Innovationen. Treffen heterogene Erzeugnisse unterschiedlicher Methoden und Systeme aufeinander, müssen minimale Anforderungen an die Qualität der Inhaltserschließung festgelegt werden. Die Qualitätsfrage wird zurzeit in verschiedenen Zusammenhängen intensiv diskutiert und im vorliegenden Band aufgegriffen. In diesem Themenfeld aktive Autor:innen beschreiben aus ihrem jeweiligen Blickwinkel unterschiedliche Aspekte zu Metadaten, Normdaten, Formaten, Erschließungsverfahren und Erschließungspolitik. Der Band versteht sich als Handreichung und Anregung für die Diskussion um die Qualität in der Inhaltserschließung.

Content

Inhalt: Editorial - Michael Franke-Maier, Anna Kasprzik, Andreas Ledl und Hans Schürmann Qualität in der Inhaltserschließung - Ein Überblick aus 50 Jahren (1970-2020) - Andreas Ledl Fit for Purpose - Standardisierung von inhaltserschließenden Informationen durch Richtlinien für Metadaten - Joachim Laczny Neue Wege und Qualitäten - Die Inhaltserschließungspolitik der Deutschen Nationalbibliothek - Ulrike Junger und Frank Scholze Wissensbasen für die automatische Erschließung und ihre Qualität am Beispiel von Wikidata - Lydia Pintscher, Peter Bourgonje, Julián Moreno Schneider, Malte Ostendorff und Georg Rehm Qualitätssicherung in der GND - Esther Scheven Qualitätskriterien und Qualitätssicherung in der inhaltlichen Erschließung - Thesenpapier des Expertenteams RDA-Anwendungsprofil für die verbale Inhaltserschließung (ET RAVI) Coli-conc - Eine Infrastruktur zur Nutzung und Erstellung von Konkordanzen - Uma Balakrishnan, Stefan Peters und Jakob Voß Methoden und Metriken zur Messung von OCR-Qualität für die Kuratierung von Daten und Metadaten - Clemens Neudecker, Karolina Zaczynska, Konstantin Baierer, Georg Rehm, Mike Gerber und Julián Moreno Schneider Datenqualität als Grundlage qualitativer Inhaltserschließung - Jakob Voß Bemerkungen zu der Qualitätsbewertung von MARC-21-Datensätzen - Rudolf Ungváry und Péter Király Named Entity Linking mit Wikidata und GND - Das Potenzial handkuratierter und strukturierter Datenquellen für die semantische Anreicherung von Volltexten - Sina Menzel, Hannes Schnaitter, Josefine Zinck, Vivien Petras, Clemens Neudecker, Kai Labusch, Elena Leitner und Georg Rehm Ein Protokoll für den Datenabgleich im Web am Beispiel von OpenRefine und der Gemeinsamen Normdatei (GND) - Fabian Steeg und Adrian Pohl Verbale Erschließung in Katalogen und Discovery-Systemen - Überlegungen zur Qualität - Heidrun Wiesenmüller Inhaltserschließung für Discovery-Systeme gestalten - Jan Frederik Maas Evaluierung von Verschlagwortung im Kontext des Information Retrievals - Christian Wartena und Koraljka Golub Die Qualität der Fremddatenanreicherung FRED - Cyrus Beck Quantität als Qualität - Was die Verbünde zur Verbesserung der Inhaltserschließung beitragen können - Rita Albrecht, Barbara Block, Mathias Kratzer und Peter Thiessen Hybride Künstliche Intelligenz in der automatisierten Inhaltserschließung - Harald Sack

0.0034368858 = product of:
  0.04124263 = sum of:
    0.04124263 = weight(_text_:systeme in 2410) [ClassicSimilarity], result of:
      0.04124263 = score(doc=2410,freq=2.0), product of:
        0.17439179 = queryWeight, product of:
          5.3512506 = idf(docFreq=569, maxDocs=44218)
          0.032588977 = queryNorm
        0.2364941 = fieldWeight in 2410, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.3512506 = idf(docFreq=569, maxDocs=44218)
          0.03125 = fieldNorm(doc=2410)
  0.083333336 = coord(1/12)

Abstract

Das Prinzip, zur Wiedergabe eines komplexen Gegenstands mehrere Schlagwörter in Form einer Schlagwortkette zu verknüpfen, gehört zum zentralen Kern der 'Regeln für den Schlagwortkatalog' (RSWK). Während die Bildung solcher Schlagwortketten - also der Input - umfassend geregelt ist, verzichtet das Regelwerk jedoch darauf, auch für den Output nähere Vorgaben zu machen: "Die Gestaltung des Retrievals von Schlagwörtern und ihrer Anzeige im Online-Katalog" sei "Aufgabe des jeweiligen OPACs", weshalb man sich auf "einzelne Hinweise" beschränke (§ 20,1). Explizit genannt werden immerhin die "Suche nach Schlagwortketten" und das Browsing im Schlagwortkettenindex (5 20,5). Freilich ist seit langem bekannt, dass Schlagwortketten in vielen OPACs recht 'stiefmütterlich' behandelt werden. Eine aussagekräftige Bestandsaufnahme über die tatsächliche Nutzung der Schlagwortketten in aktuellen OPACs fehlte jedoch. Eine solche hat die Verfasserin im Februar 2008 unternommen. Den Hintergrund dafür bildeten die Überlegungen der vom Standardisierungsausschuss eingesetzten Ad-hoc-Arbeitsgruppe "Strategie der Sacherschließung" unter dem Vorsitz von Dr. Friedrich Geißelmann (UB Regensburg). In diesem Rahmen wurde auch über Wege diskutiert, um das große Potenzial der Schlagwortketten besser für das Retrieval nutzbar zu machen. Für die Untersuchung wurden - ohne Anspruch auf Vollständigkeit - 40 Online-Kataloge mit Schlagwortkettenfunktionalitäten analysiert. Zehn unterschiedliche Katalogsysteme waren dabei vertreten: Aleph, Allegro, Biber, Bond, Horizon, Libero, PICA, SISIS-Sunrise, Urica und Virtua. Eine Liste der betrachteten OPACs inkl. ihrer URLs und der im Folgenden verwendeten Siglen ist im Anhang zu finden. Die Darstellung stellt zwangsläufig eine Momentaufnahme dar, denn die OPACs sind natürlich keine statischen Systeme: Schon bei Abfassung des vorliegenden Beitrags im Juli 2008 waren einige Änderungen einzuarbeiten, die sich seit Februar ergeben hatten; weitere Umgestaltungen der Kataloge sind nur eine Frage der Zeit. Desungeachtet gibt die Studie einen Überblick über derzeit implementierte Funktionalitäten sowie aktuelle Trends, und ermöglicht auch das Aufzeigen von Problemfeldern und Verbesserungsmöglichkeiten.

0.0025888733 = product of:
  0.03106648 = sum of:
    0.03106648 = weight(_text_:internet in 6941) [ClassicSimilarity], result of:
      0.03106648 = score(doc=6941,freq=4.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.32290122 = fieldWeight in 6941, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6941)
  0.083333336 = coord(1/12)

Abstract

Explores the question of whether academic libraries keep up with the changes in the LCSH system. Analysis of the handling of 15 subject headings in 50 academic library catalogues available via the Internet found that libraries are not consistently maintaining subject authority control, or making syndetic references and scope notes in their catalogues. Discusses the results from the perspective of the libraries' performance, performance on the headings overall, performance on references, performance on the type of change made to the headings,a nd performance within 3 widely used onlien catalogue systems (DRA, INNOPAC and NOTIS). Discusses the implications of the findings in relationship to expressions of dissatisfaction with the effectiveness of subject cataloguing expressed by discussion groups on the Internet

0.0020709615 = product of:
  0.024851536 = sum of:
    0.024851536 = product of:
      0.049703073 = sum of:
        0.049703073 = weight(_text_:allgemein in 5567) [ClassicSimilarity], result of:
          0.049703073 = score(doc=5567,freq=2.0), product of:
            0.17123379 = queryWeight, product of:
              5.254347 = idf(docFreq=627, maxDocs=44218)
              0.032588977 = queryNorm
            0.2902644 = fieldWeight in 5567, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.254347 = idf(docFreq=627, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5567)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Theme

Katalogfragen allgemein

0.0020709615 = product of:
  0.024851536 = sum of:
    0.024851536 = product of:
      0.049703073 = sum of:
        0.049703073 = weight(_text_:allgemein in 5570) [ClassicSimilarity], result of:
          0.049703073 = score(doc=5570,freq=2.0), product of:
            0.17123379 = queryWeight, product of:
              5.254347 = idf(docFreq=627, maxDocs=44218)
              0.032588977 = queryNorm
            0.2902644 = fieldWeight in 5570, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.254347 = idf(docFreq=627, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5570)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Theme

Katalogfragen allgemein

0.0018118339 = product of:
  0.021742007 = sum of:
    0.021742007 = weight(_text_:internet in 3966) [ClassicSimilarity], result of:
      0.021742007 = score(doc=3966,freq=6.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.22598378 = fieldWeight in 3966, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03125 = fieldNorm(doc=3966)
  0.083333336 = coord(1/12)

Abstract

Organizing and providing access to the resources an the Internet has been a problem area in spite of the availability of sophisticated search engines and other Software tools. There have been several attempts to organize the resources an the WWW. Some of them have tried to use traditional library classification schemes such as the Library of Congress Classification, the Dewey Decimal Classification and others. However there is a need to assign proper subject headings to them and present them in a logical or hierarchical sequence to cater to the need for browsing. This paper attempts to describe an experimental system designed to organize and provide access to web documents using a faceted pre-coordinate indexing system based an the Deep Structure Indexing System (DSIS) derived from POPSI (Postulate based Permuted Subject Indexing) of Bhattacharyya, and the facet analysis and chain indexing System of Ranganathan. A prototype software system has been designed to create a database of records specifying Web documents according to the Dublin Core and input a faceted subject heading according to DSIS. Synonymous terms are added to the standard terms in the heading using appropriate symbols. Once the data are entered along with a description and URL of the Web document, the record is stored in the system. More than one faceted subject heading can be assigned to a record depending an the content of the original document. The system stores the surrogates and keeps the faceted subject headings separately after establishing a link. Search is carried out an index entries derived from the faceted subject heading using chain indexing technique. If a single term is input, the system searches for its presence in the faceted subject headings and displays the subject headings in a sorted sequence reflecting an organizing sequence. If the number of retrieved headings is too large (running into more than a page) then the user has the option of entering another search term to be searched in combination. The system searches subject headings already retrieved and look for those containing the second term. The retrieved faceted subject headings can be displayed and browsed. When the relevant subject heading is selected the system displays the records with their URLs. Using the URL the original document an the web can be accessed. The prototype system developed under Windows NT environment using ASP and web server is under rigorous testing. The database and indexes management routines need further development.

Theme

Internet

0.0015853548 = product of:
  0.019024257 = sum of:
    0.019024257 = weight(_text_:internet in 97) [ClassicSimilarity], result of:
      0.019024257 = score(doc=97,freq=6.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.19773582 = fieldWeight in 97, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.02734375 = fieldNorm(doc=97)
  0.083333336 = coord(1/12)

Abstract

Organizing and providing access to the resources an the Internet has been a problem area in spite of the availability of sophisticated search engines and other Software tools. There have been several attempts to organize the resources an the World Wide Web. Some of them have tried to use traditional library classification schemes such as the Library of Congress Classification, the Dewey Decimal Classification and others. However there is a need to assign proper subject headings to them and present them in a logical or hierarchical sequence to cater to the need for browsing. This paper attempts to describe an experimental system designed to organize and provide access to web documents using a faceted pre-coordinate indexing system based an the Deep Structure Indexing System (DSIS) derived from POPSI (Postulate based Permuted Subject Indexing) of Bhattacharyya, and the facet analysis and chain indexing system of Ranganathan. A prototype Software System has been designed to create a database of records specifying Web documents according to the Dublin Core and to input a faceted subject heading according to DSIS. Synonymous terms are added to the Standard terms in the heading using appropriate symbols. Once the data are entered along with a description and the URL of the web document, the record is stored in the System. More than one faceted subject heading can be assigned to a record depending an the content of the original document. The System stores the Surrogates and keeps the faceted subject headings separately after establishing a link. The search is carried out an index entries derived from the faceted subject heading using the chain indexing technique. If a single term is Input, the System searches for its presence in the faceted subject headings and displays the subject headings in a sorted sequence reflecting an organizing sequence. If the number of retrieved Keadings is too large (running into more than a page) the user has the option of entering another search term to be searched in combination. The System searches subject headings already retrieved and looks for those containing the second term. The retrieved faceted subject headings can be displayed and browsed. When the relevant subject heading is selected the system displays the records with their URLs. Using the URL, the original document an the web can be accessed. The prototype system developed in a Windows NT environment using ASP and a web server is under rigorous testing. The database and Index management routines need further development.

Theme

Internet

0.0015690941 = product of:
  0.01882913 = sum of:
    0.01882913 = weight(_text_:internet in 2322) [ClassicSimilarity], result of:
      0.01882913 = score(doc=2322,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1957077 = fieldWeight in 2322, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=2322)
  0.083333336 = coord(1/12)

Abstract

The introduction of computerized post-coordination has solved many of the problems of pre-coordinated subject access. However, the adoption of computerized post-coordination results in the loss of some pre-coordination benefits. Specifically, the effect of hiding terms within the context of others is lost in post-coodination which give lead status to every document term. This results in spurious matches of terms out of context. Library patrons and Internet searchers are increasingly dissatisfied with subject access performance, in part because of unmanageably large retrieval sets. The need to enhance precision and limit the size of retrieval sets motivates this work which proposes partial coordination, an approach which incorporates the advantages of computer search with the ability of pre-coordination to limit spurious partial matches and thereby enhance precision

0.0014717856 = product of:
  0.017661426 = sum of:
    0.017661426 = product of:
      0.035322852 = sum of:
        0.035322852 = weight(_text_:22 in 3734) [ClassicSimilarity], result of:
          0.035322852 = score(doc=3734,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.30952093 = fieldWeight in 3734, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=3734)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Source

Searcher. 3(1995) no.8, S.18-22

0.0013075785 = product of:
  0.015690941 = sum of:
    0.015690941 = weight(_text_:internet in 96) [ClassicSimilarity], result of:
      0.015690941 = score(doc=96,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.16308975 = fieldWeight in 96, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0390625 = fieldNorm(doc=96)
  0.083333336 = coord(1/12)

Abstract

The paper looks at ways in which traditional classification and indexing tools have dealt with the relationships between constituent terms; variations in these are examined and compared with the methods used in machine searching, particularly of the Internet and World Wide Web. Apparent correspondences with features of index languages are identified, and further methods of applying classification and indexing theory to machine retrieval are proposed. There are various ways in which indexing and retrieval systems, both conventional and electronic, deal with the problem of searching for documents on a subject basis, and various approaches to the analysis and processing of a query. There appear to be three basic models; the taxonomic or structural system, in which the user is offered a map of the `universe of knowledge'; the language based system, which offers a vocabulary of the subject and a grammar for dealing with compound statements; and the mathematical model using the language of symbolic logic or the algebra of set theory

0.0012878124 = product of:
  0.015453748 = sum of:
    0.015453748 = product of:
      0.030907497 = sum of:
        0.030907497 = weight(_text_:22 in 7238) [ClassicSimilarity], result of:
          0.030907497 = score(doc=7238,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.2708308 = fieldWeight in 7238, 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=7238)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Date

22. 4.1997 20:43:23

0.0011038391 = product of:
  0.01324607 = sum of:
    0.01324607 = product of:
      0.02649214 = sum of:
        0.02649214 = weight(_text_:22 in 5920) [ClassicSimilarity], result of:
          0.02649214 = score(doc=5920,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.23214069 = fieldWeight in 5920, 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=5920)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Date

27. 5.2001 16:22:21

0.0011038391 = product of:
  0.01324607 = sum of:
    0.01324607 = product of:
      0.02649214 = sum of:
        0.02649214 = weight(_text_:22 in 131) [ClassicSimilarity], result of:
          0.02649214 = score(doc=131,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.23214069 = fieldWeight in 131, 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=131)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Date

10. 9.2000 17:38:22

0.0011038391 = product of:
  0.01324607 = sum of:
    0.01324607 = product of:
      0.02649214 = sum of:
        0.02649214 = weight(_text_:22 in 3728) [ClassicSimilarity], result of:
          0.02649214 = score(doc=3728,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.23214069 = fieldWeight in 3728, 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=3728)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Source

Wissensspeicher in digitalen Räumen: Nachhaltigkeit - Verfügbarkeit - semantische Interoperabilität. Proceedings der 11. Tagung der Deutschen Sektion der Internationalen Gesellschaft für Wissensorganisation, Konstanz, 20. bis 22. Februar 2008. Hrsg.: J. Sieglerschmidt u. H.P.Ohly

0.0011038391 = product of:
  0.01324607 = sum of:
    0.01324607 = product of:
      0.02649214 = sum of:
        0.02649214 = weight(_text_:22 in 3837) [ClassicSimilarity], result of:
          0.02649214 = score(doc=3837,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.23214069 = fieldWeight in 3837, 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=3837)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Date

27. 8.2011 14:22:13

0.0010460628 = product of:
  0.012552753 = sum of:
    0.012552753 = weight(_text_:internet in 4549) [ClassicSimilarity], result of:
      0.012552753 = score(doc=4549,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1304718 = fieldWeight in 4549, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03125 = fieldNorm(doc=4549)
  0.083333336 = coord(1/12)

Abstract

Purpose - This paper attempts to explain the wide dissemination of Library of Congress Subject Headings (LCSH) within digital libraries and presents some of the advantages and disadvantages of using this controlled vocabulary in digital collections. The paper also presents other classifications used in digital collections for subject access and explores ways of improving search functionality in digital collections that employ LCSH. Design/methodology/approach - Unlike traditional libraries that use Library of Congress Classification for organization and retrieval, digital libraries use metadata forms for organization and retrieval. The collections exist in cyberspace of the internet which is known for containing the universe of knowledge. The use of LCSH for information retrieval has been widely criticized for its difficulty of use and its information retrieval effectiveness in online environments. The Library of Congress (LOC) has claimed the headings were not based on comprehensive principles nor ever intended to cover the universe of knowledge. Despite these claims and criticisms, LCSH is the most popular choice for subject access in digital libraries. Findings - The number of digital collections increases every year and LCSH is still the most popular choice of controlled vocabulary for subject access. Of the numerous criticisms, difficulties of use and user unfamiliarity are the greatest disadvantages of using LCSH for subject access. Average users only have a vague notion of what they are looking for when initializing a search. More work is required in automated generation of subject headings and increased usage of LCSH in faceted search retrieval systems. This will provide users with better access to the LCSH used in the back end of information retrieval. Originality/value - The Greek researchers who developed the Dissertation DSPace system believe this type of module will eventually replace the traditional keyword-based indexing back ends employed by many information retrieval modules within current digital library systems. The system offers the type of access and interactivity that will acquaint users with how LCSH looks and is used. Faceted search and automated pattern matching using an ontology based on LCSH have the best promise of overcoming the disadvantages that have always plagued the LOC-controlled vocabulary. These retrieval techniques give LCSH an opportunity to finally achieve the optimal precision and recall it has so far failed to deliver.

9.19866E-4 = product of:
  0.011038392 = sum of:
    0.011038392 = product of:
      0.022076784 = sum of:
        0.022076784 = weight(_text_:22 in 2337) [ClassicSimilarity], result of:
          0.022076784 = score(doc=2337,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.19345059 = fieldWeight in 2337, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2337)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Date

22. 9.1997 19:16:05

9.106209E-4 = product of:
  0.010927451 = sum of:
    0.010927451 = product of:
      0.021854902 = sum of:
        0.021854902 = weight(_text_:22 in 4360) [ClassicSimilarity], result of:
          0.021854902 = score(doc=4360,freq=4.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.19150631 = fieldWeight in 4360, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02734375 = fieldNorm(doc=4360)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)

Date

15. 7.2018 16:22:16

Footnote

Rez. in: Mitteilungen VÖB 48(1995) H.1, S.66-68 (K. Niedermair) - Vgl. auch Lepsky, K. in: Bibliotheksdienst 29(1995) H.3, S.500-519; Bibliothek: Forschung u. Praxis 19(1995) H.2, S.251-254 (G. Hartwieg; auch in: LDV-Forum Bd. 12, Nr. 2, Jg. 1995, S.22-29 [unter: http://www.jlcl.org/1995_Heft2/Rezensionen_19-27.pdf]) .