On the feasibility of low-rank approximation for personalized PageRank

András A. Benczúr, Károly Csalogány, Tamás Sarlós · 2005

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

Read the paper · More papers on PaperTik