Finding authorities and hubs from link structures on the World Wide Web
Published 1 April 2001
Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, Panayiotis Tsaparas
Citations228
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A comparative study of hypertext link analysis algorithms is undertaken, guided by some experimental queries, and some formal criteria for evaluating and comparing linkAnalysis algorithms are proposed.
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
Computer SciencePhysics and Astronomy
Journal of the Royal Statistical Society Series B (Statistical Methodology)Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
49,657 Citations1977A. P. Dempster, N. M. Laird +1 more
Computer Networks and ISDN SystemsThe anatomy of a large-scale hypertextual Web search engine
15,828 Citations1998Sergey Brin, Lawrence M. Page
This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
Journal of the ACMAuthoritative sources in a hyperlinked environment
9,060 Citations1999Jon Kleinberg
This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure, and has connections to the eigenvectors of certain matrices associated with the link graph.
Markov Chain Monte Carlo in Practice
7,730 Citations1995Walter R. Gilks, Sylvia Richardson +1 more
Cambridge University Press eBooksRandomized Algorithms
4,069 Citations1995Rajeev Motwani, Prabhakar Raghavan
The Annals of StatisticsMarkov Chains for Exploring Posterior Distributions
3,472 Citations1994Luke Tierney
This paper outlines some of the basic methods and strategies of Markov chain methods and discusses some related theoretical and practical issues.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Bayesian Computation Via the Gibbs Sampler and Related Markov Chain Monte Carlo Methods
1,727 Citations1993A. F. M. Smith, Gareth O. Roberts
The use of the Gibbs sampler for Bayesian computation and other Markov chain Monte Carlo simulation methods are reviewed and illustrated in the context of some canonical examples.
Computer NetworksThe stochastic approach for link-structure analysis (SALSA) and the TKC effect
480 Citations2000Ronny Lempel, Shlomo Moran
SALSA, a new stochastic approach for link structure analysis, which examines random walks on graphs derived from the link structure, is presented and it is proved that SALSA is equivalent to a weighted in-degree analysis of the link-structure of World Wide Web subgraphs, making it computationally more efficient than the mutual reinforcement approach.
Learning to Probabilistically Identify Authoritative Documents
252 Citations2000David Cohn, Huan Chang
A model of document citation that learns to identify hubs and authorities in a set of linked documents, such as pages retrieved from the world wide web, or papers retrieved from a research paper archive, provides probabilistic estimates that have clear semantics.
Canadian Journal of StatisticsMarkov‐chain monte carlo: Some practical implications of theoretical results
142 Citations1998Gareth O. Roberts, Jeffrey S. Rosenthal
This work reviews and discusses some recent progress in the theory of Markov-chain Monte Carlo applications and attempts to assess the relevance of this theory for practical applications.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Convergence of Slice Sampler Markov Chains
136 Citations1999Gareth O. Roberts, Jeffrey S. Rosenthal
Computer NetworksWhat is this page known for? Computing Web page reputations
125 Citations2000Davood Rafiei, Alberto O. Mendelzon
A search process where the input is the URL of a page, and the output is a ranked set of topics on which the page has a reputation, and several algorithmic formulations of the notion of reputation are proposed.