On the feasibility of low-rank approximation for personalized PageRank

Authors:
Andrá/s A. Benczú/r;Ká/roly Csalogá/ny;Tamá/s Sarló/s
Affiliations:
Hungarian Academy of Sciences, Eö/tv&3246/s University, Budapest, Hungary;Hungarian Academy of Sciences, Eö/tv&3246/s University, Budapest, Hungary;Hungarian Academy of Sciences, Eö/tv&3246/s University, Budapest, Hungary
Venue:
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Year:
2005

Citing 3
Cited 1

Topic-sensitive PageRank

Proceedings of the 11th international conference on World Wide Web
Scaling personalized web search

WWW '03 Proceedings of the 12th international conference on World Wide Web
Efficiency-quality tradeoffs for vector score aggregation

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Supporting intelligent Web search

ACM Transactions on Internet Technology (TOIT)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized PageRank on the fly are either limited to a restricted choice of page selection or believed to behave well only on sparser regions of the Web. In this paper we show the feasibility of computing personalized PageRank by a k