On Local Estimations Of Pagerank: A Mean Field Approach

INTERNET MATHEMATICS(2007)

引用 31|浏览12
暂无评分
摘要
PageRank is a key element in the success of search engines, allowing the display of the most relevant hits in the first screen of results. One key aspect that distinguishes PageRank from other prestige measures such as in-degree is its global nature. From the information provider perspective, this makes it difficult or even impossible to predict how their pages will be ranked. Consequently, a market has emerged for the optimization of search engine results. Here we study the accuracy with which PageRank can be approximated by in-degree, a local measure made freely available by search engines. Theoretical and empirical analyses lead us to conclude that, given the weak degree of correlations in the Web link graph, the approximation can be relatively accurate, giving service and information providers an effective new marketing tool.
更多
查看译文
关键词
mean field,search engine
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要