Search (7 results, page 1 of 1)

0.014146109 = product of:
  0.028292218 = sum of:
    0.028292218 = product of:
      0.056584436 = sum of:
        0.056584436 = weight(_text_:22 in 77) [ClassicSimilarity], result of:
          0.056584436 = score(doc=77,freq=2.0), product of:
            0.18281296 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052204985 = queryNorm
            0.30952093 = fieldWeight in 77, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=77)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

4.12.2006 12:12:22

0.012503512 = product of:
  0.025007024 = sum of:
    0.025007024 = product of:
      0.05001405 = sum of:
        0.05001405 = weight(_text_:22 in 2734) [ClassicSimilarity], result of:
          0.05001405 = score(doc=2734,freq=4.0), product of:
            0.18281296 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052204985 = queryNorm
            0.27358043 = fieldWeight in 2734, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2734)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Collaboration is a major research policy objective, but does it deliver higher quality research? This study uses citation analysis to examine the Web of Science (WoS) Information Science & Library Science subject category (IS&LS) to ascertain whether, in general, more highly cited articles are more highly collaborative than other articles. It consists of two investigations. The first investigation is a longitudinal comparison of the degree and proportion of collaboration in five strata of citation; it found that collaboration in the highest four citation strata (all in the most highly cited 22%) increased in unison over time, whereas collaboration in the lowest citation strata (un-cited articles) remained low and stable. Given that over 40% of the articles were un-cited, it seems important to take into account the differences found between un-cited articles and relatively highly cited articles when investigating collaboration in IS&LS. The second investigation compares collaboration for 35 influential information scientists; it found that their more highly cited articles on average were not more highly collaborative than their less highly cited articles. In summary, although collaborative research is conducive to high citation in general, collaboration has apparently not tended to be essential to the success of current and former elite information scientists.

Date

22. 3.2009 12:43:51

0.011195658 = product of:
  0.022391316 = sum of:
    0.022391316 = product of:
      0.04478263 = sum of:
        0.04478263 = weight(_text_:retrieval in 2571) [ClassicSimilarity], result of:
          0.04478263 = score(doc=2571,freq=4.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.2835858 = fieldWeight in 2571, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=2571)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

A common task in both Webmetrics and Web information retrieval is to identify a set of Web pages or sites that are similar in content. In this paper we assess the extent to which links, colinks and couplings can be used to identify similar Web sites. As an experiment, a random sample of 500 pairs of domains from the UK academic Web were taken and human assessments of site similarity, based upon content type, were compared against ratings for the three concepts. The results show that using a combination of all three gives the highest probability of identifying similar sites, but surprisingly this was only a marginal improvement over using links alone. Another unexpected result was that high values for either colink counts or couplings were associated with only a small increased likelihood of similarity. The principal advantage of using couplings and colinks was found to be greater coverage in terms of a much larger number of pairs of sites being connected by these measures, instead of increased probability of similarity. In information retrieval terminology, this is improved recall rather than improved precision.

0.009329714 = product of:
  0.018659428 = sum of:
    0.018659428 = product of:
      0.037318856 = sum of:
        0.037318856 = weight(_text_:retrieval in 4450) [ClassicSimilarity], result of:
          0.037318856 = score(doc=4450,freq=4.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.23632148 = fieldWeight in 4450, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4450)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

A layered approach for identifying communities in the Web is presented and explored by applying the flake exact community identification algorithm to the UK academic Web. Although community or topic identification is a common task in information retrieval, a new perspective is developed by: the application of alternative document models, shifting the focus from individual pages to aggregated collections based upon Web directories, domains and entire sites; the removal of internal site links; and the adaptation of a new fast algorithm to allow fully-automated community identification using all possible single starting points. The overall topology of the graphs in the three least-aggregated layers was first investigated and found to include a large number of isolated points but, surprisingly, with most of the remainder being in one huge connected component, exact proportions varying by layer. The community identification process then found that the number of communities far exceeded the number of topological components, indicating that community identification is a potentially useful technique, even with random starting points. Both the number and size of communities identified was dependent on the parameter of the algorithm, with very different results being obtained in each case. In conclusion, the UK academic Web is embedded with layers of non-trivial communities and, if it is not unique in this, then there is the promise of improved results for information retrieval algorithms that can exploit this additional structure, and the application of the technique directly to partially automate Web metrics tasks such as that of finding all pages related to a given subject hosted by a single country's universities.

