Search (188 results, page 1 of 10)

0.26003173 = product of:
  0.52006346 = sum of:
    0.4452333 = weight(_text_:juni in 4299) [ClassicSimilarity], result of:
      0.4452333 = score(doc=4299,freq=2.0), product of:
        0.447404 = queryWeight, product of:
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.06954168 = queryNorm
        0.9951482 = fieldWeight in 4299, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.109375 = fieldNorm(doc=4299)
    0.074830174 = weight(_text_:und in 4299) [ClassicSimilarity], result of:
      0.074830174 = score(doc=4299,freq=4.0), product of:
        0.15423642 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06954168 = queryNorm
        0.48516542 = fieldWeight in 4299, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.109375 = fieldNorm(doc=4299)
  0.5 = coord(2/4)

Editor

Universitäts- und Landesbibliothek Düsseldorf

Imprint

Düsseldorf : Universitäts- und Landesbibliothek

Issue

Stand: Juni 1996.

0.16101433 = product of:
  0.32202867 = sum of:
    0.254419 = weight(_text_:juni in 4178) [ClassicSimilarity], result of:
      0.254419 = score(doc=4178,freq=2.0), product of:
        0.447404 = queryWeight, product of:
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.06954168 = queryNorm
        0.5686561 = fieldWeight in 4178, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.0625 = fieldNorm(doc=4178)
    0.06760966 = weight(_text_:und in 4178) [ClassicSimilarity], result of:
      0.06760966 = score(doc=4178,freq=10.0), product of:
        0.15423642 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06954168 = queryNorm
        0.4383508 = fieldWeight in 4178, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0625 = fieldNorm(doc=4178)
  0.5 = coord(2/4)

Content

Enthält die Beiträge: LEPSKY, K.: Automatische Indexierung und bibliothekarische Inhaltserschließung: Ergebnisse des DFG-Projekts MILOS I; ZIMMERMANN, H.H.: Automatische Indexierung und elektronische Thesauri; WEIDEMÜLLER, H.U.: Sinn und Unsinn von Ketten im OPAC; GÖDERT, W.: Vom Zettelkatalog zum HyperOPAC; KOOPMANN, R.: Ein OPAC mit Gewichtungsalgorithmen: Der PICA Micro OPC

Imprint

Düsseldorf : Universitäts- und Landesbibliothek

Series

Schriften der Universitäts- und Landesbibliothek Düsseldorf; Bd.25

0.16101433 = product of:
  0.32202867 = sum of:
    0.254419 = weight(_text_:juni in 3062) [ClassicSimilarity], result of:
      0.254419 = score(doc=3062,freq=2.0), product of:
        0.447404 = queryWeight, product of:
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.06954168 = queryNorm
        0.5686561 = fieldWeight in 3062, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.0625 = fieldNorm(doc=3062)
    0.06760966 = weight(_text_:und in 3062) [ClassicSimilarity], result of:
      0.06760966 = score(doc=3062,freq=10.0), product of:
        0.15423642 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06954168 = queryNorm
        0.4383508 = fieldWeight in 3062, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0625 = fieldNorm(doc=3062)
  0.5 = coord(2/4)

Abstract

Überblick über die Möglichkeiten des Einsatzes automatischer Indexierung für die Erschließung von Textdokumenten mit einer Kurzvorstellung der Verfahren PASSAT, CTX und IDX sowie einer Skizze des Nutzens der Einbindung von Thesauri in den Prozess der automatischen Indexierung.

Imprint

Düsseldorf : Universitäts- und Landesbibliothek

Series

Schriften der Universitäts- und Landesbibliothek Düsseldorf; Bd.25

Source

