What is this page known for? Computing Web page reputations

The textual content of the Web enriched with the hyperlink structure surrou nding it can be a useful source of information for querying and searching. This paper presents 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 . For example, if the input is www.gamelan.com, then a possible output is ' Java'. We propose several algorithmic formulations of the notion of reputat ion using simple random walk models of Web-browsing behavior. We give preli minary test results on the effectiveness of these algorithms. (C) 2000 Publ ished by Elsevier Science B.V. All rights reserved.