Search (2 results, page 1 of 1)

0.024985643 = product of:
  0.09994257 = sum of:
    0.09994257 = sum of:
      0.059197973 = weight(_text_:project in 2623) [ClassicSimilarity], result of:
        0.059197973 = score(doc=2623,freq=2.0), product of:
          0.21156175 = queryWeight, product of:
            4.220981 = idf(docFreq=1764, maxDocs=44218)
            0.050121464 = queryNorm
          0.27981415 = fieldWeight in 2623, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.220981 = idf(docFreq=1764, maxDocs=44218)
            0.046875 = fieldNorm(doc=2623)
      0.0407446 = weight(_text_:22 in 2623) [ClassicSimilarity], result of:
        0.0407446 = score(doc=2623,freq=2.0), product of:
          0.17551683 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050121464 = queryNorm
          0.23214069 = fieldWeight in 2623, 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=2623)
  0.25 = coord(1/4)

Abstract

Contemporary retrieval systems, which search across collections, usually ignore collection-level metadata. Alternative approaches, exploiting collection-level information, will require an understanding of the various kinds of relationships that can obtain between collection-level and item-level metadata. This paper outlines the problem and describes a project that is developing a logic-based framework for classifying collection/item metadata relationships. This framework will support (i) metadata specification developers defining metadata elements, (ii) metadata creators describing objects, and (iii) system designers implementing systems that take advantage of collection-level metadata. We present three examples of collection/item metadata relationship categories, attribute/value-propagation, value-propagation, and value-constraint and show that even in these simple cases a precise formulation requires modal notions in addition to first-order logic. These formulations are related to recent work in information retrieval and ontology evaluation.

Source

Metadata for semantic and social applications : proceedings of the International Conference on Dublin Core and Metadata Applications, Berlin, 22 - 26 September 2008, DC 2008: Berlin, Germany / ed. by Jane Greenberg and Wolfgang Klas

0.0057428335 = product of:
  0.022971334 = sum of:
    0.022971334 = weight(_text_:library in 4729) [ClassicSimilarity], result of:
      0.022971334 = score(doc=4729,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.17430481 = fieldWeight in 4729, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.046875 = fieldNorm(doc=4729)
  0.25 = coord(1/4)

Abstract

The task of an information architect is to create web sites where users can actually find the information they are looking for. As the ocean of information rises and leaves what we seek ever more deeply buried in what we don't seek, this discipline becomes ever more relevant. Information architecture involves many different aspects of web site creation and organization, but its principal tools are information organization techniques developed in other disciplines. Most of these techniques come from library science, such as thesauri, taxonomies, and faceted classification. Topic maps are a relative newcomer to this area and bring with them the promise of better-organized web sites, compared to what is possible with existing techniques. However, it is not generally understood how topic maps relate to the traditional techniques, and what advantages and disadvantages they have, compared to these techniques. The aim of this paper is to help build a better understanding of these issues.