Sponsored Links
Directory Sites
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.
www8.org
A poster paper by Stanford db group which describes iterative methods for calculating PageRank. [PDF format]
www2002.org
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]
www.cs.ualberta.ca
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]www.cs.cornell.edu
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.
www.almaden.ibm.com
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]
www.cs.technion.ac.il
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]
www.cs.washington.edu
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.
www2002.org
Link Analysis, Eigenvectors, and Stability
Do Hits and PageRank (and some variations) give stable rankings under small perturbations to the linkage patterns? [PS format]
www.cs.berkeley.edu
Improvement to Clever Algorithm
A Kleimberg's algorithm improvement. [PDF format]
www2002.org
PageRank: A Circuital Analysis
It shows some theoretical results for understanding the distribution of the score in the Web according to PageRank. Seven golden rules for building good pages are presented. [PDF format]
www2002.org
Improvement of HITS-based Algorithms on Web Documents
It proposes a new weighted HITS-based method that assigns appropriate weights to in-links of root documents and combines content analysis with HITS-based algorithms.
www2002.org
Probabilistic Combination of Content and Links
It introduces a probabilistic model that integrates link topology (used to identify important pages), anchor text (used to augment the text of cited pages), and activation (spread to linked pages). Experiments are on MSN Directory. [PDF format]
research.microsoft.com
The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity
This paper describes a joint probabilistic model for modeling the contents and inter-connectivity of document collections such as sets of web pages or research paper archives. [PDF format]
www.cs.cmu.edu
About the using of PageRank in Web Track 8 "large" and "small" datasets. [PDF format]
trec.nist.gov