메뉴 건너뛰기




Volumn , Issue , 2012, Pages 24-32

PageRank on an evolving graph

Author keywords

dynamic graphs; pagerank; random walks

Indexed keywords

COMPUTATIONAL PARADIGM; DATA SETS; DYNAMIC GRAPH; EVOLVING GRAPHS; PAGERANK; PERFORMANCE GUARANTEES; RANDOM WALK; REAL DATA SETS; ROUND-ROBIN FASHIONS; SOCIAL NETWORKS; WEB GRAPHS;

EID: 84866013489     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339539     Document Type: Conference Paper
Times cited : (67)

References (30)
  • 1
    • 70449117853 scopus 로고    scopus 로고
    • Sort me if you can: How to sort dynamic data
    • A. Anagnostopoulos, R. Kumar, M. Mahdian, and E. Upfal. Sort me if you can: How to sort dynamic data. In ICALP, pages 339-350, 2009.
    • (2009) ICALP , pp. 339-350
    • Anagnostopoulos, A.1    Kumar, R.2    Mahdian, M.3    Upfal, E.4
  • 3
    • 38149027373 scopus 로고    scopus 로고
    • Monte Carlo methods in Pagerank computation: When one iteration is sufficient
    • K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova. Monte Carlo methods in Pagerank computation: When one iteration is sufficient. SIAM J. Numer. Anal., 45(2):890-904, 2007.
    • (2007) SIAM J. Numer. Anal. , vol.45 , Issue.2 , pp. 890-904
    • Avrachenkov, K.1    Litvak, N.2    Nemirovsky, D.3    Osipova, N.4
  • 4
    • 79959919123 scopus 로고    scopus 로고
    • Fast personalized PageRank on MapReduce
    • B. Bahmani, K. Chakrabarti, and D. Xin. Fast personalized PageRank on MapReduce. In SIGMOD, pages 973-984, 2011.
    • (2011) SIGMOD , pp. 973-984
    • Bahmani, B.1    Chakrabarti, K.2    Xin, D.3
  • 5
    • 79960170113 scopus 로고    scopus 로고
    • Fast incremental and personalized PageRank
    • B. Bahmani, A. Chowdhury, and A. Goel. 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
  • 6
    • 77954235092 scopus 로고    scopus 로고
    • Survey: A survey on PageRank computing
    • P. Berkhin. Survey: 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
  • 7
    • 18744409364 scopus 로고    scopus 로고
    • Local methods for estimating PageRank values
    • Y.-Y. Chen, Q. Gan, and T. Suel. Local methods for estimating PageRank values. In CIKM, pages 381-389, 2004.
    • (2004) CIKM , pp. 381-389
    • Chen, Y.-Y.1    Gan, Q.2    Suel, T.3
  • 9
    • 57349088162 scopus 로고    scopus 로고
    • Estimating PageRank on graph streams
    • A. Das Sarma, S. Gollapudi, and R. Panigrahy. Estimating PageRank on graph streams. In PODS, pages 69-78, 2008.
    • (2008) PODS , pp. 69-78
    • Das Sarma, A.1    Gollapudi, S.2    Panigrahy, R.3
  • 11
    • 33749577594 scopus 로고    scopus 로고
    • Estimating the global PageRank of web communities
    • J. V. Davis and I. S. Dhillon. Estimating the global PageRank of web communities. In KDD, pages 116-125, 2006.
    • (2006) KDD , pp. 116-125
    • Davis, J.V.1    Dhillon, I.S.2
  • 15
    • 84880487682 scopus 로고    scopus 로고
    • Extrapolation methods for accelerating PageRank computations
    • S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub. Extrapolation methods for accelerating PageRank computations. In WWW, pages 261-270, 2003.
    • (2003) WWW , pp. 261-270
    • Kamvar, S.D.1    Haveliwala, T.H.2    Manning, C.D.3    Golub, G.H.4
  • 18
    • 85000192048 scopus 로고    scopus 로고
    • Updating PageRank with iterative aggregation. posters
    • A. N. Langville and C. D. Meyer. Updating PageRank with iterative aggregation. In WWW (posters), pages 392-393, 2004.
    • (2004) WWW , pp. 392-393
    • Langville, A.N.1    Meyer, C.D.2
  • 19
    • 33750184660 scopus 로고    scopus 로고
    • Updating Markov Chains with an eye on Google's PageRank
    • A. N. Langville and C. D. Meyer. Updating Markov Chains with an eye on Google's PageRank. SIAM J. Matrix Anal. Appl., 27(4):968-987, 2006.
    • (2006) SIAM J. Matrix Anal. Appl. , vol.27 , Issue.4 , pp. 968-987
    • Langville, A.N.1    Meyer, C.D.2
  • 20
    • 34250684611 scopus 로고    scopus 로고
    • A uniform approach to accelerated PageRank computation
    • F. McSherry. A uniform approach to accelerated PageRank computation. In WWW, pages 575-582, 2005.
    • (2005) WWW , pp. 575-582
    • McSherry, F.1
  • 22
    • 57349141405 scopus 로고    scopus 로고
    • Recrawl scheduling based on information longevity
    • C. Olston and S. Pandey. Recrawl scheduling based on information longevity. In WWW, pages 437-446, 2008.
    • (2008) WWW , pp. 437-446
    • Olston, C.1    Pandey, S.2
  • 24
    • 33745753308 scopus 로고    scopus 로고
    • User-centric web crawling
    • S. Pandey and C. Olston. User-centric web crawling. In WWW, pages 401-411, 2005.
    • (2005) WWW , pp. 401-411
    • Pandey, S.1    Olston, C.2
  • 25
    • 42549138928 scopus 로고    scopus 로고
    • Crawl ordering by search impact
    • S. Pandey and C. Olston. Crawl ordering by search impact. In WSDM, pages 3-14, 2008.
    • (2008) WSDM , pp. 3-14
    • Pandey, S.1    Olston, C.2
  • 26
    • 77249143284 scopus 로고    scopus 로고
    • Property testing: A learning theory perspective
    • D. Ron. Property testing: A learning theory perspective. Found. Trends Mach. Learn., 1:307-402, 2008.
    • (2008) Found. Trends Mach. Learn. , vol.1 , pp. 307-402
    • Ron, D.1
  • 27
    • 77249103616 scopus 로고    scopus 로고
    • Algorithmic and analysis techniques in property testing
    • D. Ron. Algorithmic and analysis techniques in property testing. Found. Trends Theor. Comput. Sci., 5:73-205, 2010.
    • (2010) Found. Trends Theor. Comput. Sci. , vol.5 , pp. 73-205
    • Ron, D.1
  • 28
    • 79951738724 scopus 로고    scopus 로고
    • Scalable proximity estimation and link prediction in online social networks
    • H. H. Song, T. W. Cho, V. Dave, Y. Zhang, and L. Qiu. Scalable proximity estimation and link prediction in online social networks. In IMC, pages 322-335, 2009.
    • (2009) IMC , pp. 322-335
    • Song, H.H.1    Cho, T.W.2    Dave, V.3    Zhang, Y.4    Qiu, L.5
  • 29
    • 52649167294 scopus 로고    scopus 로고
    • Proximity tracking on time-evolving bipartite graphs
    • H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos. Proximity tracking on time-evolving bipartite graphs. In SDM, pages 704-715, 2008.
    • (2008) SDM , pp. 704-715
    • Tong, H.1    Papadimitriou, S.2    Yu, P.S.3    Faloutsos, C.4
  • 30


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