Search (64 results, page 1 of 4)

0.09220999 = product of:
  0.36883995 = sum of:
    0.36883995 = weight(_text_:java in 2673) [ClassicSimilarity], result of:
      0.36883995 = score(doc=2673,freq=4.0), product of:
        0.47850266 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067896724 = queryNorm
        0.7708211 = fieldWeight in 2673, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2673)
  0.25 = coord(1/4)

Abstract

The Wolverhampton Web Library (WWLib) is a WWW search engine that provides access to UK based information. The experimental version developed in 1995, was a success but highlighted the need for a much higher degree of automation. An interesting feature of the experimental WWLib was that it organised information according to DDC. Discusses the advantages of classification and describes the automatic classifier that is being developed in Java as part of the new, fully automated WWLib

0.058365252 = product of:
  0.23346101 = sum of:
    0.23346101 = weight(_text_:hypertext in 3480) [ClassicSimilarity], result of:
      0.23346101 = score(doc=3480,freq=12.0), product of:
        0.3422601 = queryWeight, product of:
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.067896724 = queryNorm
        0.6821158 = fieldWeight in 3480, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.0390625 = fieldNorm(doc=3480)
  0.25 = coord(1/4)

Abstract

Three pre-web articles about using hypertext for knowledge representation. Duncan discusses how to use graphical, hypertext displays (she used Xerox PARC's NoteCards on a Xerox 1186 workstation) along with concept maps and facet analysis, a combination that would now be done with topic maps. The screen shots of her graphical displays are quite interesting. Her interest in facets is in how to use them to show things to different people in different ways, for example, so that experts can enter knowledge into a system in one way while novices can see it in another. Duncan found that facet labels (e.g. Process and Product) prompted the expert to think of related concepts when inputting data, and made navigation easier for users. Facets can be joined together, e.g. "Agents (causing) Process," leading to a "reasoning system." She is especially interested in how to show relstionships between two things: e.g., A causes B, A uses B, A occurs in B. This is an important question in facet theory, but probably not worth worrying about in a small online classification where the relations are fixed and obvious. These articles may be difficult to find, in which case the reader can find a nice sumary in the next article, by Ellis and Vasconcelos (2000). Anyone interested in tracing the history of facets and hypertext will, however, want to see the originals.

Source

Hypertext: Theory into practice. Ed.: Ray McAleese

Theme

Hypertext

0.053279944 = product of:
  0.21311978 = sum of:
    0.21311978 = weight(_text_:hypertext in 3481) [ClassicSimilarity], result of:
      0.21311978 = score(doc=3481,freq=10.0), product of:
        0.3422601 = queryWeight, product of:
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.067896724 = queryNorm
        0.6226837 = fieldWeight in 3481, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.0390625 = fieldNorm(doc=3481)
  0.25 = coord(1/4)

Abstract

Three pre-web articles about using hypertext for knowledge representation. Duncan discusses how to use graphical, hypertext displays (she used Xerox PARC's NoteCards on a Xerox 1186 workstation) along with concept maps and facet analysis, a combination that would now be done with topic maps. The screen shots of her graphical displays are quite interesting. Her interest in facets is in how to use them to show things to different people in different ways, for example, so that experts can enter knowledge into a system in one way while novices can see it in another. Duncan found that facet labels (e.g. Process and Product) prompted the expert to think of related concepts when inputting data, and made navigation easier for users. Facets can be joined together, e.g. "Agents (causing) Process," leading to a "reasoning system." She is especially interested in how to show relstionships between two things: e.g., A causes B, A uses B, A occurs in B. This is an important question in facet theory, but probably not worth worrying about in a small online classification where the relations are fixed and obvious. These articles may be difficult to find, in which case the reader can find a nice sumary in the next article, by Ellis and Vasconcelos (2000). Anyone interested in tracing the history of facets and hypertext will, however, want to see the originals.

Theme

Hypertext

0.049524564 = product of:
  0.19809826 = sum of:
    0.19809826 = weight(_text_:hypertext in 3477) [ClassicSimilarity], result of:
      0.19809826 = score(doc=3477,freq=6.0), product of:
        0.3422601 = queryWeight, product of:
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.067896724 = queryNorm
        0.5787945 = fieldWeight in 3477, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.046875 = fieldNorm(doc=3477)
  0.25 = coord(1/4)

Abstract

Different forms of indexing and search facilities available on the Web are described. Use of facet analysis to structure hypertext concept structures is outlined in relation to work on (1) development of hypertext knowledge bases for designers of learning materials and (2) construction of knowledge based hypertext interfaces. The problem of lack of closeness between page designers and potential users is examined. Facet analysis is suggested as a way of alleviating some difficulties associated with this problem of designing for the unknown user.

0.04765503 = product of:
  0.19062012 = sum of:
    0.19062012 = weight(_text_:hypertext in 3478) [ClassicSimilarity], result of:
      0.19062012 = score(doc=3478,freq=8.0), product of:
        0.3422601 = queryWeight, product of:
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.067896724 = queryNorm
        0.5569452 = fieldWeight in 3478, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.0390625 = fieldNorm(doc=3478)
  0.25 = coord(1/4)

Abstract

Three pre-web articles about using hypertext for knowledge representation. Duncan discusses how to use graphical, hypertext displays (she used Xerox PARC's NoteCards on a Xerox 1186 workstation) along with concept maps and facet analysis, a combination that would now be done with topic maps. The screen shots of her graphical displays are quite interesting. Her interest in facets is in how to use them to show things to different people in different ways, for example, so that experts can enter knowledge into a system in one way while novices can see it in another. Duncan found that facet labels (e.g. Process and Product) prompted the expert to think of related concepts when inputting data, and made navigation easier for users. Facets can be joined together, e.g. "Agents (causing) Process," leading to a "reasoning system." She is especially interested in how to show relstionships between two things: e.g., A causes B, A uses B, A occurs in B. This is an important question in facet theory, but probably not worth worrying about in a small online classification where the relations are fixed and obvious. These articles may be difficult to find, in which case the reader can find a nice sumary in the next article, by Ellis and Vasconcelos (2000). Anyone interested in tracing the history of facets and hypertext will, however, want to see the originals.

Theme

Hypertext

0.029182626 = product of:
  0.116730504 = sum of:
    0.116730504 = weight(_text_:hypertext in 3467) [ClassicSimilarity], result of:
      0.116730504 = score(doc=3467,freq=12.0), product of:
        0.3422601 = queryWeight, product of:
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.067896724 = queryNorm
        0.3410579 = fieldWeight in 3467, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.01953125 = fieldNorm(doc=3467)
  0.25 = coord(1/4)

Abstract

This is a classified, annotated bibliography about how to design faceted classification systems and make them usable on the World Wide Web. It is the first of three works I will be doing. The second, based on the material here and elsewhere, will discuss how to actually make the faceted system and put it online. The third will be a report of how I did just that, what worked, what didn't, and what I learned. Almost every article or book listed here begins with an explanation of what a faceted classification system is, so I won't (but see Steckel in Background below if you don't already know). They all agree that faceted systems are very appropriate for the web. Even pre-web articles (such as Duncan's in Background, below) assert that hypertext and facets will go together well. Combined, it is possible to take a set of documents and classify them or apply subject headings to describe what they are about, then build a navigational structure so that any user, no matter how he or she approaches the material, no matter what his or her goals, can move and search in a way that makes sense to them, but still get to the same useful results as someone else following a different path to the same goal. There is no one way that everyone will always use when looking for information. The more flexible the organization of the information, the more accommodating it is. Facets are more flexible for hypertext browsing than any enumerative or hierarchical system.
Consider movie listings in newspapers. Most Canadian newspapers list movie showtimes in two large blocks, for the two major theatre chains. The listings are ordered by region (in large cities), then theatre, then movie, and finally by showtime. Anyone wondering where and when a particular movie is playing must scan the complete listings. Determining what movies are playing in the next half hour is very difficult. When movie listings went onto the web, most sites used a simple faceted organization, always with movie name and theatre, and perhaps with region or neighbourhood (thankfully, theatre chains were left out). They make it easy to pick a theatre and see what movies are playing there, or to pick a movie and see what theatres are showing it. To complete the system, the sites should allow users to browse by neighbourhood and showtime, and to order the results in any way they desired. Thus could people easily find answers to such questions as, "Where is the new James Bond movie playing?" "What's showing at the Roxy tonight?" "I'm going to be out in in Little Finland this afternoon with three hours to kill starting at 2 ... is anything interesting playing?" A hypertext, faceted classification system makes more useful information more easily available to the user. Reading the books and articles below in chronological order will show a certain progression: suggestions that faceting and hypertext might work well, confidence that facets would work well if only someone would make such a system, and finally the beginning of serious work on actually designing, building, and testing faceted web sites. There is a solid basis of how to make faceted classifications (see Vickery in Recommended), but their application online is just starting. Work on XFML (see Van Dijck's work in Recommended) the Exchangeable Faceted Metadata Language, will make this easier. If it follows previous patterns, parts of the Internet community will embrace the idea and make open source software available for others to reuse. It will be particularly beneficial if professionals in both information studies and computer science can work together to build working systems, standards, and code. Each can benefit from the other's expertise in what can be a very complicated and technical area. One particularly nice thing about this area of research is that people interested in combining facets and the web often have web sites where they post their writings.
This bibliography is not meant to be exhaustive, but unfortunately it is not as complete as I wanted. Some books and articles are not be included, but they may be used in my future work. (These include two books and one article by B.C. Vickery: Faceted Classification Schemes (New Brunswick, NJ: Rutgers, 1966), Classification and Indexing in Science, 3rd ed. (London: Butterworths, 1975), and "Knowledge Representation: A Brief Review" (Journal of Documentation 42 no. 3 (September 1986): 145-159; and A.C. Foskett's "The Future of Faceted Classification" in The Future of Classification, edited by Rita Marcella and Arthur Maltby (Aldershot, England: Gower, 2000): 69-80). Nevertheless, I hope this bibliography will be useful for those both new to or familiar with faceted hypertext systems. Some very basic resources are listed, as well as some very advanced ones. Some example web sites are mentioned, but there is no detailed technical discussion of any software. The user interface to any web site is extremely important, and this is briefly mentioned in two or three places (for example the discussion of lawforwa.org (see Example Web Sites)). The larger question of how to display information graphically and with hypertext is outside the scope of this bibliography. There are five sections: Recommended, Background, Not Relevant, Example Web Sites, and Mailing Lists. Background material is either introductory, advanced, or of peripheral interest, and can be read after the Recommended resources if the reader wants to know more. The Not Relevant category contains articles that may appear in bibliographies but are not relevant for my purposes.

0.023827516 = product of:
  0.09531006 = sum of:
    0.09531006 = weight(_text_:hypertext in 895) [ClassicSimilarity], result of:
      0.09531006 = score(doc=895,freq=2.0), product of:
        0.3422601 = queryWeight, product of:
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.067896724 = queryNorm
        0.2784726 = fieldWeight in 895, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.0390625 = fieldNorm(doc=895)
  0.25 = coord(1/4)

Abstract

Broughton is one of the key people working on the second edition of the Bliss Bibliographic Classification (BC2). Her article has a brief, informative history of facets, then discusses semantic vs. syntactic relationships, standard facets used by Ranganathan and the Classification Research Group, facet analysis and citation order, and how to build subject indexes out of faceted classifications, all with occasional reference to digital environments and hypertext, but never with any specifics. It concludes by saying of faceted classification that the "capacity which it has to create highly sophisticated structures for the accommodation of complex objects suggests that it is worth investigation as an organizational tool for digital materials, and that the results of such investigation would be knowledge structures of unparalleled utility and elegance." How to build them is left to the reader, but this article provides an excellent starting point. It includes an example that shows how general concepts can be applied to a small set of documents and subjects, and how terms can be adapted to suit the material and users

0.023827516 = product of:
  0.09531006 = sum of:
    0.09531006 = weight(_text_:hypertext in 825) [ClassicSimilarity], result of:
      0.09531006 = score(doc=825,freq=2.0), product of:
        0.3422601 = queryWeight, product of:
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.067896724 = queryNorm
        0.2784726 = fieldWeight in 825, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.0408926 = idf(docFreq=780, maxDocs=44421)
          0.0390625 = fieldNorm(doc=825)
  0.25 = coord(1/4)

Abstract

"Online retrieval" conjures up a very different mental image now than in 1991, the year this article was written, and the year Tim Berners-Lee first revealed the new hypertext system he called the World Wide Web. Gödert shows that truncation and Boolean logic, combined with notation from a faceted classification system, will be a powerful way of searching for information. It undoubtedly is, but no system built now would require a user searching for material on "nervous systems of bone fish" to enter "Fdd$ and Leaa$". This is worth reading for someone interested in seeing how searching and facets can go together, but the web has made this article quite out of date.

0.02214056 = product of:
  0.08856224 = sum of:
    0.08856224 = weight(_text_:und in 1533) [ClassicSimilarity], result of:
      0.08856224 = score(doc=1533,freq=8.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.58810925 = fieldWeight in 1533, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.09375 = fieldNorm(doc=1533)
  0.25 = coord(1/4)

Imprint

Oldenburg : Bibliotheks- und Informationssystem

Source

Zwischen Schreiben und Lesen: Perspektiven für Bibliotheken, Wissenschaft und Kultur. Festschrift zum 60. Geburtstag von Hermann Havekost. Hrsg. von H.-J. Wätjen

0.021137666 = product of:
  0.084550664 = sum of:
    0.084550664 = weight(_text_:und in 6505) [ClassicSimilarity], result of:
      0.084550664 = score(doc=6505,freq=42.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.56146985 = fieldWeight in 6505, product of:
          6.4807405 = tf(freq=42.0), with freq of:
            42.0 = termFreq=42.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0390625 = fieldNorm(doc=6505)
  0.25 = coord(1/4)

Abstract

Die verstärkte Diskussion über qualitativ bessere Such- und Erschließungsmethoden im Internet führt auch dazu, dass Thesauri und Klassifikation bei Fachanbietern und im wissenschaftlich-bibliothekarischen Bereich verstärkt wieder Thema und auch Gegenstand von Projekten geworden sind. Solche Konjunkturschwankungen sind ein bekanntes Phänomen, denn schon immer haben fachlich-methodische Instrumente in Zeiten technologischer Schübe schlechte Konjunktur. Wenn die technologischen Machbarkeiten dann kritisch überdacht werden müssen und die Probleme der Qualitätssicherung ins Auge fallen, rückt das Problem der Vermittlung technologischer Verfahren mit sach- und inhaltsbezogenen Anforderungen unweigerlich wieder stärker in den Mittelpunkt des Interesses'. Meine Ausführungen richten sich vor allem auf aktuelle Probleme der Produktion und Wiedergewinnung von Informationen oder präziser: von Fachinformationen, Fragen der Qualitätssicherung und die Rolle, die Klassifikationen und Thesauri in diesem Zusammenhang spielen oder spielen könnten. Insbesondere der Aspekt der Nutzerakzeptanz wird hier stärker thematisiert. Der Punkt nettere Ansätze wird etwas eingehender am Beispiel der Vernetzung verschiedener Thesauri und Klassifikationen mittels sogenannter Cross-Konkordanzen erläutert. Im Folgenden beziehe ich mich vor allem auf die Sozialwissenschaften und insbesondere die Erziehungswissenschaft. Dies ist der fachliche Background des Fachinformationssystem Bildung, und des Deutschen Bildungsservers in deren Kontext ich mit den hier angesprochenen Problemen befasst bin

Series

Gemeinsamer Kongress der Bundesvereinigung Deutscher Bibliotheksverbände e.V. (BDB) und der Deutschen Gesellschaft für Informationswissenschaft und Informationspraxis e.V. (DGI); Bd.1)(Tagungen der Deutschen Gesellschaft für Informationswissenschaft und Informationspraxis e.V.; Bd.3

Source

Information und Öffentlichkeit: 1. Gemeinsamer Kongress der Bundesvereinigung Deutscher Bibliotheksverbände e.V. (BDB) und der Deutschen Gesellschaft für Informationswissenschaft und Informationspraxis e.V. (DGI), Leipzig, 20.-23.3.2000. Zugleich 90. Deutscher Bibliothekartag, 52. Jahrestagung der Deutschen Gesellschaft für Informationswissenschaft und Informationspraxis e.V. (DGI). Hrsg.: G. Ruppelt u. H. Neißer

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.01917429 = product of:
  0.07669716 = sum of:
    0.07669716 = weight(_text_:und in 997) [ClassicSimilarity], result of:
      0.07669716 = score(doc=997,freq=6.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.50931764 = fieldWeight in 997, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.09375 = fieldNorm(doc=997)
  0.25 = coord(1/4)

Imprint

Oldenburg : Bibliotheks- und Informationssystem

Source

Aufbau und Erschließung begrifflicher Datenbanken: Beiträge zur bibliothekarischen Klassifikation. Eine Auswahl von Vorträgen der Jahrestagungen 1993 (Kaiserslautern) und 1994 (Oldenburg) der Gesellschaft für Klassifikation. Hrsg.: H. Havekost u. H.-J. Wätjen

0.019174289 = product of:
  0.076697156 = sum of:
    0.076697156 = weight(_text_:und in 1754) [ClassicSimilarity], result of:
      0.076697156 = score(doc=1754,freq=54.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.5093176 = fieldWeight in 1754, product of:
          7.3484693 = tf(freq=54.0), with freq of:
            54.0 = termFreq=54.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.03125 = fieldNorm(doc=1754)
  0.25 = coord(1/4)

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

Footnote

Vgl.: https://www.degruyter.com/document/doi/10.1515/9783110691597/html. DOI: https://doi.org/10.1515/9783110691597. Rez. in: Information - Wissenschaft und Praxis 73(2022) H.2-3, S.131-132 (B. Lorenz u. V. Steyer). Weitere Rezension in: o-bib 9(20229 Nr.3. (Martin Völkl) [https://www.o-bib.de/bib/article/view/5843/8714].

Series

Bibliotheks- und Informationspraxis; 70

0.018450469 = product of:
  0.073801875 = sum of:
    0.073801875 = weight(_text_:und in 990) [ClassicSimilarity], result of:
      0.073801875 = score(doc=990,freq=8.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.4900911 = fieldWeight in 990, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.078125 = fieldNorm(doc=990)
  0.25 = coord(1/4)

Imprint

Oldenburg : Bibliotheks- und Informationssystem

Source

Aufbau und Erschließung begrifflicher Datenbanken: Beiträge zur bibliothekarischen Klassifikation. Eine Auswahl von Vorträgen der Jahrestagungen 1993 (Kaiserslautern) und 1994 (Oldenburg) der Gesellschaft für Klassifikation. Hrsg.: H. Havekost u. H.-J. Wätjen

0.015817981 = product of:
  0.063271925 = sum of:
    0.063271925 = weight(_text_:und in 5016) [ClassicSimilarity], result of:
      0.063271925 = score(doc=5016,freq=12.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.42016557 = fieldWeight in 5016, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0546875 = fieldNorm(doc=5016)
  0.25 = coord(1/4)

Abstract

Die Methoden zur formalen und inhaltlichen Erschließung von Medienbeständen in Bibliotheken wurden ausnahmslos vor dem Hintergrund der konventionellen Katalogisierung entwickelt und optimiert. Durch den zunehmenden Einsatz der Computertechnologie in Bibliotheken wird eine kritische Überprüfung der tradierten Erschließungsmethoden erforderlich. Gegenstand dieser Untersuchung ist die bibliothekarische Klassifikation und ihre Verwendung in Online-Publikums-Katalogen (OPAC) und anderen Information-Retrieval-Systemen (IRS). Auf der Grundlage der bibliothekarischen Klassifikationstheorie erfolgt eine Überprüfung der verschiedenen Klassifikationstypen hinsichtlich ihrer Tauglichkeit für die gängigen Recherche-Funktionen in diesen Systemen. Zusätzlich wird ein Anforderungskatalog für die Schlagwort-Register und -indizes entwickelt, der im Online-Dialog den verbalen Zugriff auf die einzelnen Klassen einer bibliothekarischen Klassifikation sicherstellen soll

Source

Bibliothek: Forschung und Praxis. 17(1993) H.2, S.137-162

0.015817981 = product of:
  0.063271925 = sum of:
    0.063271925 = weight(_text_:und in 1002) [ClassicSimilarity], result of:
      0.063271925 = score(doc=1002,freq=12.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.42016557 = fieldWeight in 1002, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0546875 = fieldNorm(doc=1002)
  0.25 = coord(1/4)

Abstract

Die traditionellen Verfahren der klassifikatorischen sachlichen Erschließung von Medieninhalten heben auf die Eindeutigkeit der Zuordnung von Objekt (Medieninhalt) und Klasse ab. Sie unterscheiden sich damit in der Praxis des Online-Retrievals nur unwesentlich von den Verfahren der verbalen sachlichen Erschließung (z.B. Thesauri, SWD/RSWK). Auf der Grundlage der in der Sacherschließungstheorie vorgenommenen Unterscheidung von klassifikatorischer und verbaler Sacherschließung werden mögliche und bereits in Anwendung befindliche Verfahren diskutiert, welche die begrifflichen Kontexte der Klassen für den Anwender einer bibliothekarischen Klassifikation im Online-Retrieval nutzbar machen

Imprint

Oldenburg : Bibliotheks- und Informationssystem

Source

Aufbau und Erschließung begrifflicher Datenbanken: Beiträge zur bibliothekarischen Klassifikation. Eine Auswahl von Vorträgen der Jahrestagungen 1993 (Kaiserslautern) und 1994 (Oldenburg) der Gesellschaft für Klassifikation. Hrsg.: H. Havekost u. H.-J. Wätjen

0.015655741 = product of:
  0.062622964 = sum of:
    0.062622964 = weight(_text_:und in 890) [ClassicSimilarity], result of:
      0.062622964 = score(doc=890,freq=4.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.41585606 = fieldWeight in 890, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.09375 = fieldNorm(doc=890)
  0.25 = coord(1/4)

0.015655741 = product of:
  0.062622964 = sum of:
    0.062622964 = weight(_text_:und in 1300) [ClassicSimilarity], result of:
      0.062622964 = score(doc=1300,freq=4.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.41585606 = fieldWeight in 1300, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.09375 = fieldNorm(doc=1300)
  0.25 = coord(1/4)

Source

Bibliothek. Forschung und Praxis. 14(1990), S.193-225

0.015655741 = product of:
  0.062622964 = sum of:
    0.062622964 = weight(_text_:und in 4087) [ClassicSimilarity], result of:
      0.062622964 = score(doc=4087,freq=4.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.41585606 = fieldWeight in 4087, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.09375 = fieldNorm(doc=4087)
  0.25 = coord(1/4)

Imprint

Oldenburg : Bibliotheks- und Informationssystem der Universität

Source

Die Systematik im OPAC: über das Instrumentarium zum Ordnen und Wiederfinden. Vorträge aus den bibliothekarischen Arbeitsgruppen der 16. Jahrestagung der Gesellschaft für Klassifikation, Dortmund 1992. Hrsg.: H.-J. Hermes u. H. Havekost

0.015655741 = product of:
  0.062622964 = sum of:
    0.062622964 = weight(_text_:und in 2054) [ClassicSimilarity], result of:
      0.062622964 = score(doc=2054,freq=4.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.41585606 = fieldWeight in 2054, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.09375 = fieldNorm(doc=2054)
  0.25 = coord(1/4)

Source

Information und Dokumentation: Qualität und Qualifikation. Deutscher Dokumentartag 1997, Universität Regensburg, 24.-26.9.1997. Hrsg.: M. Ockenfeld u. G.J. Mantwill

0.015655741 = product of:
  0.062622964 = sum of:
    0.062622964 = weight(_text_:und in 5189) [ClassicSimilarity], result of:
      0.062622964 = score(doc=5189,freq=16.0), product of:
        0.15058808 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067896724 = queryNorm
        0.41585606 = fieldWeight in 5189, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=5189)
  0.25 = coord(1/4)

Abstract

Eine ganze Anzahl von Bibliotheken in Europa befaßt sich mit der Entwicklung von Internet Subject Gateways - einer Serviceleistung, die den Nutzern helfen soll, qualitativ hochwertige Internetquellen zu finden. Subject Gateways wie SOSIG (The Social Science Information Gateway) sind bereits seit einigen Jahren im Internet verfügbar und stellen eine Alternative zu Internet-Suchmaschinen wie AltaVista und Verzeichnissen wie Yahoo dar. Bezeichnenderweise stützen sich Subject Gateways auf die Fertigkeiten, Verfahrensweisen und Standards der internationalen Bibliothekswelt und wenden diese auf Informationen aus dem Internet an. Dieses Referat will daher betonen, daß Bibliothekare/innen idealerweise eine vorherrschende Rolle im Aufbau von Suchservices für Internetquellen spielen und daß Information Gateways eine Möglichkeit dafür darstellen. Es wird einige der Subject Gateway-Initiativen in Europa umreißen und die Werkzeuge und Technologien beschreiben, die vom Projekt DESIRE entwickelt wurden, um die Entwicklung neuer Gateways in anderen Ländern zu unterstützen. Es wird auch erörtert, wie IMesh, eine Gruppe für Gateways aus der ganzen Welt eine internationale Strategie für Gateways anstrebt und versucht, Standards zur Umsetzung dieses Projekts zu entwickeln