Zukunft der Sacherschließung im OPAC: Vorträge des 2. Düsseldorfer OPAC-Kolloquiums am 21. Juni 1995. Hrsg.: E. Niggemann u. K. Lepsky

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.13001586 = product of:
  0.26003173 = sum of:
    0.22261664 = weight(_text_:juni in 3562) [ClassicSimilarity], result of:
      0.22261664 = score(doc=3562,freq=2.0), product of:
        0.447404 = queryWeight, product of:
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.06954168 = queryNorm
        0.4975741 = fieldWeight in 3562, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.0546875 = fieldNorm(doc=3562)
    0.037415087 = weight(_text_:und in 3562) [ClassicSimilarity], result of:
      0.037415087 = score(doc=3562,freq=4.0), product of:
        0.15423642 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06954168 = queryNorm
        0.24258271 = fieldWeight in 3562, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0546875 = fieldNorm(doc=3562)
  0.5 = coord(2/4)

Abstract

Seit Juni 2013 ist der Digitale As­sistent in den Workflow der Erschließungsprozesse der Zentralbibliothek Zürich integriert. Das System des Di­gitalen Assistenten kombiniert automatisch unterstützte Prozesse und intellektuelle Sacherschließung: Es werden Schlagwortvorschläge generiert, die danach intellektuell von den Fachreferenten überprüft werden. Im vorliegenden Beitrag wird die Entwicklung des Digitalen Assis­tenten im Kontext der Praxis der Sacherschließung im Allgemeinen und in der Zentralbibliothek Zürich im Speziellen skizziert. Im Anschluss werden die unterschied­lichen Prozesse der Datenverarbeitung des Systems näher erläutert, sodann wird auf Basis von Statistiken ein erstes Resümee gezogen. Ausführungen zu technischen Spezifikationen runden den Bericht ab.

0.12540594 = product of:
  0.25081187 = sum of:
    0.19081426 = weight(_text_:juni in 3061) [ClassicSimilarity], result of:
      0.19081426 = score(doc=3061,freq=2.0), product of:
        0.447404 = queryWeight, product of:
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.06954168 = queryNorm
        0.42649207 = fieldWeight in 3061, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.4336095 = idf(docFreq=193, maxDocs=44421)
          0.046875 = fieldNorm(doc=3061)
    0.05999762 = weight(_text_:und in 3061) [ClassicSimilarity], result of:
      0.05999762 = score(doc=3061,freq=14.0), product of:
        0.15423642 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06954168 = queryNorm
        0.38899773 = fieldWeight in 3061, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=3061)
  0.5 = coord(2/4)

Abstract

Kooperative Katalogisierung in der Bibliotheksverbünden und steigende Zahlen retrokonvertierter Altdaten füfhren zu einem stetigen Anwachsen maschinenlesbar verfügbarer Titeldaten. Dieser Entewicklung aud ser Katalogisat- bzw. Datenseite entspricht eine ähnlich rasante Entwicklung auf der Seite der Zugangsmöglichkeiten, den Online-Publikumskatalogen. Immer mehr Katalogdaten von immer mehr Bibliotheken sind in immer mehr OPACs nachgewiesen. Mit dieser auch durch neue Zugriffsformen (Internet) verbesserten Verfügbarkeit hält die bibliothekarische Sacherschließung längst nicht mehr Schritt. In diesem Beitrag werden die Vorgehensweise und Ergebnisse des Projektes MILOS I vorgestellt, das an der Universitäts- und Landesbibliothek zur automatischen Indexierung bibliothekarischer Titeldaten und zur Anreicherung von Katalogdaten durchgeführt wurde.

Imprint

Düsseldorf : Universitäts- und Landesbibliothek

Series

Schriften der Universitäts- und Landesbibliothek Düsseldorf; Bd.25

Source

Zukunft der Sacherschließung im OPAC: Vorträge des 2. Düsseldorfer OPAC-Kolloquiums am 21. Juni 1995. Hrsg.: E. Niggemann u. K. Lepsky

