메뉴 건너뛰기




Volumn 7730 LNCS, Issue , 2013, Pages 11-26

Fast distributed PageRank computation

Author keywords

Distributed algorithm; Monte Carlo method; PageRank; Random walk

Indexed keywords


EID: 84891094931     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-35668-1_2     Document Type: Conference Paper
Times cited : (60)

References (21)
  • 1
    • 38749085661 scopus 로고    scopus 로고
    • Local graph partitioning using pagerank vectors
    • Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475-486 (2006)
    • (2006) FOCS , pp. 475-486
    • Andersen, R.1    Chung, F.2    Lang, K.3
  • 2
    • 38149027373 scopus 로고    scopus 로고
    • Monte carlo methods in pagerank computation: When one iteration is sufficient
    • Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte carlo methods in pagerank computation: When one iteration is sufficient. SIAM J. Number. Anal. 45(2), 890-904 (2007)
    • (2007) SIAM J. Number. Anal. , vol.45 , Issue.2 , pp. 890-904
    • Avrachenkov, K.1    Litvak, N.2    Nemirovsky, D.3    Osipova, N.4
  • 4
    • 79960170113 scopus 로고    scopus 로고
    • Fast incremental and personalized pagerank
    • Bahmani, B., Chowdhury, A., Goel, A.: Fast incremental and personalized pagerank. PVLDB 4, 173-184 (2010)
    • (2010) PVLDB , vol.4 , pp. 173-184
    • Bahmani, B.1    Chowdhury, A.2    Goel, A.3
  • 5
    • 77954235092 scopus 로고    scopus 로고
    • A survey on pagerank computing
    • Berkhin, P.: A survey on pagerank computing. Internet Mathematics 2(1), 73-120 (2005)
    • (2005) Internet Mathematics , vol.2 , Issue.1 , pp. 73-120
    • Berkhin, P.1
  • 9
    • 77956236321 scopus 로고    scopus 로고
    • Efficient distributed random walks with applications
    • Das Sarma, A., Nanongkai, D., Pandurangan, G., Tetali, P.: Efficient distributed random walks with applications. In: PODC, pp. 201-210 (2010)
    • (2010) PODC , pp. 201-210
    • Das Sarma, A.1    Nanongkai, D.2    Pandurangan, G.3    Tetali, P.4
  • 10
    • 84896713135 scopus 로고    scopus 로고
    • A note on the pagerank of undirected graphs
    • abs/1205.1960
    • Grolmusz, V.: A note on the pagerank of undirected graphs. CoRR, abs/1205.1960 (2012)
    • (2012) CoRR
    • Grolmusz, V.1
  • 11
    • 79551609075 scopus 로고    scopus 로고
    • When the web meets the cell: Using personalized pagerank for analyzing protein interaction networks
    • Iván, G., Grolmusz, V.: When the web meets the cell: using personalized pagerank for analyzing protein interaction networks. Bioinformatics 27(3), 405-407 (2011)
    • (2011) Bioinformatics , vol.27 , Issue.3 , pp. 405-407
    • Iván, G.1    Grolmusz, V.2
  • 12
  • 17
    • 51849131477 scopus 로고    scopus 로고
    • Spectral centrality measures in complex networks
    • Perra, N., Fortunato, S.: Spectral centrality measures in complex networks. Phys. Rev. E 78, 36107 (2008)
    • (2008) Phys. Rev. E , vol.78 , pp. 36107
    • Perra, N.1    Fortunato, S.2
  • 19
    • 57349088162 scopus 로고    scopus 로고
    • Estimating pagerank on graph streams
    • ACM
    • Sarma, A.D., Gollapudi, S., Panigrahy, R.: Estimating pagerank on graph streams. In: PODS, pp. 69-78. ACM (2008)
    • (2008) PODS , pp. 69-78
    • Sarma, A.D.1    Gollapudi, S.2    Panigrahy, R.3
  • 21
    • 38049161888 scopus 로고    scopus 로고
    • Keyword Extraction Based on PageRank
    • Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. Springer, Heidelberg
    • Wang, J., Liu, J., Wang, C.: Keyword Extraction Based on PageRank. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 857-864. Springer, Heidelberg (2007)
    • (2007) LNCS (LNAI) , vol.4426 , pp. 857-864
    • Wang, J.1    Liu, J.2    Wang, C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.