0.008841318 = product of:
  0.017682636 = sum of:
    0.017682636 = product of:
      0.035365272 = sum of:
        0.035365272 = weight(_text_:22 in 586) [ClassicSimilarity], result of:
          0.035365272 = score(doc=586,freq=2.0), product of:
            0.18281296 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.052204985 = queryNorm
            0.19345059 = fieldWeight in 586, 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=586)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Although the analysis of citations in the scholarly literature is now an established and relatively well understood part of information science, not enough is known about citations that can be found on the Web. In particular, are there new Web types, and if so, are these trivial or potentially useful for studying or evaluating research communication? We sought evidence based upon a sample of 1,577 Web citations of the URLs or titles of research articles in 64 open-access journals from biology, physics, chemistry, and computing. Only 25% represented intellectual impact, from references of Web documents (23%) and other informal scholarly sources (2%). Many of the Web/URL citations were created for general or subject-specific navigation (45%) or for self-publicity (22%). Additional analyses revealed significant disciplinary differences in the types of Google unique Web/URL citations as well as some characteristics of scientific open-access publishing on the Web. We conclude that the Web provides access to a new and different type of citation information, one that may therefore enable us to measure different aspects of research, and the research process in particular; but to obtain good information, the different types should be separated.

0.007916525 = product of:
  0.01583305 = sum of:
    0.01583305 = product of:
      0.0316661 = sum of:
        0.0316661 = weight(_text_:retrieval in 4457) [ClassicSimilarity], result of:
          0.0316661 = score(doc=4457,freq=2.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.20052543 = fieldWeight in 4457, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=4457)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Google's PageRank is an influential algorithm that uses a model of Web use that is dominated by its link structure in order to rank pages by their estimated value to the Web community. This paper reports on the outcome of applying the algorithm to the Web sites of three national university systems in order to test whether it is capable of identifying the most important Web pages. The results are also compared with simple inlink counts. It was discovered that the highest inlinked pages do not always have the highest PageRank, indicating that the two metrics are genuinely different, even for the top pages. More significantly, however, internal links dominated external links for the high ranks in either method and superficial reasons accounted for high scores in both cases. It is concluded that PageRank is not useful for identifying the top pages in a site and that it must be combined with a powerful text matching techniques in order to get the quality of information retrieval results provided by Google.

0.007916525 = product of:
  0.01583305 = sum of:
    0.01583305 = product of:
      0.0316661 = sum of:
        0.0316661 = weight(_text_:retrieval in 674) [ClassicSimilarity], result of:
          0.0316661 = score(doc=674,freq=2.0), product of:
            0.15791564 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.052204985 = queryNorm
            0.20052543 = fieldWeight in 674, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=674)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Introduces several new versions of PageRank (the link based Web page ranking algorithm), based on an information science perspective on the concept of the Web document. Although the Web page is the typical indivisible unit of information in search engine results and most Web information retrieval algorithms, other research has suggested that aggregating pages based on directories and domains gives promising alternatives, particularly when Web links are the object of study. The new algorithms introduced based on these alternatives were used to rank four sets of Web pages. The ranking results were compared with human subjects' rankings. The results of the tests were somewhat inconclusive: the new approach worked well for the set that includes pages from different Web sites; however, it does not work well in ranking pages that are from the same site. It seems that the new algorithms may be effective for some tasks but not for others, especially when only low numbers of links are involved or the pages to be ranked are from the same site or directory.