Fast algorithms for top-k personalized pageRank queries

Proceeding of the 17th International Conference on World Wide Web 2008, WWW'08

Volumn , Issue , 2008, Pages 1225-1226

  Gupta, Manish ^a   Pathak, Amit ^a   Chakrabarti, Soumen ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

HubRank; Node deletion; Pagerank; Personalized; Top k

Indexed keywords

FAST ALGORITHMS; HUBRANK; NODE-DELETION; PAGERANK; PERSONALIZED; RANDOM SURFER MODELS; RANKING TECHNIQUES; SPEED-UP; STATE PROBABILITIES; TEXT INDICES;

CRYPTOGRAPHY; DIGITAL SIGNAL PROCESSING; ELECTRIC RESISTANCE; INTERNET; PUBLIC KEY CRYPTOGRAPHY;

WORLD WIDE WEB;

EID: 57349109369     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1367497.1367738     Document Type: Conference Paper

References (5)

1. P. Berkhin. Bookmark-coloring approach to personalized pagerank computing. Internet Mathematics, 3(1):41-62, Jan, 2007.
2. A. Z. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. L. Wiener. Graph structure in the web. Computer Networks. 33(l-6):309-320, 2000.
3. S. Chakrabarti. Dynamic personalized PageRank in entity-relation graphs. In www, Banff, May 2007.
4. G. Jeh and J. Widom. Scaling personalized web search. In WWW Conference, pages 271-279, 2003.
5. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub. Exploiting the block structure of the web for computing, Mar. 12 2003.