LR-PPR: Locality-sensitive, re-use promoting, approximate personalized PageRank computation

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2013, Pages 1801-1806

  Kim, Jung Hyun ^a   Candan, K Selçuk ^a   Sapino, Maria Luisa ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

Locality sensitivity; Personalized PageRank; Reuse promotion

Indexed keywords

COMPUTATION COSTS; COMPUTATION PROCESS; COMPUTATIONAL COSTS; LOCAL NEIGHBORHOODS; LOCALITY SENSITIVES; LOCALITY-SENSITIVITY; PERSONALIZED PAGERANK; REUSE-PROMOTION;

ALGORITHMS; GRAPH THEORY; KNOWLEDGE MANAGEMENT;

COMPUTATIONAL EFFICIENCY;

EID: 84889595974     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505651     Document Type: Conference Paper

References (23)

1. K. Avrachenkov, N. Litvak, D. Nemirovsky, E. Smirnova, and M. Sokol. Quick Detection of Top-k Personalized PageRank Lists. WAW'11, 2011.
2. B. Bahmani, K. Chakrabarti, and D. Xin. Fast personalized PageRank on MapReduce. In SIGMOD'11. 973-984. 2011.
3. B. Bahmani, A. Chowdhury, and A. Goel. Fast incremental and personalized PageRank. PVLDB. 4, 3, 173-184, 2010.
4. A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-based keyword search in databases. VLDB, 2004.
5. S. Brin and L. Page. "The anatomy of a large-scale hypertextual Web search engine". Computer Networks and ISDN Systems 30: 107-117, 1998.
6. K. S. Candan and W.-S. Li. Using random walks for mining web document associations. In PAKDD, pp. 294-305, 2000.
7. K. S. Candan and W.-S. Li. Reasoning for Web document associations and its applications in site map construction. Data Knowl. Eng. 43(2), 2002.
8. K. Csalogany, D. Fogaras, B. Racz, and T. Sarlos. Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments Internet Math. 2, 3, 333-358, 2005.
9. F Fouss, A. Pirotte, J. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. TKDE, 2007.
10. Y. Fujiwara, M. Nakatsuji, M. Onizuka, and M. Kitsuregawa. Fast and exact top-k search for random walk with restart. PVLDB. 5, 5, 442-453. 2012.
11. M. Gupta, A. Pathak, and S. Chakrabarti. Fast algorithms for Top-k Personalized PageRank Queries. In WWW'08. 1225-1226. 2008.
12. T.H. Haveliwala. Topic-sensitive PageRank. WWW'02. 517-526. 2002.
13. G. Jeh and J. Widom. Scaling personalized web search. Stanford University Technical Report. 2002.
14. S.D. Kamvar, T.H. Haveliwala, C.D. Manning, and G.H. Golub. Extrapolation methods for accelerating PageRank computations. In WWW'03 261-270. 2003.
15. G. Malewicz, et al Pregel: a system for large-scale graph processing. SIGMOD'10, 2010.
16. Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time, CIKM'08, 2008.
17. C. Palmer, P. Gibbons, and C. Faloutsos. Anf: a fast and scalable tool for data mining in massive graphs. KDD'02, 2002.
18. W. Piegorsch and G. E. Casella. Inverting a sum of matrices. In SIAM Review, 1990.
19. P. Sarkar, A.W Moore, and A. Prakash. Fast incremental proximity search in large graphs. ICML'08, 2008.
20. H. H. Song, et al Scalable proximity estimation and link prediction in online social networks. In Internet Measurement Conference, pp. 322-335. 2009.
21. H. Tong, C. Faloutsos, and Y. Koren. Fast direction-aware proximity for graph mining. KDD, pp. 747-756, 2007.
22. H. Tong, C. Faloutsos, and J.-Y Pan. Fast Random Walk with Restart and Its Applications. In ICDM'06. 613-622. 2006.
23. Y Wu and L. Raschid, ApproxRank: Estimating Rank for a Subgraph, ICDE'09, 54-65, 2009.