Search (6 results, page 1 of 1)

0.04189321 = product of:
  0.12567963 = sum of:
    0.12567963 = sum of:
      0.09445887 = weight(_text_:j.m in 3524) [ClassicSimilarity], result of:
        0.09445887 = score(doc=3524,freq=2.0), product of:
          0.28071982 = queryWeight, product of:
            6.091085 = idf(docFreq=271, maxDocs=44218)
            0.046086997 = queryNorm
          0.33648807 = fieldWeight in 3524, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            6.091085 = idf(docFreq=271, maxDocs=44218)
            0.0390625 = fieldNorm(doc=3524)
      0.03122076 = weight(_text_:22 in 3524) [ClassicSimilarity], result of:
        0.03122076 = score(doc=3524,freq=2.0), product of:
          0.16138881 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046086997 = queryNorm
          0.19345059 = fieldWeight in 3524, 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=3524)
  0.33333334 = coord(1/3)

Date

16.11.2017 13:30:22

0.015743146 = product of:
  0.047229435 = sum of:
    0.047229435 = product of:
      0.09445887 = sum of:
        0.09445887 = weight(_text_:j.m in 2494) [ClassicSimilarity], result of:
          0.09445887 = score(doc=2494,freq=2.0), product of:
            0.28071982 = queryWeight, product of:
              6.091085 = idf(docFreq=271, maxDocs=44218)
              0.046086997 = queryNorm
            0.33648807 = fieldWeight in 2494, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.091085 = idf(docFreq=271, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2494)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.015743146 = product of:
  0.047229435 = sum of:
    0.047229435 = product of:
      0.09445887 = sum of:
        0.09445887 = weight(_text_:j.m in 3014) [ClassicSimilarity], result of:
          0.09445887 = score(doc=3014,freq=2.0), product of:
            0.28071982 = queryWeight, product of:
              6.091085 = idf(docFreq=271, maxDocs=44218)
              0.046086997 = queryNorm
            0.33648807 = fieldWeight in 3014, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.091085 = idf(docFreq=271, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3014)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.008314378 = product of:
  0.024943132 = sum of:
    0.024943132 = product of:
      0.07482939 = sum of:
        0.07482939 = weight(_text_:authors in 4921) [ClassicSimilarity], result of:
          0.07482939 = score(doc=4921,freq=4.0), product of:
            0.21010205 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.046086997 = queryNorm
            0.35615736 = fieldWeight in 4921, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4921)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

Traditional text-based document classifiers tend to perform poorly an the Web. Text in Web documents is usually noisy and often does not contain enough information to determine their topic. However, the Web provides a different source that can be useful to document classification: its hyperlink structure. In this work, the authors evaluate how the link structure of the Web can be used to determine a measure of similarity appropriate for document classification. They experiment with five different similarity measures and determine their adequacy for predicting the topic of a Web page. Tests performed an a Web directory Show that link information alone allows classifying documents with an average precision of 86%. Further, when combined with a traditional textbased classifier, precision increases to values of up to 90%, representing gains that range from 63 to 132% over the use of text-based classification alone. Because the measures proposed in this article are straightforward to compute, they provide a practical and effective solution for Web classification and related information retrieval tasks. Further, the authors provide an important set of guidelines an how link structure can be used effectively to classify Web documents.

0.0058791526 = product of:
  0.017637458 = sum of:
    0.017637458 = product of:
      0.05291237 = sum of:
        0.05291237 = weight(_text_:authors in 1292) [ClassicSimilarity], result of:
          0.05291237 = score(doc=1292,freq=2.0), product of:
            0.21010205 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.046086997 = queryNorm
            0.25184128 = fieldWeight in 1292, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1292)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

We present a novel 3-step self-training method for author name disambiguation-SAND (self-training associative name disambiguator)-which requires no manual labeling, no parameterization (in real-world scenarios) and is particularly suitable for the common situation in which only the most basic information about a citation record is available (i.e., author names, and work and venue titles). During the first step, real-world heuristics on coauthors are able to produce highly pure (although fragmented) clusters. The most representative of these clusters are then selected to serve as training data for the third supervised author assignment step. The third step exploits a state-of-the-art transductive disambiguation method capable of detecting unseen authors not included in any training example and incorporating reliable predictions to the training data. Experiments conducted with standard public collections, using the minimum set of attributes present in a citation, demonstrate that our proposed method outperforms all representative unsupervised author grouping disambiguation methods and is very competitive with fully supervised author assignment methods. Thus, different from other bootstrapping methods that explore privileged, hard to obtain information such as self-citations and personal information, our proposed method produces topnotch performance with no (manual) training data or parameterization and in the presence of scarce information.

0.0052034603 = product of:
  0.01561038 = sum of:
    0.01561038 = product of:
      0.03122076 = sum of:
        0.03122076 = weight(_text_:22 in 3343) [ClassicSimilarity], result of:
          0.03122076 = score(doc=3343,freq=2.0), product of:
            0.16138881 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046086997 = queryNorm
            0.19345059 = fieldWeight in 3343, 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=3343)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

16.11.2017 13:04:22