Location of Repository

Finding Authorities and Hubs From Link Structures on the World Wide Web

By Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal and Panayiotis Tsaparas

Abstract

Recently, there have been a number of algorithms proposed for analyzing hypertext link structure so as to determine the best \authorities" for a given topic or query. While such analysis is usually combined with content analysis, there is a sense in which some algorithms are deemed to be \more balanced" and others \more focused". We undertake a comparative study of hypertext link analysis algorithms. Guided by some experimental queries, we propose some formal criteria for evaluating and comparing link analysis algorithms. Keywords: link analysis, web searching, hubs, authorities, SALSA, Kleinberg's algorithm, threshold, Bayesian. 1 Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 3G4. E-mail: bor@cs.toronto.edu. Web: http://www.cs.utoronto.ca/DCS/People/Faculty/bor.html 2 Department of Mathematics and Statistics, Lancaster University, Lancaster, U.K. LA1 4YF. E-mail: g.o.roberts@lancaster.ac.uk. Web: http://www.maths.lancs.ac.uk/dept/people/..

Topics: link analysis, web searching, hubs, authorities, SALSA, Kleinberg's algorithm, threshold, Bayesian. 1
Year: 2000
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.962
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • ftp://markov.utstat.toronto.ed... (external link)
  • http://www.cs.utoronto.ca/DCS/... (external link)
  • http://www.maths.lancs.ac.uk/d... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.