Search (5 results, page 1 of 1)

0.009052756 = product of:
  0.036211025 = sum of:
    0.036211025 = weight(_text_:data in 4447) [ClassicSimilarity], result of:
      0.036211025 = score(doc=4447,freq=2.0), product of:
        0.14807065 = queryWeight, product of:
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.046827413 = queryNorm
        0.24455236 = fieldWeight in 4447, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1620505 = idf(docFreq=5088, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4447)
  0.25 = coord(1/4)

Abstract

The study looks at how well the distribution of "sitations" (inlinks received by Web spaces) fits either a power law (of the Lotka type) or a bibliometric distribution for printed publications (of the Bradford type). The experimental sample examines the sitations found in a closed generic environment of thematically-related Web sites - the case of Extremadura (Spain). Two sets of data, varying several parameters, were used. The sitation distributions found were coherent with those described in previous experiments of this type, including in the exponent. The plots of accumulated clusters of sitations and targets, however, did not fit the typical Bradford distribution.

0.008478476 = product of:
  0.033913903 = sum of:
    0.033913903 = product of:
      0.067827806 = sum of:
        0.067827806 = weight(_text_:processing in 2564) [ClassicSimilarity], result of:
          0.067827806 = score(doc=2564,freq=2.0), product of:
            0.18956426 = queryWeight, product of:
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.046827413 = queryNorm
            0.35780904 = fieldWeight in 2564, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.0625 = fieldNorm(doc=2564)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Source

Information processing and management. 38(2002) no.1, S.79-89

0.0074939844 = product of:
  0.029975938 = sum of:
    0.029975938 = product of:
      0.059951875 = sum of:
        0.059951875 = weight(_text_:processing in 2371) [ClassicSimilarity], result of:
          0.059951875 = score(doc=2371,freq=4.0), product of:
            0.18956426 = queryWeight, product of:
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.046827413 = queryNorm
            0.3162615 = fieldWeight in 2371, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2371)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Network scaling algorithms such as the Pathfinder algorithm are used to prune many different kinds of networks, including citation networks, random networks, and social networks. However, this algorithm suffers from run time problems for large networks and online processing due to its O(n**4) time complexity. In this article, we introduce a new alternative, the MST-Pathfinder algorithm, which will allow us to prune the original network to get its PFNET(oo, n - 1) in just O(n**2 · log n) time. The underlying idea comes from the fact that the union (superposition) of all the Minimum Spanning Trees extracted from a given network is equivalent to the PFNET resulting from the Pathfinder algorithm parameterized by a specific set of values (r = oo and q = n - 1), those usually considered in many different applications. Although this property is well-known in the literature, it seems that no algorithm based on it has been proposed, up to now, to decrease the high computational cost of the original Pathfinder algorithm. We also present a mathematical proof of the correctness of this new alternative and test its good efficiency in two different case studies: one dedicated to the post-processing of large random graphs, and the other one to a real world case in which medium networks obtained by a cocitation analysis of the scientific domains in different countries are pruned.

0.007418666 = product of:
  0.029674664 = sum of:
    0.029674664 = product of:
      0.05934933 = sum of:
        0.05934933 = weight(_text_:processing in 1006) [ClassicSimilarity], result of:
          0.05934933 = score(doc=1006,freq=2.0), product of:
            0.18956426 = queryWeight, product of:
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.046827413 = queryNorm
            0.3130829 = fieldWeight in 1006, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1006)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Source

Information processing and management. 41(2005) no.2, S.331-346

0.007418666 = product of:
  0.029674664 = sum of:
    0.029674664 = product of:
      0.05934933 = sum of:
        0.05934933 = weight(_text_:processing in 1076) [ClassicSimilarity], result of:
          0.05934933 = score(doc=1076,freq=2.0), product of:
            0.18956426 = queryWeight, product of:
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.046827413 = queryNorm
            0.3130829 = fieldWeight in 1076, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.048147 = idf(docFreq=2097, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1076)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Source

Information processing and management. 39(2003) no.5, S.669-687