Name
Abstract | ||
|---|---|---|
Traditional link-based web ranking algorithms are applied to web snapshots in the form of webgraphs consisting of pages as vertices and links as edges. Constructing webgraph, researchers do not pay attention to a particular method of how links are taken into account, while certain details may significantly affects the contribution of link-based factors to ranking. Furthermore, researchers use small subgraphs of the webgraph for more efficient evaluation of new algorithms. They usually consider a graph induced by pages, for example, of a certain first level domain. In this paper we reveal a significant dependence of PageRank on the method of accounting redirects while constructing the webgraph. We evaluate several natural ways of redirect accounting on a large-scale domain and find an optimal case, which turns out non-trivial. Moreover, we experimentally compare different ways of extracting a small subgraph for multiple evaluations and reveal some essential shortcomings of traditional approaches. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-36973-5_55 | ECIR |
Keywords | Field | DocType |
link-based ranking method,url redirection accounting,level domain,particular method,large-scale domain,link-based factor,certain detail,constructing webgraph,small subgraph,redirect accounting,ranking algorithm,accounting redirects | Accounting,Data mining,Graph,PageRank,URL redirection,Accounting method,Information retrieval,Ranking,Webgraph,Vertex (geometry),Computer science,Snapshot (computer storage) | Conference |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maksim Zhukovskii | 1 | 2 | 4.51 |
| Gleb Gusev | 2 | 190 | 16.53 |
| Pavel Serdyukov | 3 | 1341 | 90.10 |