Crawling & Indexing ToolsKeyword Research ToolOn-Page Optimization Tools
Competitor Analysis ToolsEmail Marketing Tools
Hope the above list of tools will be helpful to all my freinds in the SEO industry. Cheers |
Thursday, September 22, 2011
List of helpful SEO-SEM Tools
List of helpful SEO-SEM Tools
Thursday, September 8, 2011
Page Rank Algorithm
Google PageRank Algorithm
The most popular way for PageRank algorithm to rank websites. Algorithm developed and Sergey Brin and Larry Page of the 90s were published by Stanford University at the end. PageRank can be understood as a website's importance. Ranking algorithm is a function of factors on and off the page. - On page factors title, description, headings and plain text are, for example. PageRank and anchor text from off-page factors (incoming links) is. Neither the content nor the URL (such as off-page criteria, called factors) plays a role. In addition, there is no difference between internal and external links.
The citation (link) graph of the web is an important resource that has largely gone unused in existing web search engines. Google created maps containing as many as 518 million of these hyperlinks, a significant sample of the total. These maps allow rapid calculation of a web page's "PageRank", an objective measure of its citation importance that corresponds well with people's subjective idea of importance. Because of this correspondence, PageRank is an excellent way to prioritize the results of web keyword searches. For most popular subjects, a simple text matching search that is restricted to web page titles performs admirably when PageRank prioritizes the results (demo available at google.stanford.edu).
Assume page A has pages T1...Tn which point to it (i.e., are citations). The parameter d is a damping factor which can be set between 0 and 1. We usually set d to 0.85. There are more details about d in the next section. Also C(A) is defined as the number of links going out of page A. The PageRank of a page A is given as follows:
PR(A) = (1-d) + d (PR(T1)/C(T1) + ... + PR(Tn)/C(Tn))
Note that the PageRanks form a probability distribution over web pages, so the sum of all web pages' PageRanks will be one.
PageRank or PR(A) can be calculated using a simple iterative algorithm, and corresponds to the principal eigenvector of the normalized link matrix of the web.
f the PageRank value differences between PR1, PR2,.....PR10 were equal then that conclusion would hold up, but many people believe that the values between PR1 and PR10 (the maximum) are set on a logarithmic scale, and there is very good reason for believing it. Nobody outside Google knows for sure one way or the other, but the chances are high that the scale is logarithmic, or similar. If so, it means that it takes a lot more additional PageRank for a page to move up to the next PageRank level that it did to move up from the previous PageRank level. The result is that it reverses the previous conclusion, so that a link from a PR8 page that has lots of outbound links is worth more than a link from a PR4 page that has only a few outbound links.
The most popular way for PageRank algorithm to rank websites. Algorithm developed and Sergey Brin and Larry Page of the 90s were published by Stanford University at the end. PageRank can be understood as a website's importance. Ranking algorithm is a function of factors on and off the page. - On page factors title, description, headings and plain text are, for example. PageRank and anchor text from off-page factors (incoming links) is. Neither the content nor the URL (such as off-page criteria, called factors) plays a role. In addition, there is no difference between internal and external links.
The citation (link) graph of the web is an important resource that has largely gone unused in existing web search engines. Google created maps containing as many as 518 million of these hyperlinks, a significant sample of the total. These maps allow rapid calculation of a web page's "PageRank", an objective measure of its citation importance that corresponds well with people's subjective idea of importance. Because of this correspondence, PageRank is an excellent way to prioritize the results of web keyword searches. For most popular subjects, a simple text matching search that is restricted to web page titles performs admirably when PageRank prioritizes the results (demo available at google.stanford.edu).
PR(A) = (1-d) + d (PR(T1)/C(T1) + ... + PR(Tn)/C(Tn))
Note that the PageRanks form a probability distribution over web pages, so the sum of all web pages' PageRanks will be one.
PageRank or PR(A) can be calculated using a simple iterative algorithm, and corresponds to the principal eigenvector of the normalized link matrix of the web.
f the PageRank value differences between PR1, PR2,.....PR10 were equal then that conclusion would hold up, but many people believe that the values between PR1 and PR10 (the maximum) are set on a logarithmic scale, and there is very good reason for believing it. Nobody outside Google knows for sure one way or the other, but the chances are high that the scale is logarithmic, or similar. If so, it means that it takes a lot more additional PageRank for a page to move up to the next PageRank level that it did to move up from the previous PageRank level. The result is that it reverses the previous conclusion, so that a link from a PR8 page that has lots of outbound links is worth more than a link from a PR4 page that has only a few outbound links.
Subscribe to:
Posts (Atom)