메뉴 건너뛰기




Volumn 3, Issue 1, 2016, Pages

Optimized relativity search: node reduction in personalized page rank estimation for large graphs

Author keywords

Estimation; Graph reduction; Node reduction; PageRank

Indexed keywords

GRAPH THEORY; MONTE CARLO METHODS; SEARCH ENGINES;

EID: 85013947883     PISSN: None     EISSN: 21961115     Source Type: Journal    
DOI: 10.1186/s40537-016-0047-2     Document Type: Article
Times cited : (11)

References (34)
  • 1
    • 2942531037 scopus 로고    scopus 로고
    • Adaptive methods for the computation of PageRank
    • Kamvar S, Haveliwala T, Golub G. Adaptive methods for the computation of PageRank. Linear Algebra Appl. 2004;386:51–65.
    • (2004) Linear Algebra Appl , vol.386 , pp. 51-65
    • Kamvar, S.1    Haveliwala, T.2    Golub, G.3
  • 2
    • 0041848443 scopus 로고    scopus 로고
    • Topic-sensitive PageRank: a context-sensitive ranking algorithm for web search
    • Haveliwala TH. Topic-sensitive PageRank: a context-sensitive ranking algorithm for web search. IEEE Trans Knowl Data Eng. 2003;15(4):784–96.
    • (2003) IEEE Trans Knowl Data Eng , vol.15 , Issue.4 , pp. 784-796
    • Haveliwala, T.H.1
  • 4
    • 33846293215 scopus 로고    scopus 로고
    • Finding scientific gems with Google’s PageRank algorithm
    • Chen P, Xie H, Maslov S, Redner S. Finding scientific gems with Google’s PageRank algorithm. J Inform. 2007;1(1):8–15.
    • (2007) J Inform , vol.1 , Issue.1 , pp. 8-15
    • Chen, P.1    Xie, H.2    Maslov, S.3    Redner, S.4
  • 10
    • 0033293401 scopus 로고    scopus 로고
    • Measuring index quality using randomwalks on the web
    • Henzinger MR, Heydon A, Mitzenmacher M, Najork M. Measuring index quality using randomwalks on the web. Comput Netw. 1999;31(11–16):1291–303.
    • (1999) Comput Netw , vol.31 , Issue.11-16 , pp. 1291-1303
    • Henzinger, M.R.1    Heydon, A.2    Mitzenmacher, M.3    Najork, M.4
  • 13
    • 80051481471 scopus 로고    scopus 로고
    • Approximating personalized PageRank with minimal use of web graph data
    • Gleich D, Polito M. Approximating personalized PageRank with minimal use of web graph data. Internet Math. 2006;3(3):257–94.
    • (2006) Internet Math , vol.3 , Issue.3 , pp. 257-294
    • Gleich, D.1    Polito, M.2
  • 22
    • 84924122981 scopus 로고    scopus 로고
    • Towards scaling fully personalized PageRank: algorithms, lower bounds, and experiments
    • Fogaras D, Racz B, Csalogany K, Sarlos T. Towards scaling fully personalized PageRank: algorithms, lower bounds, and experiments. Internet Math. 2005;2(3):333.
    • (2005) Internet Math , vol.2 , Issue.3 , pp. 333
    • Fogaras, D.1    Racz, B.2    Csalogany, K.3    Sarlos, T.4
  • 23
    • 85183791524 scopus 로고    scopus 로고
    • Proceedings of the 19th annual ACM-SIAM symposium on discrete algorithms
    • Chebolu P, Melsted P. PageRank and the random surfer model. In: Proceedings of the 19th annual ACM-SIAM symposium on discrete algorithms. Society for industrial and applied mathematics; 2008. p. 1010–8.
    • Society for industrial and applied mathematics , vol.2008 , pp. 1010-1018
    • Chebolu, P.1    PageRank, M.P.2
  • 27
    • 84881264179 scopus 로고    scopus 로고
    • Incremental and accuracyaware personalized PageRank through scheduled approximation
    • Zhu F, Fang Y, Chang KCC, Ying J. Incremental and accuracyaware personalized PageRank through scheduled approximation. Proc VLDB Endow. 2013;6(6):481–92.
    • (2013) Proc VLDB Endow , vol.6 , Issue.6 , pp. 481-492
    • Zhu, F.1    Fang, Y.2    Chang, K.C.C.3    Ying, J.4
  • 30
    • 85013906614 scopus 로고    scopus 로고
    • Personalized PageRank estimation and search: a bidirectional approach
    • Lofgren P, Banerjee S, Goel A. Personalized PageRank estimation and search: a bidirectional approach. Technical report; 2015.
    • (2015) Technical report
    • Lofgren, P.1    Banerjee, S.2    Goel, A.3
  • 31
    • 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 Numer Anal. 2007;45:890.
    • (2007) SIAM J Numer Anal , vol.45 , pp. 890
    • Avrachenkov, K.1    Litvak, N.2    Nemirovsky, D.3    Osipova, N.4
  • 33
    • 85183809198 scopus 로고    scopus 로고
    • Multi-scale matrix sampling and sublinear-time PageRank computation, Internet Math
    • Borgs C, Brautbar M, Chayes J, Teng S-H. Multi-scale matrix sampling and sublinear-time PageRank computation. Internet Math; 2013.
    • (2013) Teng S-H
    • Borgs, C.1    Brautbar, M.2    Chayes, J.3
  • 34
    • 85183808531 scopus 로고    scopus 로고
    • Interdisciplinary Research Institute,. Accessed 25 Dec 2015.
    • Interdisciplinary Research Institute, http://www.ilabsite.org/?page_id=12. Accessed 25 Dec 2015.


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