{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:36:27Z","timestamp":1761917787408},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10791-012-9183-2","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T02:13:42Z","timestamp":1327976022000},"page":"503-526","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Lumping algorithms for computing Google\u2019s PageRank and its derivative, with attention to unreferenced nodes"],"prefix":"10.1007","volume":"15","author":[{"given":"Qing","family":"Yu","sequence":"first","affiliation":[]},{"given":"Zhengke","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yimin","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,1]]},"reference":[{"key":"9183_CR1","unstructured":"Arasu, A. (2002). PageRank computation and the structure of the Web: Experiments and algorithms. http:\/\/www2002.org\/CDROM\/poster\/173.pdf."},{"issue":"2","key":"9183_CR2","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/050643799","volume":"45","author":"K. Avrachenkov","year":"2007","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., & Osipova, N. (2007). Monte Carlo methods in PageRank computation: When one iteration is sufficient. SIAM Journal on Numerical Analysis, 45(2), 890\u2013904.","journal-title":"SIAM Journal on Numerical Analysis,"},{"key":"9183_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A. Broder","year":"2000","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000). Graph structure in the Web. Computer Networks, 33, 309\u2013320.","journal-title":"Computer Networks"},{"key":"9183_CR4","unstructured":"Batagelj, V., & Zaver\u0161nik, M. (2012). Generalized cores. http:\/\/arxiv.org\/abs\/cs.DS\/0202039."},{"issue":"4","key":"9183_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1629096.1629097","volume":"27","author":"P. Boldi","year":"2009","unstructured":"Boldi, P., Santini, M., & Vigna, S. (2009). PageRank: Functional dependencies. ACM Transactions on Information Systems, 27(4), Article 19.","journal-title":"ACM Transactions on Information Systems"},{"key":"9183_CR6","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.crma.2005.01.015","volume":"340","author":"C. Brezinski","year":"2005","unstructured":"Brezinski, C., Redivo-Zaglia, M., & Serra-Capizzano, S. (2005). Extrapolation method for PageRank computations. C R Math Acad Sci Paris, 340, 393\u2013397.","journal-title":"C R Math Acad Sci Paris,"},{"key":"9183_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30, 107\u2013117.","journal-title":"Computer Networks and ISDN Systems"},{"key":"9183_CR8","first-page":"37","volume":"21","author":"S. Brin","year":"1998","unstructured":"Brin, S., Motwami, R., Page, L., & Winograd, T. (1998) What can you do with a Web in your pocket? Data Engineering Bulletin, 21, 37\u201347.","journal-title":"Data Engineering Bulletin,"},{"issue":"3","key":"9183_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/15427951.2005.10129108","volume":"2","author":"G.M. Del Corso","year":"2004","unstructured":"Del Corso, G. M., Gull\u00ed, A., & Romani, F. (2004). Fast PageRank computation via a sparse linear system. Internet Mathematics, 2(3), 251\u2013273.","journal-title":"Internet Mathematics,"},{"key":"9183_CR10","doi-asserted-by":"crossref","unstructured":"Dean, J., & Ghemawat, S. (2008). MapReduce: Simplified data processing on large clusters. Communications of the ACM\u201450th Anniversary Issue: 1958\u20132008, 51(1), 1\u201313.","DOI":"10.1145\/1327452.1327492"},{"key":"9183_CR11","doi-asserted-by":"crossref","unstructured":"Donato, D., Leonardi, S., Millozzi, S., & Tsaparas, P. (2008). Mining the inner structure of the Web graph. Journal of Physics A: Mathematical and Theoretical, 41(22).","DOI":"10.1088\/1751-8113\/41\/22\/224017"},{"key":"9183_CR12","doi-asserted-by":"crossref","unstructured":"Eiron, N., McCurley, K. S., & Tomlin, J. A. (2004). Ranking the web frontier. In Proceedings of the 13th international conference on World Wide Web table of contents (pp. 309\u2013318), New York, NY, USA.","DOI":"10.1145\/988672.988714"},{"key":"9183_CR13","unstructured":"Gleich, D., Glynn, P., Golub, G. H., & Greif, C. (2007). Three results on the PageRank vector: Eigenstructure, sensitivity and the derivative. In A. Frommer, M. Mahoney, & D. Szyld (Eds.), Proceedings of the Dagstuhl conference in Web retrieval and numerical linear algebra algorithms."},{"key":"9183_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/080727397","volume":"32","author":"D. Gleich","year":"2010","unstructured":"Gleich, D., Gray, A., Greif, C., & Lau, T. (2010). An inner-outer iteration for computing PageRank. SIAM Journal on Scientific Computing, 32, 349\u2013371.","journal-title":"SIAM Journal on Scientific Computing,"},{"key":"9183_CR15","unstructured":"Gleich, D., Zhukov, L., & Berkhin, P. (2005). Fast parallel PageRank: A linear system approach. WWW2005, Chiba and Japan."},{"key":"9183_CR16","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10543-006-0091-y","volume":"46","author":"G.H. Golub","year":"2006","unstructured":"Golub, G. H., & Greif, C. (2006). An Arnoldi-type algorithm for computing PageRank. BIT, 46, 759\u2013771.","journal-title":"BIT,"},{"key":"9183_CR17","volume-title":"Matrix computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G. H., & Van Loan, C. F. (1996). Matrix computations, 3rd edn. Baltimore and London: The Johns Hopkins University Press","edition":"3"},{"key":"9183_CR18","unstructured":"Haveliwala, T., Kamvar, S., Klein, D., Manning, C., & Golub, G. H. (2003). Computing PageRank using power extrapolation. Stanford University Technical Report."},{"key":"9183_CR19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and stability of numerical algorithms","author":"N.J. Higham","year":"2002","unstructured":"Higham, N. J. (2002). Accuracy and stability of numerical algorithms, 2nd edn. Philadelphia: SIAM","edition":"2"},{"key":"9183_CR20","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1137\/060664331","volume":"29","author":"I. Ipsen","year":"2007","unstructured":"Ipsen, I., & Selee, T. (2007). PageRank computation, with special attention to dangling nodes. SIAM Journal on Matrix Analysis and Applications, 29, 1281\u20131296.","journal-title":"SIAM Journal on Matrix Analysis and Applications,"},{"key":"9183_CR21","first-page":"191","volume":"34","author":"I. Ipsen","year":"2006","unstructured":"Ipsen, I., & Wills, R. (2006). Mathematical properties and analysis of Google\u2019s PageRank. Bol Soc Esp Mat Apl, 34, 191\u2013196.","journal-title":"Bol Soc Esp Mat Apl,"},{"key":"9183_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.laa.2003.12.008","volume":"386","author":"S. Kamvar","year":"2004","unstructured":"Kamvar, S., Haveliwala, T., & Golub, G. H. (2004). Adaptive methods for the computation of PageRank. Linear Algebra and its Applications, 386, 51\u201365.","journal-title":"Linear Algebra and its Applications,"},{"key":"9183_CR23","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., & Golub, G. H. (2003). Extrapolation methods for accelerating PageRank computations. In Twelfth international World Wide Web conference.","DOI":"10.1145\/775152.775190"},{"key":"9183_CR24","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., & Golub, G. H. (2003). Exploiting the block structure of the Web for computing PageRank. Stanford University Technical Report, SCCM-03-02."},{"key":"9183_CR25","doi-asserted-by":"publisher","first-page":"2112","DOI":"10.1137\/040607551","volume":"27","author":"A. Langville","year":"2006","unstructured":"Langville, A., & Meyer, C. (2006). A reordering for the PageRank problem. SIAM Journal on Scientific Computing, 27, 2112\u20132120.","journal-title":"SIAM Journal on Scientific Computing,"},{"key":"9183_CR26","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and beyond: The science of search engine rankings","author":"A. Langville","year":"2006","unstructured":"Langville, A., & Meyer, C. (2006). Google\u2019s PageRank and beyond: The science of search engine rankings. Princeton, NJ: Princeton University Press"},{"issue":"4","key":"9183_CR27","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1080\/15427951.2007.10129151","volume":"4","author":"C. Lee","year":"2007","unstructured":"Lee, C., Golub, G. H., & Zenios, S. (2007). A two-stage algorithm for computing PageRank and multistage generalizations. Internet Mathematics, 4(4), 299\u2013328.","journal-title":"Internet Mathematics,"},{"key":"9183_CR28","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.cam.2008.06.003","volume":"224","author":"Y. Lin","year":"2009","unstructured":"Lin, Y., Shi, X., & Wei, Y. (2009). On computing PageRank via lumping the Google matrix. Journal of Computational and Applied Mathematics, 224, 702\u2013708.","journal-title":"Journal of Computational and Applied Mathematics,"},{"key":"9183_CR29","unstructured":"Page, L., Brin, S., Motwami, R., & Winograd, T. (1998). The PageRank citation ranking: Bring order to the Web. Technical Report, Computer Science Department, Stanford University."},{"key":"9183_CR30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative methods for sparse linear systems","author":"Y. Saad","year":"2003","unstructured":"Saad, Y. (2003). Iterative methods for sparse linear systems, 2nd edn. Philadelphia, PA: SIAM","edition":"2"},{"key":"9183_CR31","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1137\/070698129","volume":"30","author":"R. Wills","year":"2009","unstructured":"Wills, R., & Ipsen, I. (2009). Ordinal ranking for Google\u2019s PageRank. SIAM Journal on Matrix Analysis and Applications, 30, 1677\u20131696.","journal-title":"SIAM Journal on Matrix Analysis and Applications,"},{"issue":"7","key":"9183_CR32","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1002\/nla.531","volume":"14","author":"G. Wu","year":"2007","unstructured":"Wu, G., & Wei, Y. (2007). A Power-Arnoldi algorithm for computing PageRank. Numerical Linear Algebra with Applications, 14(7), 521\u2013546.","journal-title":"Numerical Linear Algebra with Applications,"},{"issue":"3","key":"9183_CR33","first-page":"11","volume":"28","author":"G. Wu","year":"2010","unstructured":"Wu, G., & Wei, Y. (2010). Arnoldi versus GMRES for computing PageRank: A theoretical contribution to Google\u2019s PageRank problem. ACM Transactions on Information Systems, 28(3), Article 11.","journal-title":"ACM Transactions on Information Systems"},{"key":"9183_CR34","doi-asserted-by":"publisher","first-page":"3196","DOI":"10.1016\/j.cam.2010.02.009","volume":"234","author":"G. Wu","year":"2010","unstructured":"Wu, G., & Wei, Y. (2010). An Arnoldi-Extrapolation algorithm for computing PageRank. Journal of Computational Applied Mathematics, 234, 3196\u20133212.","journal-title":"Journal of Computational Applied Mathematics,"}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-012-9183-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-012-9183-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-012-9183-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-012-9183-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:08:36Z","timestamp":1704208116000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-012-9183-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,1]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9183"],"URL":"https:\/\/doi.org\/10.1007\/s10791-012-9183-2","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,1]]},"assertion":[{"value":"4 July 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2012","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2012","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}