0.060085706 = product of:
  0.12017141 = sum of:
    0.047807246 = weight(_text_:und in 4081) [ClassicSimilarity], result of:
      0.047807246 = score(doc=4081,freq=20.0), product of:
        0.15423642 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06954168 = queryNorm
        0.3099608 = fieldWeight in 4081, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.03125 = fieldNorm(doc=4081)
    0.07236417 = weight(_text_:headings in 4081) [ClassicSimilarity], result of:
      0.07236417 = score(doc=4081,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.21444786 = fieldWeight in 4081, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.03125 = fieldNorm(doc=4081)
  0.5 = coord(2/4)

Abstract

Die Arbeit analysiert die dynamische Entwicklung und den Gebrauch von Thesaurusbegriffen. Zusätzlich konzentriert sie sich auf die Faktoren, die die Zahl von Indexbegriffen pro Dokument oder Zeitschrift beeinflussen. Als Untersuchungsobjekt dienten der MeSH und die entsprechende Datenbank "MEDLINE". Die wichtigsten Konsequenzen sind: 1. Der MeSH-Thesaurus hat sich durch drei unterschiedliche Phasen jeweils logarithmisch entwickelt. Solch einen Thesaurus sollte folgenden Gleichung folgen: "T = 3.076,6 Ln (d) - 22.695 + 0,0039d" (T = Begriffe, Ln = natürlicher Logarithmus und d = Dokumente). Um solch einen Thesaurus zu konstruieren, muss man demnach etwa 1.600 Dokumente von unterschiedlichen Themen des Bereiches des Thesaurus haben. Die dynamische Entwicklung von Thesauri wie MeSH erfordert die Einführung eines neuen Begriffs pro Indexierung von 256 neuen Dokumenten. 2. Die Verteilung der Thesaurusbegriffe erbrachte drei Kategorien: starke, normale und selten verwendete Headings. Die letzte Gruppe ist in einer Testphase, während in der ersten und zweiten Kategorie die neu hinzukommenden Deskriptoren zu einem Thesauruswachstum führen. 3. Es gibt ein logarithmisches Verhältnis zwischen der Zahl von Index-Begriffen pro Aufsatz und dessen Seitenzahl für die Artikeln zwischen einer und einundzwanzig Seiten. 4. Zeitschriftenaufsätze, die in MEDLINE mit Abstracts erscheinen erhalten fast zwei Deskriptoren mehr. 5. Die Findablity der nicht-englisch sprachigen Dokumente in MEDLINE ist geringer als die englische Dokumente. 6. Aufsätze der Zeitschriften mit einem Impact Factor 0 bis fünfzehn erhalten nicht mehr Indexbegriffe als die der anderen von MEDINE erfassten Zeitschriften. 7. In einem Indexierungssystem haben unterschiedliche Zeitschriften mehr oder weniger Gewicht in ihrem Findability. Die Verteilung der Indexbegriffe pro Seite hat gezeigt, dass es bei MEDLINE drei Kategorien der Publikationen gibt. Außerdem gibt es wenige stark bevorzugten Zeitschriften."

Footnote

Dissertation, Humboldt-Universität zu Berlin - Institut für Bibliotheks- und Informationswissenschaft.

Imprint

Berlin : Humboldt-Universität zu Berlin / Institut für Bibliotheks- und Informationswissenschaft

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.055392276 = product of:
  0.2215691 = sum of:
    0.2215691 = weight(_text_:headings in 2794) [ClassicSimilarity], result of:
      0.2215691 = score(doc=2794,freq=12.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.6566098 = fieldWeight in 2794, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.0390625 = fieldNorm(doc=2794)
  0.25 = coord(1/4)

Abstract

In this article, we describe and test a two-stage algorithm based on a lexical collocation technique which maps from the lexical clues contained in a document representation into a controlled vocabulary list of subject headings. Using a collection of 4.626 INSPEC documents, we create a 'dictionary' of associations between the lexical items contained in the titles, authors, and abstracts, and controlled vocabulary subject headings assigned to those records by human indexers using a likelihood ratio statistic as the measure of association. In the deployment stage, we use the dictiony to predict which of the controlled vocabulary subject headings best describe new documents when they are presented to the system. Our evaluation of this algorithm, in which we compare the automatically assigned subject headings to the subject headings assigned to the test documents by human catalogers, shows that we can obtain results comparable to, and consistent with, human cataloging. In effect we have cast this as a classic partial match information retrieval problem. We consider the problem to be one of 'retrieving' (or assigning) the most probably 'relevant' (or correct) controlled vocabulary subject headings to a document based on the clues contained in that document

0.045227606 = product of:
  0.18091042 = sum of:
    0.18091042 = weight(_text_:headings in 5064) [ClassicSimilarity], result of:
      0.18091042 = score(doc=5064,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.53611964 = fieldWeight in 5064, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.078125 = fieldNorm(doc=5064)
  0.25 = coord(1/4)

Abstract

This communication examines some of the most frequently cited critisms of keyword indexing. These critisms include (1) absence of general subject headings, (2) limited entry points, and (3) irrelevant indexing. Some solutions are suggested to meet these critisms.

0.044773046 = product of:
  0.17909218 = sum of:
    0.17909218 = weight(_text_:headings in 2717) [ClassicSimilarity], result of:
      0.17909218 = score(doc=2717,freq=4.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.5307314 = fieldWeight in 2717, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2717)
  0.25 = coord(1/4)

Abstract

The German subject headings authority file (Schlagwortnormdatei/SWD) provides a broad controlled vocabulary for indexing documents of all subjects. Traditionally used for intellectual subject cataloguing primarily of books the Deutsche Nationalbibliothek (DNB, German National Library) has been working on developping and implementing procedures for automated assignment of subject headings for online publications. This project, its results and problems are sketched in the paper.

0.044773046 = product of:
  0.17909218 = sum of:
    0.17909218 = weight(_text_:headings in 481) [ClassicSimilarity], result of:
      0.17909218 = score(doc=481,freq=4.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.5307314 = fieldWeight in 481, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.0546875 = fieldNorm(doc=481)
  0.25 = coord(1/4)

Abstract

This article describes multiple experiments in text mining at Northern Illinois University that were undertaken to improve the efficiency and accuracy of cataloging. It focuses narrowly on subject analysis of dime novels, a format of inexpensive fiction that was popular in the United States between 1860 and 1915. NIU holds more than 55,000 dime novels in its collections, which it is in the process of comprehensively digitizing. Classification, keyword extraction, named-entity recognition, clustering, and topic modeling are discussed as means of assigning subject headings to improve their discoverability by researchers and to increase the productivity of digitization workflows.

0.043741073 = product of:
  0.08748215 = sum of:
    0.015117979 = weight(_text_:und in 2016) [ClassicSimilarity], result of:
      0.015117979 = score(doc=2016,freq=2.0), product of:
        0.15423642 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06954168 = queryNorm
        0.098018214 = fieldWeight in 2016, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.03125 = fieldNorm(doc=2016)
    0.07236417 = weight(_text_:headings in 2016) [ClassicSimilarity], result of:
      0.07236417 = score(doc=2016,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.21444786 = fieldWeight in 2016, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.03125 = fieldNorm(doc=2016)
  0.5 = coord(2/4)

Abstract

Relationships between terms and features are an essential component of thesauri, ontologies, and a range of controlled vocabularies. In this article, we describe ways to identify important concepts in documents using the relationships in a thesaurus or other vocabulary structures. We introduce a methodology for the analysis and modeling of the indexing process based on a weighted random walk algorithm. The primary goal of this research is the analysis of the contribution of thesaurus structure to the indexing process. The resulting models are evaluated in the context of automatic subject indexing using four collections of documents pre-indexed with 4 different thesauri (AGROVOC [UN Food and Agriculture Organization], high-energy physics taxonomy [HEP], National Agricultural Library Thesaurus [NALT], and medical subject headings [MeSH]). We also introduce a thesaurus-centric matching algorithm intended to improve the quality of candidate concepts. In all cases, the weighted random walk improves automatic indexing performance over matching alone with an increase in average precision (AP) of 9% for HEP, 11% for MeSH, 35% for NALT, and 37% for AGROVOC. The results of the analysis support our hypothesis that subject indexing is in part a browsing process, and that using the vocabulary and its structure in a thesaurus contributes to the indexing process. The amount that the vocabulary structure contributes was found to differ among the 4 thesauri, possibly due to the vocabulary used in the corresponding thesauri and the structural relationships between the terms. Each of the thesauri and the manual indexing associated with it is characterized using the methods developed here.

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.036182083 = product of:
  0.14472833 = sum of:
    0.14472833 = weight(_text_:headings in 3669) [ClassicSimilarity], result of:
      0.14472833 = score(doc=3669,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.4288957 = fieldWeight in 3669, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.0625 = fieldNorm(doc=3669)
  0.25 = coord(1/4)

Abstract

Reports the 1st part of a study to apply the technique of phrase matching to the automatic assignment of MeSH subject headings and subheadings to abstracts of periodical articles.

0.031659324 = product of:
  0.1266373 = sum of:
    0.1266373 = weight(_text_:headings in 2334) [ClassicSimilarity], result of:
      0.1266373 = score(doc=2334,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.37528375 = fieldWeight in 2334, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2334)
  0.25 = coord(1/4)

Abstract

A document classifier places documents together in a linear arrangement for browsing or high-speed access by human or computerised information retrieval systems. Requirements for document classification and browsing systems are developed from similarity measures, distance measures, and the notion of subject aboutness. A requirement that documents be arranged in decreasing order of similarity as the distance from a given document increases can often not be met. Based on these requirements, information-theoretic considerations, and the Gray code, a classification system is proposed that can classifiy documents without human intervention. A measure of classifier performance is developed, and used to evaluate experimental results comparing the distance between subject headings assigned to documents given classifications from the proposed system and the Library of Congress Classification (LCC) system

0.031659324 = product of:
  0.1266373 = sum of:
    0.1266373 = weight(_text_:headings in 6818) [ClassicSimilarity], result of:
      0.1266373 = score(doc=6818,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.37528375 = fieldWeight in 6818, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.0546875 = fieldNorm(doc=6818)
  0.25 = coord(1/4)

Abstract

As the amount of accessible information on the WWW increases, so will the cost of accessing it, even if search servcies remain free, due to the increasing amount of time users will have to spend to find needed items. Considers what the seemingly unorganized Web and the organized world of libraries can offer each other. The OCLC Scorpion Project is attempting to combine indexing and cataloguing, specifically focusing on building tools for automatic subject recognition using the technqiues of library science and information retrieval. If subject headings or concept domains can be automatically assigned to electronic items, improved filtering tools for searching can be produced

0.031659324 = product of:
  0.1266373 = sum of:
    0.1266373 = weight(_text_:headings in 2969) [ClassicSimilarity], result of:
      0.1266373 = score(doc=2969,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.37528375 = fieldWeight in 2969, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2969)
  0.25 = coord(1/4)

Abstract

The German Integrated Authority File (Gemeinsame Normdatei, GND), provides a broad controlled vocabulary for indexing documents on all subjects. Traditionally used for intellectual subject cataloging primarily for books, the Deutsche Nationalbibliothek (DNB, German National Library) has been working on developing and implementing procedures for automated assignment of subject headings for online publications. This project, its results, and problems are outlined in this article.

0.031659324 = product of:
  0.1266373 = sum of:
    0.1266373 = weight(_text_:headings in 1711) [ClassicSimilarity], result of:
      0.1266373 = score(doc=1711,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.37528375 = fieldWeight in 1711, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.0546875 = fieldNorm(doc=1711)
  0.25 = coord(1/4)

Abstract

Subject headings and genre terms are notoriously difficult to apply, yet are important for fiction. The current project functions as a proof of concept, using a text-mining methodology to identify affective information (emotion and tone) about fiction titles from professional book reviews as a potential first step in automating the subject analysis process. Findings are presented and discussed, comparing results to the range of aboutness and isness information in library cataloging records. The methodology is likewise presented, and how future work might expand on the current project to enhance catalog records through text-mining is explored.

0.031659324 = product of:
  0.1266373 = sum of:
    0.1266373 = weight(_text_:headings in 2141) [ClassicSimilarity], result of:
      0.1266373 = score(doc=2141,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.37528375 = fieldWeight in 2141, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2141)
  0.25 = coord(1/4)

Abstract

In light of AI (Artificial Intelligence) and NLP (Natural language processing) technologies, this article examines the feasibility of using AI/NLP models to enhance the subject indexing of digital resources. While BERT (Bidirectional Encoder Representations from Transformers) models are widely used in scholarly communities, the authors assess whether BERT models can be used in machine-assisted indexing in the Project Gutenberg collection, through suggesting Library of Congress subject headings filtered by certain Library of Congress Classification subclass labels. The findings of this study are informative for further research on BERT models to assist with automatic subject indexing for digital library collections.

0.027136564 = product of:
  0.10854626 = sum of:
    0.10854626 = weight(_text_:headings in 4622) [ClassicSimilarity], result of:
      0.10854626 = score(doc=4622,freq=2.0), product of:
        0.33744413 = queryWeight, product of:
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.06954168 = queryNorm
        0.32167178 = fieldWeight in 4622, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.8524013 = idf(docFreq=942, maxDocs=44421)
          0.046875 = fieldNorm(doc=4622)
  0.25 = coord(1/4)

Abstract

Indexing is contextualized and a brief description is provided of some of the most used automatic indexing systems. We describe SISA, a system which uses location heuristics rules, statistical rules like term frequency (TF) or TF-IDF to obtain automatic or semi-automatic indexing, depending on the user's preference. The aim of this research is to ascertain which rules (location heuristics rules or TF-IDF rules) provide the best indexing terms. SISA is used to obtain the automatic indexing of 200 scientific articles on fruit growing written in Portuguese. It uses, on the one hand, location heuristics rules founded on the value of certain parts of the articles for indexing such as titles, abstracts, keywords, headings, first paragraph, conclusions and references and, on the other, TF-IDF rules. The indexing is then evaluated to ascertain retrieval performance through recall, precision and f-measure. Automatic indexing of the articles with location heuristics rules provided the best results with the evaluation measures.

0.023144584 = product of:
  0.09257834 = sum of:
    0.09257834 = weight(_text_:und in 29) [ClassicSimilarity], result of:
      0.09257834 = score(doc=29,freq=12.0), product of:
        0.15423642 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06954168 = queryNorm
        0.60023654 = fieldWeight in 29, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.078125 = fieldNorm(doc=29)
  0.25 = coord(1/4)

Abstract

Über eine Schnittstelle zwischen Programmen zur automatischen Indexierung (PRIMUS-IDX) und zur maschinellen Thesaurusverwaltung (INDEX) sollen große Textmengen schnell, kostengünstig und konsistent erschlossen und verbesserte Recherchemöglichkeiten geschaffen werden. Zielvorstellung ist ein Verfahren, das auf PCs ablauffähig ist und speziell deutschsprachige Texte bearbeiten kann

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.022676967 = product of:
  0.09070787 = sum of:
    0.09070787 = weight(_text_:und in 1886) [ClassicSimilarity], result of:
      0.09070787 = score(doc=1886,freq=18.0), product of:
        0.15423642 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06954168 = queryNorm
        0.58810925 = fieldWeight in 1886, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0625 = fieldNorm(doc=1886)
  0.25 = coord(1/4)

Abstract

Seit Frühjahr 2004 ist Dandelon.com als neues, offenes, internationales Wissenschaftsportal in Betrieb. Erste Retrieval-Tests bescheinigen deutlich bessere Suchergebnisse als in herkömmlichen OPACs oder Verbundsystemen. Seine Daten stammen aus intelligentCAPTURE und Bibliothekskatalogen. intelligentCAPTURE erfasst Content über Scanning oder File-Import oder Web-Spidering und indexiert nach morphosyntaktischen und semantischen Verfahren. Aufbereiteter Content und Indexate gehen an Bibliothekssysteme und an dandelon.com. Dandelon.com ist kostenlos zugänglich für Endbenutzer und ist zugleich Austauschzentrale und Katalogerweiterung für angeschlossene Bibliotheken. Neue Inhalte können so kostengünstig und performant erschlossen werden.