Search (2 results, page 1 of 1)

0.011047398 = product of:
  0.022094795 = sum of:
    0.022094795 = product of:
      0.04418959 = sum of:
        0.04418959 = weight(_text_:b in 4574) [ClassicSimilarity], result of:
          0.04418959 = score(doc=4574,freq=2.0), product of:
            0.16126883 = queryWeight, product of:
              3.542962 = idf(docFreq=3476, maxDocs=44218)
              0.045518078 = queryNorm
            0.27401197 = fieldWeight in 4574, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.542962 = idf(docFreq=3476, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4574)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Facettenklassifikationen wurden bislang vorwiegend im Hinblick auf ihre Verwendungsmöglichkeiten in präkombinierten systematischen Katalogen bzw. Bibliographien betrachtet, nicht so sehr unter dem Aspekt eines möglichen Einsatzes in postkoordinierenden Retrievalsystemen. Im vorliegenden Beitrag soll nachgewiesen werden, daß Facettenklassifikationen anderen Techniken des Online Retrievals überlegen sein können. Hierzu sollten Begriffs- und Facettenanalyse mit einem strukturabbildenden Notationssystem kombiniert werden, um mit Hilfe Boolescher Operatoren (zur Verknüpfung von Facetten unabhängig von einer definierten Citation order) und Truncierung hierarchisch differenzierte Dokumentenmengen für komplexe Fragestellungen zu erhalten. Die Methode wird an zwei Beispielen illustriert: das erste nutzt eine kleine, von B. Buchanan entwickelte Klassifikation, das zweite das für Library and Information Science Abstracts (LISA) verwendete Klassifikationssystem. Weiter wird am Beispiel PRECIS diskutiert, welche Möglichkeiten des syntaktischen Retrievals Rollenoperatoren bieten können.

0.007890998 = product of:
  0.015781997 = sum of:
    0.015781997 = product of:
      0.031563994 = sum of:
        0.031563994 = weight(_text_:b in 5825) [ClassicSimilarity], result of:
          0.031563994 = score(doc=5825,freq=2.0), product of:
            0.16126883 = queryWeight, product of:
              3.542962 = idf(docFreq=3476, maxDocs=44218)
              0.045518078 = queryNorm
            0.19572285 = fieldWeight in 5825, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.542962 = idf(docFreq=3476, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5825)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The study of faceted classification systems has primarily been directed towards application for precombined catalogues or bibliographies, not so much for use in post coordinated retrieval systems. Argues that faceted classification systems in some respects are superior to other techniques of on-line retrieval as far as facet and concept analysis is combined with an expressive notational system in order to guide a form of retrieval which will use Boolean operators (for combining the facets regardless of one special citation order) and truncation for retrieving hierarchically different sets of documents. This point of view is demonstrated by 2 examples. The 1st one uses a short classification system derived from B. Buchanan and the 2nd is built upon the classification system used by Library and Information Science Abstracts (LISA). Further discussion is concerned with some possible consequences which could be derived from a retrieval with PRECIS strings