如何使前十名:近似PageRank从程度
How to make the top ten: Approximating PageRank from in-degree
摘要:
PageRank已经成为搜索引擎成功的关键因素,它允许在结果的顶部屏幕中排名最重要的点击。将PageRank与其他声望衡量标准(如入度)区分开来的一个关键方面是它的全球性。从信息提供方的角度来看,这使得很难或不可能预测他们的页面将如何排名。因此,市场已经出现了优化的搜索引擎结果。在这里,我们研究的准确性,PageRank可以近似度,本地措施免费提供的搜索引擎。理论分析和实证分析表明,在Web链接图的弱度相关性下,这种近似可以相对准确,为服务和信息提供方提供了一种有效的新的营销工具。
英文摘要:
PageRank has become a key element in the success of search engines, allowing to rank the most important hits in the top 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 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 to conclude that given the weak degree correlations in the Web link graph, the approximation can be relatively accurate, giving service and information providers an effective new marketing tool.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。