Search (5 results, page 1 of 1)

  • × theme_ss:"Klassifikationssysteme im Online-Retrieval"
  • × theme_ss:"Klassifikationstheorie: Elemente / Struktur"
  • × type_ss:"a"
  • × year_i:[1990 TO 2000}
  1. Kwasnik, B.H.: ¬The role of classification in knowledge representation (1999) 0.02 
    0.024460753 = product of:
  0.048921507 = sum of:
    0.048921507 = sum of:
      0.011481222 = weight(_text_:a in 2464) [ClassicSimilarity], result of:
        0.011481222 = score(doc=2464,freq=16.0), product of:
          0.053105544 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.046056706 = queryNorm
          0.2161963 = fieldWeight in 2464, product of:
            4.0 = tf(freq=16.0), with freq of:
              16.0 = termFreq=16.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.046875 = fieldNorm(doc=2464)
      0.037440285 = weight(_text_:22 in 2464) [ClassicSimilarity], result of:
        0.037440285 = score(doc=2464,freq=2.0), product of:
          0.16128273 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046056706 = queryNorm
          0.23214069 = fieldWeight in 2464, 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=2464)
  0.5 = coord(1/2)
    Abstract
    A fascinating, broad-ranging article about classification, knowledge, and how they relate. Hierarchies, trees, paradigms (a two-dimensional classification that can look something like a spreadsheet), and facets are covered, with descriptions of how they work and how they can be used for knowledge discovery and creation. Kwasnick outlines how to make a faceted classification: choose facets, develop facets, analyze entities using the facets, and make a citation order. Facets are useful for many reasons: they do not require complete knowledge of the entire body of material; they are hospitable, flexible, and expressive; they do not require a rigid background theory; they can mix theoretical structures and models; and they allow users to view things from many perspectives. Facets do have faults: it can be hard to pick the right ones; it is hard to show relations between them; and it is difficult to visualize them. The coverage of the other methods is equally thorough and there is much to consider for anyone putting a classification on the web.
    Source
    Library trends. 48(1999) no.1, S.22-47
    Type
    a
  2. Spiteri, L.: ¬A simplified model for facet analysis : Ranganathan 101 (1998) 0.00 
    0.0024857575 = product of:
  0.004971515 = sum of:
    0.004971515 = product of:
      0.00994303 = sum of:
        0.00994303 = weight(_text_:a in 3842) [ClassicSimilarity], result of:
          0.00994303 = score(doc=3842,freq=12.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.18723148 = fieldWeight in 3842, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3842)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Ranganathan's canons, principles, and postulates can easily confuse readers, especially because he revised and added to them in various editions of his many books. The Classification Research Group, who drew on Ranganathan's work as their basis for classification theory but developed it in their own way, has never clearly organized all their equivalent canons and principles. In this article Spiteri gathers the fundamental rules from both systems and compares and contrasts them. She makes her own clearer set of principles for constructing facets, stating the subject of a document, and designing notation. Spiteri's "simplified model" is clear and understandable, but certainly not simplistic. The model does not include methods for making a faceted system, but will serve as a very useful guide in how to turn initial work into a rigorous classification. Highly recommended
    Type
    a
  3. Ellis, D.; Vasconcelos, A.: Ranganathan and the Net : using facet analysis to search and organise the World Wide Web (1999) 0.00 
    0.0024857575 = product of:
  0.004971515 = sum of:
    0.004971515 = product of:
      0.00994303 = sum of:
        0.00994303 = weight(_text_:a in 726) [ClassicSimilarity], result of:
          0.00994303 = score(doc=726,freq=12.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.18723148 = fieldWeight in 726, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=726)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    This paper documents the continuing relevance of facet analysis as a technique for searching and organising WWW based materials. The 2 approaches underlying WWW searching and indexing - word and concept based indexing - are outlined. It is argued that facet analysis as an a posteriori approach to classification using words from the subject field as the concept terms in the classification derived represents an excellent approach to searching and organising the results of WWW searches using either search engines or search directories. Finally it is argued that the underlying philosophy of facet analysis is better suited to the disparate nature of WWW resources and searchers than the assumptions of contemporaray IR research.
    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.
    Type
    a
  4. Gödert, W.: Strukturierung von Klassifikationssystemen und Online-Retrieval (1995) 0.00 
    0.0016913437 = product of:
  0.0033826875 = sum of:
    0.0033826875 = product of:
      0.006765375 = sum of:
        0.006765375 = weight(_text_:a in 922) [ClassicSimilarity], result of:
          0.006765375 = score(doc=922,freq=2.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.12739488 = fieldWeight in 922, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.078125 = fieldNorm(doc=922)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Type
    a
  5. Pocock, H.: Classification schemes : development and survival (1997) 0.00 
    0.0016913437 = product of:
  0.0033826875 = sum of:
    0.0033826875 = product of:
      0.006765375 = sum of:
        0.006765375 = weight(_text_:a in 762) [ClassicSimilarity], result of:
          0.006765375 = score(doc=762,freq=2.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.12739488 = fieldWeight in 762, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.078125 = fieldNorm(doc=762)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Type
    a

Authors

Languages