Efficient page rank approximation via graph aggregation

Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004

Volumn , Issue , 2004, Pages 484-485

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

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

^b IBM HAIFA RESEARCH LAB   (Israel)

^c YAHOO INC   (United States)

Author keywords

Link analysis; Search engines; Web information retrieval

Indexed keywords

EQUIVALENCE CLASSES; RANDOM PROCESSES; SEARCH ENGINES; WEBSITES; WORLD WIDE WEB;

CLASS-BASED; LINK ANALYSIS; OPTIMIZED IMPLEMENTATION; RANDOM WALK; RUNNING TIME; SPEARMAN RANK; SPEED-UP FACTORS; WEB INFORMATION RETRIEVAL;

PROBABILITY DISTRIBUTIONS;

EID: 70350635329     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1013367.1013537     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.