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 behaviour. We give preliminary test results on the e ectiveness of these algorithms.

• Type: Journal
• Year: 2000
• Where: CN
• Authors: Davood Rafiei, Alberto O. Mendelzon
• Keywords: CN 2000, Hyperlink Structure, Simple Random Walk, Textual Content