Efficient pageRank approximation via graph aggregation

Thirteenth International World Wide Web Conference Proceedings, WWW2004

Volumn , Issue , 2004, Pages 1216-1217

  Broder, Andrei Z ^a   Maghoul, Farzin ^b   Lempel, Ronny ^c   Pedersen, Jan ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b YAHOO INC   (United States)

^c IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

Link analysis; Search engines; Web information retrieval

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA REDUCTION; DATA STORAGE EQUIPMENT; GRAPH THEORY; INFORMATION RETRIEVAL; OPTIMIZATION; RANDOM PROCESSES; SEARCH ENGINES; VECTORS;

BLOCKRANK; LINK ANALYSIS; PAGERANK COMPUTATIONS; WEB INFORMATION RETRIEVAL;

WEBSITES;

EID: 19944372089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proc. 7th International WWW Conference, pages 107-117, 1998.
2. T. H. Haveliwala. Efficient computation of pagerank. Technical Report Technical Report, Stanford University, October 1999.
3. T. H. Haveliwala. Topic-sensitive pagerank. In Proc. 11th International WWW Conference (WWW2002), 2002.
4. G. Jeh and J. Widom. Scaling personalized web search. In Proc. 12th International WWW Conference (WWW2003), Budapest, Hungary, 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 computating pagerank. Technical Report Technical Report, Stanford University, March 2003.