On the feasibility of low-rank approximation for personalized PageRank

14th International World Wide Web Conference, WWW2005

Volumn , Issue , 2005, Pages 972-973

  Benczúr, András A ^a   Csalogány, Károly ^a   Sarlós, Tamás ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Link analysis; Low rank approximation; Personalized PageRank; Singular value decomposition; Web information retrieval

Indexed keywords

LINK ANALYSIS; LOW RANK APPROXIMATIONS; PAGERANK; PERSONALIZED PAGERANK; WEB INFORMATION RETRIEVAL;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; INFORMATION RETRIEVAL; WORLD WIDE WEB;

SINGULAR VALUE DECOMPOSITION;

EID: 35349008622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1062745.1062824     Document Type: Conference Paper

References (7)

1. P. Drineas, M. W. Mahoney, and R. Kannan. Fast monte carlo algorithms for matrices II. Technical Report YALEU/DCS/TR-1270, Yale University, 2004.
2. D. Fogaras and B. Rácz. Towards scaling fully personalized pagerank. In WAW, pages 105-117, 2004.
3. H. Guo. IRR: An algorithm for computing the smallest singular value of large-scale matrices. International J. of Computer Math., 77(1):89-104, 2001.
4. T. H. Haveliwala. Topic-sensitive PageRank. In Proceedings of the 11th World Wide Web Conference (WWW), Honolulu, Hawaii, 2002.
5. G. Jeh and J. Widom. Scaling personalized web search. In Proceedings of the 12th World Wide Web Conference (WWW), pages 271-279. ACM Press, 2003.
6. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
7. P. K. C. Singitham, M. S. Mahabhashyam, and P. Raghavan. Efficiency-quality tradeoffs for vector score aggregation. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), 2004.