Search (88 results, page 5 of 5)

0.0030039945 = product of:
  0.012015978 = sum of:
    0.012015978 = weight(_text_:information in 4574) [ClassicSimilarity], result of:
      0.012015978 = score(doc=4574,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13576832 = fieldWeight in 4574, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4574)
  0.25 = coord(1/4)

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.0025748524 = product of:
  0.01029941 = sum of:
    0.01029941 = weight(_text_:information in 8) [ClassicSimilarity], result of:
      0.01029941 = score(doc=8,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.116372846 = fieldWeight in 8, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=8)
  0.25 = coord(1/4)

Content

Enthält die Beiträge: LISCHEWSKY-WEISER, B.: Die Systematik im OPAC; GREINER, G.: Facettensysteme; LORENZ, B.: Überlegungen zur Aufstellungsklassifikation; HERMES, H.-J.: Dezimalklassifikation: zum gegenwärtigen Stand der UDK; TRAISER, W.: Die Deutsche Bibliothek: Schlagwort-Klassifikation und Conspectus; BIES, W.: Inhaltserschließung: Versuch einer bibliothekswissenschaftlichen Didaktik; RECKER-KOTULLA, I.: Die niederländische Basisklassifikation als Instrument der kooperativen Sacherschließung; JEDWABSKI, B. u. K. SCHRÖDER: UBOK: Der Dortmunder Universitätsbibliotheks-Online-Katalog; KOWALK, W.: Der Saarbrücker Sachkatalog nach der Methode Eppelsheimer im OPAC; NOHR, H.: Präkombination klassifikatorischer und verbaler Sacherschließungsdaten und ihr Potential im Information Retrieval

0.0025748524 = product of:
  0.01029941 = sum of:
    0.01029941 = weight(_text_:information in 3735) [ClassicSimilarity], result of:
      0.01029941 = score(doc=3735,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.116372846 = fieldWeight in 3735, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3735)
  0.25 = coord(1/4)

Source

Library science with a slant to documentation and information studies. 32(1995) no.2, S.57-63

0.0025748524 = product of:
  0.01029941 = sum of:
    0.01029941 = weight(_text_:information in 5698) [ClassicSimilarity], result of:
      0.01029941 = score(doc=5698,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.116372846 = fieldWeight in 5698, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=5698)
  0.25 = coord(1/4)

Source

Information world review. 1996, no.120, S.47-48

0.0025748524 = product of:
  0.01029941 = sum of:
    0.01029941 = weight(_text_:information in 3842) [ClassicSimilarity], result of:
      0.01029941 = score(doc=3842,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.116372846 = fieldWeight in 3842, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3842)
  0.25 = coord(1/4)

Source

Canadian journal of information and library science. 23(1998) nos.1/2, S.1-30

0.0025748524 = product of:
  0.01029941 = sum of:
    0.01029941 = weight(_text_:information in 5571) [ClassicSimilarity], result of:
      0.01029941 = score(doc=5571,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.116372846 = fieldWeight in 5571, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=5571)
  0.25 = coord(1/4)

Footnote

Paper presented at the 36th Allerton Institute, 23-25 Oct 94, Allerton Park, Monticello, IL: "New Roles for Classification in Libraries and Information Networks: Presentation and Reports"

0.0025748524 = product of:
  0.01029941 = sum of:
    0.01029941 = weight(_text_:information in 5968) [ClassicSimilarity], result of:
      0.01029941 = score(doc=5968,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.116372846 = fieldWeight in 5968, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=5968)
  0.25 = coord(1/4)

Abstract

Some empirical studies have explored the direct use of traditional classification schemes in the online environment; none has manipulated these manual classifications in such a way as to take full advantage of the power of both the classification and computer. It has been suggested that this power could be realized if the individual components of synthesized DDC numbers could be identified and indexed. Looks at the feasibility of automatically decomposing DDC synthesized numbers and the implications of such decompositions for informational retrieval. 1.701 sythesized numbers were decomposed by a computer system called DND (Dewey Number Decomposer). 600 were randomly selected for examination by 3 judges, each evaluating 200 numbers. The decomposition success rate was 100% and it was concluded that synthesized DDC numbers can be accurately decomposed automatically. The study has implications for information retrieval, expert systems for assigning DDC numbers, automatic indexing, switching language development and other important areas of cataloguing and classification

0.0025748524 = product of:
  0.01029941 = sum of:
    0.01029941 = weight(_text_:information in 726) [ClassicSimilarity], result of:
      0.01029941 = score(doc=726,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.116372846 = fieldWeight in 726, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=726)
  0.25 = coord(1/4)

Abstract

This article gives a cheerfully brief and undetailed account of how to make a faceted classification system, then describes information retrieval and searching on the web. It concludes by saying that facets would be excellent in helping users search and browse the web, but offers no real clues as to how this can be done.