What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding 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 reputation using simple random walk models of Web-browsing behavior. We give preliminary test results on the effectiveness of these algorithms.
searching random walks reputation ranking pagerank hubs and authorities