- Adaptive On-Line Page Importance Computation
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.
http://www2003.org/cdrom/papers/refereed/p007/p7-abiteboul.html
(Added: Fri Mar 31 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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]
http://www.cs.cornell.edu/home/kleinber/auth.pdf
(Added: Mon Apr 03 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- DiscoWeb: Discovering Web Communities Via Link Analysis
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.
http://www.cs.rutgers.edu/~davison/discoweb/
(Added: Mon Apr 03 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- Efficient Computation of PageRank
By Haveliwala, T.
http://www.stanford.edu/~taherh/papers/efficient-pr.pdf
(Added: Fri Mar 31 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- Exploiting the Block Structure of the Web for Computing PageRank
A hierarchical approach for computing PageRank. The local PageRanks of page for each host are computed independently and then used to compute the global PageRank of Web Graph.
http://www.stanford.edu/~taherh/papers/blockrank.pdf
(Added: Mon Apr 03 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- Extrapolation Methods for Accelerating PageRank Computations
This paper by Sepandar Kamvar, Taher Haveliwala, Chris Manning, and Gene Golub, published in WWW13, presents an algorithm to speed up the computation of PageRank by making some initial approximations.
http://www.stanford.edu/~sdkamvar/papers/extrapolation.pdf
(Added: Sat Apr 01 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- Finding Authorities and Hubs From Link Structures on the World Wide Web
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.
http://www10.org/cdrom/papers/314/
(Added: Thu Apr 06 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- Improved Algorithms for Topic Distillation in Hyperlinked Environments
Given a typical user query to find quality documents related to the query topic. It uses an Hits variation.
http://gatekeeper.dec.com/pub/DEC/SRC/publications/monika/sigir98.pdf
(Added: Thu Apr 06 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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.
http://www2002.org/CDROM/refereed/643/
(Added: Wed Apr 05 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- Improvement to Clever Algorithm
A Kleimberg's algorithm improvement. [PDF format]
http://www2002.org/CDROM/poster/171.pdf
(Added: Mon Apr 03 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- Larry Page Describes PageRank
Postscript-format slides which introduces citation importance ranking by Larry Page, Google's founder.
http://www-db.stanford.edu/~backrub/pageranksub.ps
(Added: Thu Apr 06 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- Link Analysis, Eigenvectors, and Stability
Do Hits and PageRank (and some variations) give stable rankings under small perturbations to the linkage patterns? [PS format]
http://www.cs.berkeley.edu/~alicez/ijcai01-linkanalysis.ps
(Added: Thu Apr 06 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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.
http://www8.org/w8-papers/2c-search-discover/measuring/measuring.html
(Added: Mon Apr 03 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- PageRank Calculation with Lossy Encoding
Lossy encoding for large scale PageRank calculation.
http://www-db.stanford.edu/~taherh/papers/encoding-pagerank.pdf
(Added: Fri Mar 31 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- PageRank Computation Methods
A poster paper by Stanford db group which describes iterative methods for calculating PageRank. [PDF format]
http://www2002.org/CDROM/poster/173.pdf
(Added: Mon Apr 03 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- PageRank U.S. Patent 6,285,999
Lawrence Page's PageRank Patent.
http://patft.uspto.gov/netacgi/nph-Parser?patentnumber=6285999
(Added: Mon Apr 03 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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]
http://www2002.org/CDROM/poster/165.pdf
(Added: Fri Mar 31 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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]
http://research.microsoft.com/copyright/accept.asp?path=http://research.microsoft.com/~sdumais/SIGIR2001-LinksRevisedSubmitted.pdf&pub=ACM
(Added: Wed Apr 05 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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]
http://www.cs.technion.ac.il/~moran/r/PS/lm-feb01.ps
(Added: Thu Mar 30 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- Survey on Google's PageRank
Information on the algorithm, how to increase PageRank, what diminishes it and how to distribute PageRank within a website.
http://pr.efactory.de/
(Added: Wed Apr 05 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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.
http://www.almaden.ibm.com/cs/k53/clever.html
(Added: Fri Mar 31 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- The EigenTrust Algorithm for Reputation Management in P2P Networks
An eingenvalues algorithm for calculating reputation in P2P networks and isolating malicious peers. There is a relationship with PageRank algorithm.
http://www.stanford.edu/~sdkamvar/papers/eigentrust.pdf
(Added: Wed Apr 05 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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]
http://www.cs.washington.edu/homes/pedrod/papers/nips01b.pdf
(Added: Wed Apr 05 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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]
http://www.cs.cmu.edu/~cohn/papers/nips00.pdf
(Added: Wed Apr 05 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
- The PageRank Citation Ranking: Bringing Order to the Web
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.
http://dbpubs.stanford.edu:8090/pub/1999-66
(Added: Fri Mar 31 2006 Rating: 0.00 Votes: 0)
Rate It
Review It
