Search (2 results, page 1 of 1)

  • × type_ss:"el"
  • × theme_ss:"Universale Facettenklassifikationen"
  1. Gnoli, C.: "Classic"vs. "freely" faceted classification (2007) 0.01
    0.005637133 = product of:
      0.045097064 = sum of:
        0.045097064 = product of:
          0.09019413 = sum of:
            0.09019413 = weight(_text_:area in 715) [ClassicSimilarity], result of:
              0.09019413 = score(doc=715,freq=4.0), product of:
                0.1952553 = queryWeight, product of:
                  4.927245 = idf(docFreq=870, maxDocs=44218)
                  0.03962768 = queryNorm
                0.46192923 = fieldWeight in 715, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  4.927245 = idf(docFreq=870, maxDocs=44218)
                  0.046875 = fieldNorm(doc=715)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Abstract
    Claudio Gnoli of the University of Pavia in Italy and Chair of ISKO Italy, explored the relative merits of classic 'faceted classification' (FC) and 'freely faceted classification' (FFC). In classic FC, the facets (and their relationships) which might be combined to express a compound subject, are restricted to those prescribed as inherent in the subject area. FC is therefore largely bounded by and restricted to a specific subject area. At the other extreme, free classification (as in the Web or folksonomies) allows the combination of values from multiple, disparate domains where the relationships among the elements are often indeterminate, and the semantics obscure. Claudio described how punched cards were an early example of free classification, and cited the coordination of dogs : postmen : bites as one where the absence of defined relationships made the semantics ambiguous
  2. Frické, M.: Logical division (2016) 0.00
    0.0029530365 = product of:
      0.023624292 = sum of:
        0.023624292 = weight(_text_:libraries in 3183) [ClassicSimilarity], result of:
          0.023624292 = score(doc=3183,freq=2.0), product of:
            0.13017908 = queryWeight, product of:
              3.2850544 = idf(docFreq=4499, maxDocs=44218)
              0.03962768 = queryNorm
            0.18147534 = fieldWeight in 3183, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2850544 = idf(docFreq=4499, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3183)
      0.125 = coord(1/8)
    
    Abstract
    Division is obviously important to Knowledge Organization. Typically, an organizational infrastructure might acknowledge three types of connecting relationships: class hierarchies, where some classes are subclasses of others, partitive hierarchies, where some items are parts of others, and instantiation, where some items are members of some classes (see Z39.19 ANSI/NISO 2005 as an example). The first two of these involve division (the third, instantiation, does not involve division). Logical division would usually be a part of hierarchical classification systems, which, in turn, are central to shelving in libraries, to subject classification schemes, to controlled vocabularies, and to thesauri. Partitive hierarchies, and partitive division, are often essential to controlled vocabularies, thesauri, and subject tagging systems. Partitive hierarchies also relate to the bearers of information; for example, a journal would typically have its component articles as parts and, in turn, they might have sections as their parts, and, of course, components might be arrived at by partitive division (see Tillett 2009 as an illustration). Finally, verbal division, disambiguating homographs, is basic to controlled vocabularies. Thus Division is a broad and relevant topic. This article, though, is going to focus on Logical Division.