How does pageranking algorithm deal with webpage without outbound links?

[亡魂溺海] 提交于 2019-12-05 08:27:45

As page-rank is described in the original article, and in the wikipedia article, it is indeed not defined when out-degree(v)=0 for some v, since you get P(v,u)=d/n+(1-d)*0/0 - which is undefined

A node that has no outgoing edge is called a dangling node and there are basically 3 common ways to take care of them:

  1. Eliminate such nodes from the graph (and repeat the process iteratively until there are no dangling nodes.
  2. Consider those pages to link back to the pages that linked to them (i.e. - for each edge (u,v), if out-degree(v) = 0, regard (v,u) as an edge).
  3. Link the dangling node to all pages (including itself usually), and effectively make the probability for random jump from this node 1.

About a page with no incoming node - that shouldn't be an issue because everything is perfectly defined. Such a node will have a page rank of exactly d/n - because you can only get to it by random surfing from any node - and that's the probability to be in it.

Hope that answered your question!

The PageRank algorithm ranks a page based on the incoming links to that page. The outbound links from that page help determine the PageRank of the other pages to which it links. This process is iterated repeatedly to determine PageRank.

In each iteration, value is added to page A's PageRank if there are incoming links from other pages. The value added to page A is the PageRank of page B, which contains the incoming link to page A, divided by the total number of outgoing links on page B.

Therefore, having no outbound links will not affect the PageRank of page A. The impact of having no outbound links is only that page A will not add value to the PageRank of any other pages. By contrast, if there are no incoming links to page B, it will have the baseline (very low) PageRank, because it never gets added value from incoming links.

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!