Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1080/15427951.2007.10129294 | INTERNET MATHEMATICS |
Keywords | Field | DocType |
mean field,search engine | PageRank,Data mining,Graph,Search engine,Information retrieval,Ranking,Computer science,Information providers,Mean field theory,Link farm | Journal |
Volume | Issue | ISSN |
4 | 2-3 | 1542-7951 |
Citations | PageRank | References |
9 | 0.56 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Santo Fortunato | 1 | 4209 | 212.38 |
| Marián Boguñá | 2 | 543 | 35.14 |
| Alessandro Flammini | 3 | 1705 | 94.69 |
| Filippo Menczer | 4 | 3874 | 268.67 |