PageRank Algorithm

From GM-RKB
Jump to: navigation, search

A PageRank Algorithm is a Directed Graph Node Ranking Algorithm that efficiently calculates a directed graph node's PageRank Value (random arrival likelihood score).



References

2015

  • (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/PageRank#Algorithm Retrieved:2015-3-12.
    • The PageRank algorithm outputs a probability distribution used to represent the likelihood that a person randomly clicking on links will arrive at any particular page. PageRank can be calculated for collections of documents of any size. It is assumed in several research papers that the distribution is evenly divided among all documents in the collection at the beginning of the computational process. The PageRank computations require several passes, called "iterations", through the collection to adjust approximate PageRank values to more closely reflect the theoretical true value.

      A probability is expressed as a numeric value between 0 and 1. A 0.5 probability is commonly expressed as a "50% chance" of something happening. Hence, a PageRank of 0.5 means there is a 50% chance that a person clicking on a random link will be directed to the document with the 0.5 PageRank.

2012

2011

2009

2006

  • (Langville & Meyer, 2006) ⇒ Amy N. Langville, and Carl Dean Meyer. (2006). “Page Rank and Beyond." Princeton University Press. ISBN:0691122024

2005

2002

2001

1998