{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:14:31Z","timestamp":1761621271961,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,2]],"date-time":"2016-07-02T00:00:00Z","timestamp":1467417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,7,2]],"date-time":"2016-07-02T00:00:00Z","timestamp":1467417600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","award":["W911NF-13-1-0130"],"award-info":[{"award-number":["W911NF-13-1-0130"]}],"id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1560625"],"award-info":[{"award-number":["1560625"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006228","name":"Oak Ridge National Laboratory","doi-asserted-by":"publisher","award":["4000144962"],"award-info":[{"award-number":["4000144962"]}],"id":[{"id":"10.13039\/100006228","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1186\/s40537-016-0047-2","type":"journal-article","created":{"date-parts":[[2016,7,2]],"date-time":"2016-07-02T00:49:31Z","timestamp":1467420571000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Optimized relativity search: node reduction in personalized page rank estimation for large graphs"],"prefix":"10.1186","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6255-4741","authenticated-orcid":false,"given":"Matin","family":"Pirouz","sequence":"first","affiliation":[]},{"given":"Justin","family":"Zhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,2]]},"reference":[{"key":"47_CR1","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. Adaptive methods for the computation of PageRank. Linear Algebra Appl. 2004;386:51\u201365.","journal-title":"Linear Algebra Appl"},{"issue":"4","key":"47_CR2","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"TH Haveliwala","year":"2003","unstructured":"Haveliwala TH. Topic-sensitive PageRank: a context-sensitive ranking algorithm for web search. IEEE Trans Knowl Data Eng. 2003;15(4):784\u201396.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Brin S, Page L. The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the 7th international conference on world wide web; 1998.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"issue":"1","key":"47_CR4","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.joi.2006.06.001","volume":"1","author":"P Chen","year":"2007","unstructured":"Chen P, Xie H, Maslov S, Redner S. Finding scientific gems with Google\u2019s PageRank algorithm. J Inform. 2007;1(1):8\u201315.","journal-title":"J Inform"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S1389-1286(00)00063-3","volume":"33","author":"J Hirai","year":"2000","unstructured":"Hirai J, Raghavan S, Garcia-Molina H, Paepcke A. WebBase: a repository of web pages. Comput Netw. 2000;33:277\u201393.","journal-title":"Comput Netw"},{"issue":"8","key":"47_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/2.781636","volume":"32","author":"S Chakrabarti","year":"1999","unstructured":"Chakrabarti S, Dom BE, Kumar SR, Raghavan P, Rajagopalan S, Tomkins A, Gibson D, Kleinberg J. Mining the web\u2019s link structure. Computer. 1999;32(8):60\u20137.","journal-title":"Computer"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Bharat K, Mihaila GA. When experts agree: using non-affiliated experts to rank popular topics. In: Proceedings of the 10th international conference on world wide web. New York: ACM; 2001. p. 597\u2013602.","DOI":"10.1145\/371920.372162"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Vieira MV, Fonseca BM, Damazio R, Golgher PB, Reis DC, Ribeiro-Neto B. Efficient search ranking in social networks. In: Proceedings of the 16th ACM conference on information and knowledge management. Lisbon: ACM; 2007.","DOI":"10.1145\/1321440.1321520"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Yin P, Lee W-C, Lee KC. On top-K social web search. In: Proceedings of the 19th ACM international conference on information and knowledge management. New York: ACM; 2010.","DOI":"10.1145\/1871437.1871609"},{"issue":"11\u201316","key":"47_CR10","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1016\/S1389-1286(99)00016-X","volume":"31","author":"MR Henzinger","year":"1999","unstructured":"Henzinger MR, Heydon A, Mitzenmacher M, Najork M. Measuring index quality using randomwalks on the web. Comput Netw. 1999;31(11\u201316):1291\u2013303.","journal-title":"Comput Netw"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Fogaras D, Racz B. Scaling link-based similarity search. In: Proceedings of the 14th international conference on world wide web. New York: ACM Press; 2005. p. 641\u201350.","DOI":"10.1145\/1060745.1060839"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"McSherry F. A uniform approach to accelerated PageRank computation. In: Proceedings of the 14th international conference on world wide web. New York: ACM Press; 2005. p. 575\u201382.","DOI":"10.1145\/1060745.1060829"},{"issue":"3","key":"47_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/15427951.2006.10129128","volume":"3","author":"D Gleich","year":"2006","unstructured":"Gleich D, Polito M. Approximating personalized PageRank with minimal use of web graph data. Internet Math. 2006;3(3):257\u201394.","journal-title":"Internet Math"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"Weng J, Lim E-P, Jiang J, He Q. TwitterRank: finding topic-sensitive influential twitterers. In: Proceedings of the 3rd ACM international conference on web search and data mining. New York: ACM; 2010. p. 261.","DOI":"10.1145\/1718487.1718520"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Bahmani B, Chakrabarti K, Xin D. Fast personalized PageRank on MapReduce. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data (SIGMOD \u201911). New York: ACM; 2011. p. 973\u201384.","DOI":"10.1145\/1989323.1989425"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"Lofgren PA, Banerjee S, Goel A, Seshadhri C. FAST-PPR: scaling personalized PageRank estimation for large graphs. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining (KDD \u201914):, ACM, New York; 2014. p. 1436\u201345.","DOI":"10.1145\/2623330.2623745"},{"issue":"1-2","key":"47_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/15427951.2008.10129302","volume":"5","author":"R Andersen","year":"2008","unstructured":"Andersen R, Borgs C, Chayes J, Hopcraft J, Mirrokni VS, Teng S-H. Local computation of PageRank contributions. Internet Math. 2008;5(1-2):23\u201345.","journal-title":"Internet Math"},{"key":"47_CR18","volume-title":"The PageRank citation ranking: bringing order to the web. Technical report","author":"L Page","year":"1999","unstructured":"Page L, Brin S, Motwani R, Winograd T. The PageRank citation ranking: bringing order to the web. Technical report. Stanford: Stanford InfoLab; 1999."},{"key":"47_CR19","doi-asserted-by":"crossref","unstructured":"Haveliwala TH. Topic-sensitive PageRank. In: Proceedings of the 11th international conference on world wide web. New York: ACM Press; 2002. p. 517\u201326.","DOI":"10.1145\/511446.511513"},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"Jeh G, Widom J. Scaling personalized web search. In: Proceedings of the 12th international conference on world wide web. New York: ACM; 2003.","DOI":"10.1145\/775152.775191"},{"key":"47_CR21","doi-asserted-by":"crossref","unstructured":"Horowitz D, Kamvar SD. The anatomy of a large-scale social search engine. In: Proceedings of the 19th international conference on world wide web. New York: ACM; 2010.","DOI":"10.1145\/1772690.1772735"},{"issue":"3","key":"47_CR22","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D Fogaras","year":"2005","unstructured":"Fogaras D, Racz B, Csalogany K, Sarlos T. Towards scaling fully personalized PageRank: algorithms, lower bounds, and experiments. Internet Math. 2005;2(3):333.","journal-title":"Internet Math"},{"key":"47_CR23","unstructured":"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\u20138."},{"key":"47_CR24","doi-asserted-by":"crossref","unstructured":"Xie W, Bindel D, Demers A, Gehrke J. Edge-weighted personalized PageRank: breaking a decade-old performance barrier. In: Proceedings of the 21st ACM SIGKDD international conference on knowledge discovery and data mining (KDD \u201915). New York: ACM; 2015. p. 1325\u201334.","DOI":"10.1145\/2783258.2783278"},{"key":"47_CR25","doi-asserted-by":"crossref","unstructured":"Xing W, Ghorbani AA. Weighted PageRank algorithm. In: Proceedings of the 2nd annual conference on communication networks and services research; 2004. p. 305\u201314.","DOI":"10.1109\/DNSR.2004.1344743"},{"key":"47_CR26","volume-title":"Efficient computation of PageRank. Technical report","author":"TH Haveliwala","year":"1999","unstructured":"Haveliwala TH. Efficient computation of PageRank. Technical report. Stanford: Stanford University; 1999."},{"issue":"6","key":"47_CR27","doi-asserted-by":"publisher","first-page":"481","DOI":"10.14778\/2536336.2536348","volume":"6","author":"F Zhu","year":"2013","unstructured":"Zhu F, Fang Y, Chang KCC, Ying J. Incremental and accuracyaware personalized PageRank through scheduled approximation. Proc VLDB Endow. 2013;6(6):481\u201392.","journal-title":"Proc VLDB Endow"},{"key":"47_CR28","doi-asserted-by":"crossref","unstructured":"Tong H, He J, Wen Z, Lin C-Y. Diversified ranking on large graphs: an optimization viewpoint. In: Proceeding ACM SIGKDD international conference knowledge discovery data mining. New York: ACM; 2011. p. 1028\u201336.","DOI":"10.1145\/2020408.2020573"},{"key":"47_CR29","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S. Dynamic personalized PageRank in entity-relation graphs. In: Proceedings of the 16th international conference on world wide web. Banff; 2007.","DOI":"10.1145\/1242572.1242650"},{"key":"47_CR30","doi-asserted-by":"crossref","unstructured":"Lofgren P, Banerjee S, Goel A. Personalized PageRank estimation and search: a bidirectional approach. Technical report; 2015.","DOI":"10.1145\/2835776.2835823"},{"key":"47_CR31","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. Monte Carlo methods in PageRank computation: when one iteration is sufficient. SIAM J Numer Anal. 2007;45:890.","journal-title":"SIAM J Numer Anal"},{"key":"47_CR32","doi-asserted-by":"publisher","first-page":"173","DOI":"10.14778\/1929861.1929864","volume":"4","author":"B Bahmani","year":"2010","unstructured":"Bahmani B, Chowdhury A, Goel A. Fast incremental and personalized PageRank. Proc VLDB Endow. 2010;4:173.","journal-title":"Proc VLDB Endow"},{"key":"47_CR33","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Teng S-H. Multi-scale matrix sampling and sublinear-time PageRank computation. Internet Math; 2013.","DOI":"10.1080\/15427951.2013.802752"},{"key":"47_CR34","unstructured":"Interdisciplinary Research Institute, \n                    http:\/\/www.ilabsite.org\/?page_id=12\n                    \n                  . Accessed 25 Dec 2015."}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0047-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-016-0047-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0047-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0047-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T23:27:38Z","timestamp":1589671658000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-016-0047-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,2]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1186\/s40537-016-0047-2","relation":{},"ISSN":["2196-1115"],"issn-type":[{"type":"electronic","value":"2196-1115"}],"subject":[],"published":{"date-parts":[[2016,7,2]]},"assertion":[{"value":"29 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}