Search results
We compare PageRank to an idealized random Websurfer. We show how to efficiently compute PageRank for large numbers of pages. And we show how to apply PageRank to search and to user navigation.
When searching on Google, Google outputs a list of websites. The websites at the top of the page are accessed more frequently than websites near the bottom. This idea of ordering websites is called Google PageRank. The orderering is based on the likelihood of visiting each website.
Let's examine a very basic internet, see how it connects to Markov Chains, and how the Google Pagerank method works. Example 7.1. Suppose the internet consists of only four pages, P1, P2, P3, P4, linked as follows, where, for example, an arrow from P1 to P3 indicates a link from P1 to P3.
2 Chapter 7. Google PageRank Let ri and cj be the row and column sums of G: ri = ∑ j gij; cj = ∑ i gij: The quantities rj and cj are the in-degree and out-degree of the jth page.Let p be the probability that the random walk follows a link. A typical value is p = 0:85. Then 1−p is the probability that some arbitrary page is chosen and = (1−p)=n is the probability that a particular ...
[0.5cm] The PageRank Algorithm. “In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems.
Modern search engines employ methods of ranking the results to provide the "best" results first that are more elaborate than just plain text ranking. One of the most known and influential algorithms for computing the relevance of web pages is the Page Rank algorithm used by the Google search engine.
Google’s success at performing this second step has played a major role in making it the world’s favourite search engine. The program that produces the list of relevant web pages, based on your query, is called the query module. The list is passed to the ranking module.
