Translator Disclaimer
2006 Bookmark-coloring algorithm for personalized PageRank computing
Pavel Berkhin
Internet Math. 3(1): 41-62 (2006).

Abstract

We introduce a novel bookmark-coloring algorithm (BCA) that computes authority weights over the web pages utilizing the web hyperlink structure. The computed vector (BCV) is similar to the PageRank vector defined for a page-specific teleportation. Meanwhile, BCA is very fast, and BCV is sparse. BCA also has important algebraic properties. If several BCVs corresponding to a set of pages (called hub) are known, they can be leveraged in computing arbitrary BCV via a straightforward algebraic process and hub BCVs can be efficiently computed and encoded.

Citation

Download Citation

Pavel Berkhin. "Bookmark-coloring algorithm for personalized PageRank computing." Internet Math. 3 (1) 41 - 62, 2006.

Information

Published: 2006
First available in Project Euclid: 30 March 2007

zbMATH: 1113.68375
MathSciNet: MR2283883

Subjects:
Primary: 68U35
Secondary: 68M10, 68R10

Rights: Copyright © 2006 A K Peters, Ltd.

JOURNAL ARTICLE
22 PAGES


SHARE
Vol.3 • No. 1 • 2006
Back to Top