Search (10 results, page 1 of 1)

0.008523934 = product of:
  0.042619668 = sum of:
    0.042619668 = weight(_text_:22 in 1347) [ClassicSimilarity], result of:
      0.042619668 = score(doc=1347,freq=2.0), product of:
        0.18359412 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052428056 = queryNorm
        0.23214069 = fieldWeight in 1347, 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=1347)
  0.2 = coord(1/5)

Date

22. 8.2014 17:12:54

0.004893632 = product of:
  0.02446816 = sum of:
    0.02446816 = weight(_text_:1 in 2294) [ClassicSimilarity], result of:
      0.02446816 = score(doc=2294,freq=2.0), product of:
        0.12878966 = queryWeight, product of:
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.052428056 = queryNorm
        0.18998542 = fieldWeight in 2294, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2294)
  0.2 = coord(1/5)

Abstract

Purpose: Investigate the combination of controlled and folksonomy approaches to support resource discovery in repositories and digital collections. Aim: Investigate whether use of an established controlled vocabulary can help improve social tagging for better resource discovery. Objectives: (1) Investigate indexing aspects when using only social tagging versus when using social tagging with suggestions from a controlled vocabulary; (2) Investigate above in two different contexts: tagging by readers and tagging by authors; (3) Investigate influence of only social tagging versus social tagging with a controlled vocabulary on retrieval. - Vgl.: http://www.ukoln.ac.uk/projects/enhanced-tagging/.

0.004194542 = product of:
  0.020972708 = sum of:
    0.020972708 = weight(_text_:1 in 5897) [ClassicSimilarity], result of:
      0.020972708 = score(doc=5897,freq=2.0), product of:
        0.12878966 = queryWeight, product of:
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.052428056 = queryNorm
        0.16284466 = fieldWeight in 5897, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.046875 = fieldNorm(doc=5897)
  0.2 = coord(1/5)

Source

New review of hypermedia and multimedia. 12(2006) no.1, S.11-27

0.004194542 = product of:
  0.020972708 = sum of:
    0.020972708 = weight(_text_:1 in 134) [ClassicSimilarity], result of:
      0.020972708 = score(doc=134,freq=2.0), product of:
        0.12878966 = queryWeight, product of:
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.052428056 = queryNorm
        0.16284466 = fieldWeight in 134, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.046875 = fieldNorm(doc=134)
  0.2 = coord(1/5)

Isbn

978-1-61969-577-0

0.004194542 = product of:
  0.020972708 = sum of:
    0.020972708 = weight(_text_:1 in 4558) [ClassicSimilarity], result of:
      0.020972708 = score(doc=4558,freq=2.0), product of:
        0.12878966 = queryWeight, product of:
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.052428056 = queryNorm
        0.16284466 = fieldWeight in 4558, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.046875 = fieldNorm(doc=4558)
  0.2 = coord(1/5)

Abstract

While automated methods for information organization have been around for several decades now, exponential growth of the World Wide Web has put them into the forefront of research in different communities, within which several approaches can be identified: 1) machine learning (algorithms that allow computers to improve their performance based on learning from pre-existing data); 2) document clustering (algorithms for unsupervised document organization and automated topic extraction); and 3) string matching (algorithms that match given strings within larger text). Here the aim was to automatically organize textual documents into hierarchical structures for subject browsing. The string-matching approach was tested using a controlled vocabulary (containing pre-selected and pre-defined authorized terms, each corresponding to only one concept). The results imply that an appropriate controlled vocabulary, with a sufficient number of entry terms designating classes, could in itself be a solution for automated classification. Then, if the same controlled vocabulary had an appropriat hierarchical structure, it would at the same time provide a good browsing structure for the collection of automatically classified documents.

0.0034954515 = product of:
  0.017477257 = sum of:
    0.017477257 = weight(_text_:1 in 5600) [ClassicSimilarity], result of:
      0.017477257 = score(doc=5600,freq=2.0), product of:
        0.12878966 = queryWeight, product of:
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.052428056 = queryNorm
        0.13570388 = fieldWeight in 5600, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5600)
  0.2 = coord(1/5)

Date

1. 8.2006 11:52:43

0.0034954515 = product of:
  0.017477257 = sum of:
    0.017477257 = weight(_text_:1 in 3311) [ClassicSimilarity], result of:
      0.017477257 = score(doc=3311,freq=2.0), product of:
        0.12878966 = queryWeight, product of:
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.052428056 = queryNorm
        0.13570388 = fieldWeight in 3311, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3311)
  0.2 = coord(1/5)

Source

Journal of the Association for Information Science and Technology. 67(2016) no.1, S.3-16

0.0034954515 = product of:
  0.017477257 = sum of:
    0.017477257 = weight(_text_:1 in 4379) [ClassicSimilarity], result of:
      0.017477257 = score(doc=4379,freq=2.0), product of:
        0.12878966 = queryWeight, product of:
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.052428056 = queryNorm
        0.13570388 = fieldWeight in 4379, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4379)
  0.2 = coord(1/5)

Date

1. 8.2018 12:26:30

0.0034954515 = product of:
  0.017477257 = sum of:
    0.017477257 = weight(_text_:1 in 5398) [ClassicSimilarity], result of:
      0.017477257 = score(doc=5398,freq=2.0), product of:
        0.12878966 = queryWeight, product of:
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.052428056 = queryNorm
        0.13570388 = fieldWeight in 5398, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5398)
  0.2 = coord(1/5)

Date

1. 7.2019 18:49:14

0.002796361 = product of:
  0.013981805 = sum of:
    0.013981805 = weight(_text_:1 in 688) [ClassicSimilarity], result of:
      0.013981805 = score(doc=688,freq=2.0), product of:
        0.12878966 = queryWeight, product of:
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.052428056 = queryNorm
        0.1085631 = fieldWeight in 688, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.4565027 = idf(docFreq=10304, maxDocs=44218)
          0.03125 = fieldNorm(doc=688)
  0.2 = coord(1/5)

Abstract

Purpose The study aims to paint a representative picture of the current state of search interfaces of Swedish online museum collections, focussing on search functionalities with particular reference to subject searching, as well as the use of controlled vocabularies, with the purpose of identifying which improvements of the search interfaces are needed to ensure high-quality information retrieval for the end user. Design/methodology/approach In the first step, a set of 21 search interface criteria was identified, based on related research and current standards in the domain of cultural heritage knowledge organization. Secondly, a complete set of Swedish museums that provide online access to their collections was identified, comprising nine cross-search services and 91 individual museums' websites. These 100 websites were each evaluated against the 21 criteria, between 1 July and 31 August 2020. Findings Although many standards and guidelines are in place to ensure quality-controlled subject indexing, which in turn support information retrieval of relevant resources (as individual or full search results), the study shows that they are not broadly implemented, resulting in information retrieval failures for the end user. The study also demonstrates a strong need for the implementation of controlled vocabularies in these museums. Originality/value This study is a rare piece of research which examines subject searching in online museums; the 21 search criteria and their use in the analysis of the complete set of online collections of a country represents a considerable and unique contribution to the fields of knowledge organization and information retrieval of cultural heritage. Its particular value lies in showing how the needs of end users, many of which are documented and reflected in international standards and guidelines, should be taken into account in designing search tools for these museums; especially so in subject searching, which is the most complex and yet the most common type of search. Much effort has been invested into digitizing cultural heritage collections, but access to them is hindered by poor search functionality. This study identifies which are the most important aspects to improve.