{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:37:59Z","timestamp":1740123479140,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T00:00:00Z","timestamp":1524441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11227-018-2383-9","type":"journal-article","created":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T11:34:27Z","timestamp":1524483267000},"page":"3278-3294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A heuristic search algorithm based on subspaces for PageRank computation"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6829-8574","authenticated-orcid":false,"given":"Takafumi","family":"Miyata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,23]]},"reference":[{"key":"2383_CR1","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. Stanford University Technical Report 1999-66"},{"issue":"3","key":"2383_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"AN Langville","year":"2003","unstructured":"Langville AN, Meyer CD (2003) Deeper inside PageRank. Internet Math 1(3):335\u2013380","journal-title":"Internet Math"},{"key":"2383_CR3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and beyond: the science of search engine rankings","author":"AN Langville","year":"2006","unstructured":"Langville AN, Meyer CD (2006) Google\u2019s PageRank and beyond: the science of search engine rankings. Princeton University Press, Princeton"},{"key":"2383_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1017\/S0962492906240017","volume":"15","author":"L Eld\u00e9n","year":"2006","unstructured":"Eld\u00e9n L (2006) Numerical linear algebra in data mining. Acta Numer 15:327\u2013384","journal-title":"Acta Numer"},{"key":"2383_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718867","volume-title":"Matrix methods in data mining and pattern recognition","author":"L Eld\u00e9n","year":"2007","unstructured":"Eld\u00e9n L (2007) Matrix methods in data mining and pattern recognition. SIAM, Philadelphia"},{"key":"2383_CR6","doi-asserted-by":"publisher","DOI":"10.1515\/9781400837069","volume-title":"Numerical algorithms for personalized search in self-organizing information networks","author":"SD Kamvar","year":"2010","unstructured":"Kamvar SD (2010) Numerical algorithms for personalized search in self-organizing information networks. Princeton University Press, Princeton"},{"key":"2383_CR7","unstructured":"Moler C (2011) Experiments with MATLAB. Electronic edition published by MathWorks. http:\/\/www.mathworks.com\/moler"},{"issue":"3","key":"2383_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/140976649","volume":"57","author":"DF Gleich","year":"2015","unstructured":"Gleich DF (2015) PageRank beyond the web. SIAM Rev 57(3):321\u2013363","journal-title":"SIAM Rev"},{"key":"2383_CR9","unstructured":"Kamvar SD, Haveliwala TH, Golub GH (2003) Adaptive methods for the computation of PageRank. Stanford University Technical Report 2003-26"},{"key":"2383_CR10","doi-asserted-by":"crossref","unstructured":"Kamvar SD, Haveliwala TH, Manning CD, Golub GH (2003) Extrapolation methods for accelerating PageRank computations. In: Proceedings of the 12th International Conference on World Wide Web","DOI":"10.1145\/775152.775190"},{"key":"2383_CR11","unstructured":"Haveliwala TH, Kamvar SD, Klein D, Manning CD, Golub GH (2003) Computing PageRank using power extrapolation. Stanford University Technical Report 2003-45"},{"issue":"4","key":"2383_CR12","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10543-006-0091-y","volume":"46","author":"GH Golub","year":"2006","unstructured":"Golub GH, Greif C (2006) An Arnoldi-type algorithm for computing page rank. BIT 46(4):759\u2013771","journal-title":"BIT"},{"issue":"2","key":"2383_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s11227-014-1118-9","volume":"70","author":"J Arnal","year":"2014","unstructured":"Arnal J, Migall\u00f3n H, Migall\u00f3n V, Palomino JA, Penad\u00e9s J (2014) Parallel relaxed and extrapolated algorithms for computing PageRank. J Supercomput 70(2):637\u2013648","journal-title":"J Supercomput"},{"key":"2383_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.cam.2016.08.034","volume":"313","author":"X Tan","year":"2017","unstructured":"Tan X (2017) A new extrapolation method for PageRank computations. J Comput Appl Math 313:383\u2013392","journal-title":"J Comput Appl Math"},{"key":"2383_CR15","doi-asserted-by":"publisher","unstructured":"Migall\u00f3n H, Migall\u00f3n V, Palomino JA, Penad\u00e9s J (2016) A heuristic relaxed extrapolated algorithm for accelerating PageRank. Adv Eng Softw. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.024","DOI":"10.1016\/j.advengsoft.2016.01.024"},{"key":"2383_CR16","volume-title":"Matrix computations","author":"GH Golub","year":"2012","unstructured":"Golub GH, Loan CFV (2012) Matrix computations. SIAM, Philadelphia"},{"key":"2383_CR17","unstructured":"LAPACK\u2014Linear Algebra PACKage. http:\/\/www.netlib.org\/lapack\/"},{"key":"2383_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK users\u2019 guide","author":"E Anderson","year":"1999","unstructured":"Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J, Du Croz J, Greenbaum A, Hammarling S, McKenney A, Sorensen D (1999) LAPACK users\u2019 guide. SIAM, Philadelphia"},{"key":"2383_CR19","unstructured":"Haveliwala TH, Kamvar SD (2003) The second eigenvalue of the Google matrix. Stanford University Technical Report 2003-20"},{"issue":"1","key":"2383_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1090\/qam\/42792","volume":"9","author":"WE Arnoldi","year":"1951","unstructured":"Arnoldi WE (1951) The principle of minimized iterations in the solution of the matrix eigenvalue problem. Q Appl Math 9(1):17\u201329","journal-title":"Q Appl Math"},{"key":"2383_CR21","volume-title":"The algebraic eigenvalue problem","author":"JH Wilkinson","year":"1988","unstructured":"Wilkinson JH (1988) The algebraic eigenvalue problem. Oxford University Press, Oxford"},{"key":"2383_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719581","volume-title":"Templates for the solution of algebraic eigenvalue problems: a practical guide","author":"Z Bai","year":"2000","unstructured":"Bai Z, Demmel J, Dongarra J, Ruhe A, Vorst H (2000) Templates for the solution of algebraic eigenvalue problems: a practical guide. SIAM, Philadelphia"},{"key":"2383_CR23","doi-asserted-by":"crossref","unstructured":"Davis TA, Hu Y (2011) The university of Florida sparse matrix collection. ACM Trans Math Softw 38(1):1\u201325. Available as the SuiteSparse matrix collection. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/","DOI":"10.1145\/2049662.2049663"},{"key":"2383_CR24","unstructured":"OpenMP application programming interface examples ver. 4.5.0. http:\/\/www.openmp.org\/wp-content\/uploads\/openmp-examples-4.5.0.pdf"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2383-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2383-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2383-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T18:13:14Z","timestamp":1571249594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2383-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,23]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["2383"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2383-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2018,4,23]]},"assertion":[{"value":"23 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}