메뉴 건너뛰기




Volumn 29, Issue 4, 2007, Pages 1281-1296

Pagerank computation, with special attention to dangling nodes

Author keywords

Google; Jordan decomposition; Lumping; Power method; Rank one matrix; Similarity transformation; Stationary distribution; Stochastic matrix

Indexed keywords

GOOGLE; JORDAN DECOMPOSITION; LUMPING; POWER METHOD; RANK-ONE MATRIX; SIMILARITY TRANSFORMATION; STATIONARY DISTRIBUTION; STOCHASTIC MATRIX;

EID: 38049017083     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/060664331     Document Type: Article
Times cited : (69)

References (35)
  • 2
    • 77954235092 scopus 로고    scopus 로고
    • A survey on PageRank computing
    • P. BERKHIN, A survey on PageRank computing, Internet Math., 2 (2005), pp. 73-120.
    • (2005) Internet Math , vol.2 , pp. 73-120
    • BERKHIN, P.1
  • 5
    • 34247383235 scopus 로고    scopus 로고
    • C. BREZINSKI AND M. REDIVO-ZAGLIA, The PageRank vector: Properties, computation, approximation, and acceleration, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 551-575.
    • C. BREZINSKI AND M. REDIVO-ZAGLIA, The PageRank vector: Properties, computation, approximation, and acceleration, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 551-575.
  • 7
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual web search engine, Comput
    • S. BRIN AND L. PAGE, The anatomy of a large-scale hypertextual web search engine, Comput. Networks and ISDN Systems, 30 (1998), pp. 107-117.
    • (1998) Networks and ISDN Systems , vol.30 , pp. 107-117
    • BRIN, S.1    PAGE, L.2
  • 9
    • 0031536532 scopus 로고    scopus 로고
    • Quasi lumpability, lower-bounding coupling matrices, and nearly completely decomposable Markov chains
    • T. DAYAR AND W. J. STEWART, Quasi lumpability, lower-bounding coupling matrices, and nearly completely decomposable Markov chains, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 482-498.
    • (1997) SIAM J. Matrix Anal. Appl , vol.18 , pp. 482-498
    • DAYAR, T.1    STEWART, W.J.2
  • 10
    • 84924205346 scopus 로고    scopus 로고
    • Fast PageRank computation via a sparse linear system
    • Available online at
    • G. M. DEL CORSO, A. GULLÍ, AND F. ROMANI, Fast PageRank computation via a sparse linear system, Internet Math., 2 (2005), pp. 251-273. Available online at http://www. internetmathematics.org/volumes/2/3/DelCorso.pdf.
    • (2005) Internet Math , vol.2 , pp. 251-273
    • DEL CORSO, G.M.1    GULLÍ, A.2    ROMANI, F.3
  • 12
    • 33646737843 scopus 로고    scopus 로고
    • The Eigenvalues of the Google Matrix
    • Technical report LiTH-MAT-R-04-01, Department of Mathematics, Linköping University, Linköping, Sweden
    • L. ELDÉN, The Eigenvalues of the Google Matrix, Technical report LiTH-MAT-R-04-01, Department of Mathematics, Linköping University, Linköping, Sweden, 2004.
    • (2004)
    • ELDÉN, L.1
  • 13
    • 33646154492 scopus 로고    scopus 로고
    • Fast parallel PageRank: A Linear System Approach
    • Technical report, Yahoo, Sunnyvale, CA
    • D. GLEICH, L. ZHUKOV, AND P. BERKHIN, Fast parallel PageRank: A Linear System Approach, Technical report, Yahoo!, Sunnyvale, CA, 2004.
    • (2004)
    • GLEICH, D.1    ZHUKOV, L.2    BERKHIN, P.3
  • 14
    • 33845346144 scopus 로고    scopus 로고
    • An Arnoldi-type algorithm for computing PageRank
    • G. H. GOLUB AND C. GREIF, An Arnoldi-type algorithm for computing PageRank, BIT, 46 (2006), pp. 759-771.
    • (2006) BIT , vol.46 , pp. 759-771
    • GOLUB, G.H.1    GREIF, C.2
  • 15
    • 0004236492 scopus 로고    scopus 로고
    • 3rd ed, The Johns Hopkins University Press, Baltimore
    • G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, 1996.
    • (1996) Matrix Computations
    • GOLUB, G.H.1    VAN LOAN, C.F.2
  • 17
    • 20344378435 scopus 로고    scopus 로고
    • Markov property for a function of a Markov chain: A linear algebra approach
    • L. GURVITS AND J. LEDOUX, Markov property for a function of a Markov chain: A linear algebra approach, Linear Algebra Appl., 404 (2005), pp. 85-117.
    • (2005) Linear Algebra Appl , vol.404 , pp. 85-117
    • GURVITS, L.1    LEDOUX, J.2
  • 18
    • 54849428859 scopus 로고    scopus 로고
    • Z. GYÖNGYI, H. GARCIA-MOLINA, AND P. J., Combating web spam with TrustRank, in Proceedings of the Thirtieth VLDB Conference, ACM Press, New York, 2004, pp. 576-587.
    • Z. GYÖNGYI, H. GARCIA-MOLINA, AND P. J., Combating web spam with TrustRank, in Proceedings of the Thirtieth VLDB Conference, ACM Press, New York, 2004, pp. 576-587.
  • 19
    • 2942519772 scopus 로고    scopus 로고
    • The Second Eigenvalue of the Google Matrix
    • Technical report, Computer Science Department, Stanford University, Palo Alto, CA
    • T. H. HAVELIWALA AND S. D. KAMVAR, The Second Eigenvalue of the Google Matrix, Technical report, Computer Science Department, Stanford University, Palo Alto, CA, 2003.
    • (2003)
    • HAVELIWALA, T.H.1    KAMVAR, S.D.2
  • 20
    • 33645284818 scopus 로고    scopus 로고
    • Computing PageRank Using Power Extrapolation
    • Technical report 2003-45, Palo Alto, CA, Available online at
    • T. H. HAVELIWALA, S. D. KAMVAR, D. KLEIN, C. D. MANNING, AND G. H. GOLUB, Computing PageRank Using Power Extrapolation, Technical report 2003-45, Stanford University, Palo Alto, CA, 2003. Available online at http://dbpubs.stanford.edu/pub/2003-45.
    • (2003)
    • HAVELIWALA, T.H.1    KAMVAR, S.D.2    KLEIN, D.3    MANNING, C.D.4    GOLUB, G.H.5
  • 21
    • 47249165777 scopus 로고    scopus 로고
    • A general setting for the parametric Google matrix, Internet Math
    • to appear
    • R. A. HORN AND S. SERRA-CAPIZZANO, A general setting for the parametric Google matrix, Internet Math., to appear.
    • HORN, R.A.1    SERRA-CAPIZZANO, S.2
  • 22
    • 33646455491 scopus 로고    scopus 로고
    • Convergence analysis of a PageRank updating algorithm by Langville and Meyer
    • I. C. F. IPSEN AND S. KIRKLAND, Convergence analysis of a PageRank updating algorithm by Langville and Meyer, SIAM J. Matrix Anal. Appl., 27 (2006), pp. 952-967.
    • (2006) SIAM J. Matrix Anal. Appl , vol.27 , pp. 952-967
    • IPSEN, I.C.F.1    KIRKLAND, S.2
  • 24
    • 2942565533 scopus 로고    scopus 로고
    • Testing lumpability in Markov chains
    • R. W. JERNIGAN AND R. H. BARAN, Testing lumpability in Markov chains, Statist. Probab. Lett., 64 (2003), pp. 17-23.
    • (2003) Statist. Probab. Lett , vol.64 , pp. 17-23
    • JERNIGAN, R.W.1    BARAN, R.H.2
  • 25
    • 2942531037 scopus 로고    scopus 로고
    • Adaptive methods for the computation of PageRank
    • S. D. KAMVAR, T. H. HAVELIWALA, AND G. H. GOLUB, Adaptive methods for the computation of PageRank, Linear Algebra Appl., 386 (2004), pp. 51-65.
    • (2004) Linear Algebra Appl , vol.386 , pp. 51-65
    • KAMVAR, S.D.1    HAVELIWALA, T.H.2    GOLUB, G.H.3
  • 28
    • 84906232105 scopus 로고    scopus 로고
    • Deeper inside PageRank
    • Available online at
    • A. N. LANGVILLE AND C. D. MEYER, Deeper inside PageRank, Internet Math., 1 (2004), pp. 335-380. Available online at http://www.internetmathematics.org/volumes/1/3/Langville.pdf.
    • (2004) Internet Math , vol.1 , pp. 335-380
    • LANGVILLE, A.N.1    MEYER, C.D.2
  • 30
    • 33751241157 scopus 로고    scopus 로고
    • A reordering for the PageRank problem
    • A. N. LANGVILLE AND C. D. MEYER, A reordering for the PageRank problem, SIAM J. Sci. Comput., 27 (2006), pp. 2112-2120.
    • (2006) SIAM J. Sci. Comput , vol.27 , pp. 2112-2120
    • LANGVILLE, A.N.1    MEYER, C.D.2
  • 31
    • 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 (2006), pp. 968-987.
    • (2006) SIAM J. Matrix Anal. Appl , vol.27 , pp. 968-987
    • LANGVILLE, A.N.1    MEYER, C.D.2
  • 32
    • 17444399408 scopus 로고    scopus 로고
    • A Fast Two-Stage Algorithm for Computing PageRank and Its Extensions
    • Technical report, Stanford University, Palo Alto, CA
    • C. P. LEE, G. H. GOLUB, AND S. A. ZENIOS, A Fast Two-Stage Algorithm for Computing PageRank and Its Extensions, Technical report, Stanford University, Palo Alto, CA, 2003.
    • (2003)
    • LEE, C.P.1    GOLUB, G.H.2    ZENIOS, S.A.3
  • 34
    • 33646230760 scopus 로고    scopus 로고
    • Jordan canonical form of the Google matrix: A potential contribution to the PageRank computation
    • S. SERRA-CAPIZZANO, Jordan canonical form of the Google matrix: A potential contribution to the PageRank computation, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 305-312.
    • (2005) SIAM J. Matrix Anal. Appl , vol.27 , pp. 305-312
    • SERRA-CAPIZZANO, S.1
  • 35
    • 34248594188 scopus 로고    scopus 로고
    • Google's PageRank: The math behind the search engine
    • R. S. WILLS, Google's PageRank: The math behind the search engine, Math. Intelligencer, 28 (2006), pp. 6-11.
    • (2006) Math. Intelligencer , vol.28 , pp. 6-11
    • WILLS, R.S.1


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