Search (3 results, page 1 of 1)

0.0028252148 = product of:
  0.025426934 = sum of:
    0.025426934 = product of:
      0.050853867 = sum of:
        0.050853867 = weight(_text_:web in 4457) [ClassicSimilarity], result of:
          0.050853867 = score(doc=4457,freq=12.0), product of:
            0.09596372 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.02940506 = queryNorm
            0.5299281 = fieldWeight in 4457, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=4457)
      0.5 = coord(1/2)
  0.11111111 = coord(1/9)

Abstract

With increasing digital information availability, semantic web technologies have been employed to construct semantic digital libraries in order to ease information comprehension. The use of semantic web enables users to search or visualize resources in a semantic fashion. Semantic web generation is a key process in semantic digital library construction, which converts metadata of digital resources into semantic web data. Many text mining technologies, such as keyword extraction and clustering, have been proposed to generate semantic web data. However, one important type of metadata in publications, called affiliation, is hard to convert into semantic web data precisely because different authors, who have the same affiliation, often express the affiliation in different ways. To address this issue, this paper proposes a clustering method based on normalized compression distance for the purpose of affiliation disambiguation. The experimental results show that our method is able to identify different affiliations that denote the same institutes. The clustering results outperform the well-known k-means clustering method in terms of average precision, F-measure, entropy, and purity.

0.001106661 = product of:
  0.009959949 = sum of:
    0.009959949 = product of:
      0.019919898 = sum of:
        0.019919898 = weight(_text_:22 in 1012) [ClassicSimilarity], result of:
          0.019919898 = score(doc=1012,freq=2.0), product of:
            0.10297151 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02940506 = queryNorm
            0.19345059 = fieldWeight in 1012, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1012)
      0.5 = coord(1/2)
  0.11111111 = coord(1/9)

Date

22. 6.2023 14:55:20

9.611576E-4 = product of:
  0.008650418 = sum of:
    0.008650418 = product of:
      0.017300837 = sum of:
        0.017300837 = weight(_text_:web in 98) [ClassicSimilarity], result of:
          0.017300837 = score(doc=98,freq=2.0), product of:
            0.09596372 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.02940506 = queryNorm
            0.18028519 = fieldWeight in 98, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=98)
      0.5 = coord(1/2)
  0.11111111 = coord(1/9)

Abstract

With the development of Web-based social networks, many personalized tag recommendation approaches based on multi-information have been proposed. Due to the differences in users' preferences, different users care about different kinds of information. In the meantime, different elements within each kind of information are differentially informative for user tagging behaviors. In this context, how to effectively integrate different elements and different information separately becomes a key part of tag recommendation. However, the existing methods ignore this key part. In order to address this problem, we propose a deep neural network for tag recommendation. Specifically, we model two important attentive aspects with a hierarchical attention model. For different user-item pairs, the bottom layered attention network models the influence of different elements on the features representation of the information while the top layered attention network models the attentive scores of different information. To verify the effectiveness of the proposed method, we conduct extensive experiments on two real-world data sets. The results show that using attention network and different kinds of information can significantly improve the performance of the recommendation model, and verify the effectiveness and superiority of our proposed model.