Bookmark-Coloring Algorithm for Personalized PageRank Computing

被引：85

作者：

Berkhin, Pavel ^{[1
]}

机构：

[1] Yahoo, 701 First Ave, Sunnyvale, CA 94089 USA

来源：

INTERNET MATHEMATICS | 2006年 / 3卷 / 01期

关键词：

D O I：

10.1080/15427951.2006.10129116

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：41 / 62

页数：22

共 17 条

[1]

Abiteboul S., 2003, P 12 INT C WORLD WID, P280

[2]

Arasu A., 2002, 11 INT WORLD WID WEB

[3]

AXELSSON O, 1994, ITERATIVE SOLUTION M

[4] The anatomy of a large-scale hypertextual Web search engine [J].

Brin, S ;

Page, L .

COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117

[5]

CHAKRABARTI S, 1998, P 7 INT C WORLD WID

[6]

EIRON N., 2004, P 13 INT C WORLD WID, P309, DOI DOI 10.1145/988672.988714

[7]

Gibson D., 1998, Hypertext 98: Ninth ACM Conference on Hypertext and Hypermedia, P225, DOI 10.1145/276627.276652

[8]

Golub Gene H., 2013, MATRIX COMPUTATIONS, V3

[9]

Haveliwala T., 2003, COMPUTING PAGERANK U

[10]

Haveliwala TH, 2002, P 11 INT C WORLD WID, P517, DOI [DOI 10.1145/511446.511513, 10.1145/511446.511513]

← 1 2 →