PageRank Computation Methods
www2002.org
A poster paper by Stanford db group which describes iterative methods for calculating PageRank. [PDF]
Extrapolation Methods for Accelerating PageRank Computations
stanford.edu
A paper about the computation of PageRank using the standard Power Method and the new Quadratic Extrapolation which computes the principal eigenvector of the Markov matrix representing the Web link graph with an increased speed up of about 50-300%. [PDF] (May, 2003)
Larry Page Describes PageRank
www-db.stanford.edu
Postscript-format slides which introduces citation importance ranking by Larry Page, Google's founder.- PageRank: A Circuital Analysis
www2002.org
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] 
Survey on Google's PageRank
pr.efactory.de
Information on the algorithm, how to increase PageRank, what diminishes it and how to distribute PageRank within a website.- The EigenTrust Algorithm for Reputation Management in P2P Networks
stanford.edu
An eingenvalues algorithm for calculating reputation in P2P networks and isolating malicious peers. There is a relationship with PageRank algorithm. [PDF] 
The PageRank Citation Ranking: Bringing Order to the Web
ilpubs.stanford.edu
First Stanford paper about PageRank. It is a static ranking, performed at indexing time, which interprets a link from page A to page B as a vote, by page A, for page B. Web is seen as a direct graph and votes recursively propagate from nodes to nodes. Ranking is performed at indexing time. Used by Google.
The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity
cs.cmu.edu
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]
What is this Page Known for? Computing Web Page Reputations,
cs.ualberta.ca
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]
Authoritative Sources in a Hyperlinked Environment
cs.cornell.edu
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]- Topic -Sensitive Page Rank
www2002.org
Integrates ODP data in PageRank calculation for performing query time probabilistic ranking. 
Adaptive On-Line Page Importance Computation
www2003.org
A good explanation about the convergence of various algorithms. This paper also describes an adaptive and on-line algorithm for computing the page importance. It can be used for focus crawling as well as for search engine's ranking.
DiscoWeb: Discovering Web Communities Via Link Analysis
research.rutgers.edu
This paper describes a prototype system, later known as the Teoma Search Engine. It performs a Link Analysis, loosely based on the Kleimberg method, and computed at query time.
Web-Trec 8 and PageRank
trec.nist.gov
About the using of PageRank in Web Track 8 "large" and "small" datasets. [PDF]- A Significant Improvement to Clever Algorithm in Hyperlinked Environment
www2002.org
Paper by Minhua Wang describing an improvement to Kleimberg's algorithm. [PDF] - Improvement of HITS-based Algorithms on Web Documents
www2002.org
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. 
Finding Authorities and Hubs From Link Structures on the World Wide Web
www10.org
A survey on PageRank, Hits and SALSA. It also describes two Bayesian statistical algorithms for ranking of hyperlinked documents and the concepts of monotonicity and locality, as well as various concepts of distance and similarity between ranking algorithms.
The World’s Largest Matrix Computation
mathworks.com
"Google's PageRank is an eigenvector of a matrix of order 2.7 billion"
SALSA: The Stochastic Approach for Link-Structure Analysis
cs.technion.ac.il
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]- PageRank Calculation with Lossy Encoding
www-db.stanford.edu
Lossy encoding for large scale PageRank calculation. [PDF]
|
[Hide]▼
news.google.com
San Francisco Chronicle
One, each of the anecdotes being used against him looks dramatically different in context . Two, the "case" against Chen does not include a shred of evidence ...
and more »
[Hide]▲
