Search (2 results, page 1 of 1)

  • × author_ss:"Willett, P."
  • × theme_ss:"Retrievalalgorithmen"
  1. Al-Hawamdeh, S.; Smith, G.; Willett, P.; Vere, R. de: Using nearest-neighbour searching techniques to access full-text documents (1991) 0.02 
    0.016153201 = product of:
  0.0969192 = sum of:
    0.0969192 = weight(_text_:ranking in 2300) [ClassicSimilarity], result of:
      0.0969192 = score(doc=2300,freq=2.0), product of:
        0.20271951 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.03747799 = queryNorm
        0.47809508 = fieldWeight in 2300, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.0625 = fieldNorm(doc=2300)
  0.16666667 = coord(1/6)
    Abstract
    Summarises the results to date of a continuing programme of research at Sheffield Univ. to investigate the use of nearest-neighbour retrieval algorithms for full text searching. Given a natural language query statement, the research methods result in a ranking of the paragraphs comprising a full text document in order of decreasing similarity with the query, where the similarity for each paragraph is determined by the number of keyword stems that it has in common with the query
  2. Li, J.; Willett, P.: ArticleRank : a PageRank-based alternative to numbers of citations for analysing citation networks (2009) 0.01 
    0.010095751 = product of:
  0.0605745 = sum of:
    0.0605745 = weight(_text_:ranking in 751) [ClassicSimilarity], result of:
      0.0605745 = score(doc=751,freq=2.0), product of:
        0.20271951 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.03747799 = queryNorm
        0.29880944 = fieldWeight in 751, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.0390625 = fieldNorm(doc=751)
  0.16666667 = coord(1/6)
    Abstract
    Purpose - The purpose of this paper is to suggest an alternative to the widely used Times Cited criterion for analysing citation networks. The approach involves taking account of the natures of the papers that cite a given paper, so as to differentiate between papers that attract the same number of citations. Design/methodology/approach - ArticleRank is an algorithm that has been derived from Google's PageRank algorithm to measure the influence of journal articles. ArticleRank is applied to two datasets - a citation network based on an early paper on webometrics, and a self-citation network based on the 19 most cited papers in the Journal of Documentation - using citation data taken from the Web of Knowledge database. Findings - ArticleRank values provide a different ranking of a set of papers from that provided by the corresponding Times Cited values, and overcomes the inability of the latter to differentiate between papers with the same numbers of citations. The difference in rankings between Times Cited and ArticleRank is greatest for the most heavily cited articles in a dataset. Originality/value - This is a novel application of the PageRank algorithm.

Authors

Years