| dc.contributor.author |
Fogaras, D |
en |
| dc.contributor.author |
Rácz, B |
en |
| dc.contributor.author |
Csalogány, K |
en |
| dc.contributor.author |
Sarlós, T |
en |
| dc.date.accessioned |
2014-06-06T06:46:24Z |
|
| dc.date.available |
2014-06-06T06:46:24Z |
|
| dc.date.issued |
2005 |
en |
| dc.identifier.uri |
http://dx.doi.org/10.1080/15427951.2005.10129104 |
en |
| dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/2983 |
|
| dc.subject |
Error Probability |
en |
| dc.subject |
Web Pages |
en |
| dc.subject |
Lower Bound |
en |
| dc.subject |
Random Walk |
en |
| dc.title |
Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments |
en |
| heal.type |
journalArticle |
en |
| heal.identifier.primary |
10.1080/15427951.2005.10129104 |
en |
| heal.publicationDate |
2005 |
en |
| heal.abstract |
Personalized PageRank expresses link-based page quality around user- selected pages in a similar way as PageRank expresses quality over the entire web. Existing personalized PageRank algorithms can, however, serve online queries only for a restricted choice of pages. In this paper we achieve full personalization by a novel algorithm that precomputes a compact database; using this database, it can serve |
en |
| heal.journalName |
Internet Mathematics |
en |
| dc.identifier.doi |
10.1080/15427951.2005.10129104 |
en |