Home >> Computers >> Software >> Information Retrieval >> Ranking >> By Context PageRank as a Random Walk A general framework for measuring the quality of an index and providing the background on the PageRank and Random Walks. Imagine a Web surfer who wanders the Web. At each step, he/she either jumps to a page on the Web chosen uniformly at random, or follows a link chosen from those on the current page. PageRank Computation Methods A poster paper by Stanford db group which describes iterative methods for calculating PageRank. [PDF format] What is this Page Known for? Computing Web Page Reputations, PageRank and Hub and Authority generalization based on the topic of Web Pages. Definition of a model where a surfer can move forward (following an out-going link) and backward (following an in-going link in the inverse direction). [PS format] PageRank Used to Characterize Web Structure PageRank's values on the Web follow a power law. An high in-degree of a node does not imply high PageRank, and vice versa. [PDF format] Authoritative Sources in a Hyperlinked Environment HITs is a link-structure analysis algorithm which ranks pages by "authorities" (pages which have many incoming links and provide the best source of information on a given topic) and "hubs" (pages which have many outgoing links and provide useful lists of possibly relevant pages). Ranking is performed at query time. [PDF format] The Clever Project The CLEVER search engine incorporates several algorithms that make use of hyperlink structure for discovering information on the Web. It is an extension of Hits method. SALSA: The Stochastic Approach for Link-Structure Analysis A focused search algorithm (SALSA) based on Markov chains. It starts with a query on a broad topic, discards useless links, and then weights the remaining terms. A stochastic crawl is used to discover the authorities on this topic. [PS format] The Intelligent Surfer: Probabilistic Combination of Link and Content Information in PageRank This method uses query dependent importance scores and a probabilistic approach to improve upon PageRank. It pre-computes importance scores offline for every possible text query. [PDF format] Web Page Scoring Systems for Horizontal and Vertical Search "Random Surfer" model extension. At each step of traversal of the Web graph, the surfer can jump to a random node or follow a hyperlink or follow a back-link (a hyperlink in the inverse direction) or stay in the same node. Link Analysis, Eigenvectors, and Stability Do Hits and PageRank (and some variations) give stable rankings under small perturbations to the linkage patterns? [PS format]
© 2005 GeneralAnswers.org