{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:35Z","timestamp":1740160295128,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T00:00:00Z","timestamp":1451952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T00:00:00Z","timestamp":1451952000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1339835,1318788"],"award-info":[{"award-number":["1339835,1318788"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s13278-015-0309-6","type":"journal-article","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T09:56:35Z","timestamp":1451987795000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reducing seed noise in personalized PageRank"],"prefix":"10.1007","volume":"6","author":[{"given":"Shengyu","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinsheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. Sel\u00e7uk","family":"Candan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Luisa","family":"Sapino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,5]]},"reference":[{"key":"309_CR1","doi-asserted-by":"crossref","unstructured":"Andersen R, Borgs C, Chayes J, Feige U, Flaxman A, Kalai A, Mirrokni V, Tennenholtz M (2008) Trust-based recommendation systems: an axiomatic approach. In: Proceedings of the 17th international conference on World Wide Web. ACM, New York, pp 199\u2013208","DOI":"10.1145\/1367497.1367525"},{"key":"309_CR2","doi-asserted-by":"crossref","unstructured":"Avrachenkov K, Litvak N, Nemirovsky D, Smirnova E, Sokol M (2011) Quick detection of top-k personalized PageRank lists. In: Algorithms and Models for the Web Graph. Springer, Berlin Heidelberg, pp 50\u201361","DOI":"10.1007\/978-3-642-21286-4_5"},{"key":"309_CR3","doi-asserted-by":"crossref","unstructured":"Bahmani B, Chakrabarti K, Xin D (2011) Fast personalized PageRank on MapReduce. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, pp 973\u2013984","DOI":"10.1145\/1989323.1989425"},{"key":"309_CR4","doi-asserted-by":"crossref","unstructured":"Bahmani B, Chowdhury A, Goel A (2010) Fast incremental and personalized PageRank. In: Proceedings of the VLDB Endowment, vol 4, pp 173\u2013184","DOI":"10.14778\/1929861.1929864"},{"key":"309_CR5","unstructured":"Balmin A, Hristidis V, Papakonstantinou Y (2004) ObjectRank: authority-based keyword search in databases. In: Proceedings of the Thirtieth international conference on very large data bases. Morgan Kaufman, San Francisco, pp 564\u2013575"},{"issue":"1","key":"309_CR6","first-page":"41","volume":"3","author":"P Berkhin","year":"2007","unstructured":"Berkhin P (2007) Bookmark-coloring approach to personalized pagerank computing. Int Math 3(1):41\u201362","journal-title":"Int Math"},{"key":"309_CR7","doi-asserted-by":"crossref","unstructured":"Boldi P, Rosa M, Vigna S (2011) HyperANF: approximating the neighbourhood function of very large graphs on a budget. In: Proceedings of the 20th international conference on World Wide Web. ACM, New York, pp 625\u2013634","DOI":"10.1145\/1963405.1963493"},{"issue":"1\u20132","key":"309_CR8","first-page":"20","volume":"10","author":"C Borgs","year":"2014","unstructured":"Borgs C, Brautbar M, Chayes J, Teng SH (2014) Multiscale matrix sampling and sublinear-time pagerank computation. Int Math 10(1\u20132):20\u201348","journal-title":"Int Math"},{"issue":"2","key":"309_CR9","first-page":"27","volume":"21","author":"MG Borgatti","year":"1998","unstructured":"Borgatti MG, Jones C, Everett MG (1998) Network measures of social capital. Connections 21(2):27\u201336","journal-title":"Connections"},{"key":"309_CR10","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. Comput Netw ISDN Syst 30:107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"309_CR11","doi-asserted-by":"crossref","unstructured":"Buckley C, Voorhees EM (2004) Retrieval evaluation with incomplete information. In: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval. ACM, New York, pp 25\u201332","DOI":"10.1145\/1008992.1009000"},{"key":"309_CR12","unstructured":"Candan KS, Li WS (2000) Using random walks for mining web document associations. In: Proceedings of the fourth European conference on machine learning and principles and practice of knowledge discovery in databases, pp 294\u2013305"},{"issue":"2","key":"309_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0169-023X(02)00053-8","volume":"43","author":"KS Candan","year":"2002","unstructured":"Candan KS, Li WS (2002) Reasoning for Web document associations and its applications in site map construction. Data Knowl Eng 43(2):121\u2013150","journal-title":"Data Knowl Eng"},{"key":"309_CR14","doi-asserted-by":"crossref","unstructured":"Chakrabarti S (2007) Dynamic personalized pagerank in entity-relation graphs. In: Proceedings of the 16th international conference on World Wide Web. ACM, New York, pp 571\u2013580","DOI":"10.1145\/1242572.1242650"},{"key":"309_CR15","unstructured":"Chen M, Liu J, Tang X (2008) Clustering via random walk hitting time on directed graphs. In: Proceedings of the 23rd national conference on Artificial intelligence, pp 616\u2013621"},{"issue":"5","key":"309_CR16","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen E, Halperin E, Kaplan H, Zwick U (2003) Reachability and distance queries via 2-hop labels. SIAM J Comput 32(5):1338\u20131355","journal-title":"SIAM J Comput"},{"issue":"3","key":"309_CR17","first-page":"333","volume":"2","author":"K Csalogany","year":"2005","unstructured":"Csalogany K, Fogaras D, R\u00e1cz B, Sarl\u00f3s T (2005) Towards scaling fully personalized PageRank: algorithms, lower bounds, and experiments. Int Math 2(3):333\u2013358","journal-title":"Int Math"},{"key":"309_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881","volume-title":"Direct methods for sparse linear systems","author":"TA Davis","year":"2006","unstructured":"Davis TA (2006) Direct methods for sparse linear systems. SIAM, Philadephia, PA, pp 1\u2013211"},{"issue":"4","key":"309_CR19","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1023\/A:1013470632383","volume":"7","author":"KC Foster","year":"2001","unstructured":"Foster KC, Muth SQ, Potterat JJ, Rothenberg RB (2001) A faster Katz status score algorithm. Comput Math Organ Theo 7(4):275\u2013285","journal-title":"Comput Math Organ Theo"},{"key":"309_CR20","first-page":"1041","volume":"5","author":"F Fouss","year":"2007","unstructured":"Fouss F, Pirotte A, Renders JM, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transact Knowl Data Eng 5:1041\u20134347","journal-title":"IEEE Transact Knowl Data Eng"},{"key":"309_CR21","doi-asserted-by":"crossref","unstructured":"Fujiwara Y, Nakatsuji M, Onizuka M, Kitsuregawa M (2012) Fast and exact top-k search for random walk with restart. In: Proceedings of the VLDB Endowment, vol 5, pp 442\u2013453","DOI":"10.14778\/2140436.2140441"},{"key":"309_CR22","doi-asserted-by":"crossref","unstructured":"Guan Z, Bu J, Mei Q, Chen C, Wang C (2009) Personalized tag recommendation using graph-based ranking on multi-type interrelated objects. In: Proceedings of the 32nd international ACM SIGIR conference on research and development in information retrieval. ACM, New York, pp 540\u2013547","DOI":"10.1145\/1571941.1572034"},{"key":"309_CR23","doi-asserted-by":"crossref","unstructured":"Gupta M, Pathak A, Chakrabarti S (2008) Fast algorithms for top-k personalized PageRank queries. In: Proceedings of the 17th international conference on World Wide Web, pp 1225\u20131226","DOI":"10.1145\/1367497.1367738"},{"key":"309_CR24","doi-asserted-by":"crossref","unstructured":"Haveliwala TH (2002) Topic-sensitive PageRank. In: Proceedings of the 11th international conference on World Wide Web. ACM, New York, pp 517\u2013526","DOI":"10.1145\/511446.511513"},{"key":"309_CR25","doi-asserted-by":"crossref","unstructured":"Jeh G, Widom J (2003) Scaling personalized web. In: Proceedings of the 12th international conference on World Wide Web. ACM, New York, pp 271\u2013279","DOI":"10.1145\/775152.775191"},{"key":"309_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18:39\u201343","journal-title":"Psychometrika"},{"key":"309_CR27","doi-asserted-by":"crossref","unstructured":"Kamvar SD, Haveliwala T, Manning CD, Golub G (2003) Extrapolation methods for accelerating PageRank computations. In: Proceedings of the 12th international conference on World Wide Web. ACM, New York, pp 261\u2013270","DOI":"10.1145\/775152.775190"},{"key":"309_CR28","doi-asserted-by":"crossref","unstructured":"Kim HJ, Candan KS, Sapino ML (2013) LR-PPR: locality-sensitive, re-use promoting, approximate personalized PageRank computation. In: Proceedings of the 22nd ACM international conference on information & knowledge management, pp 1801\u20131806","DOI":"10.1145\/2505515.2505651"},{"key":"309_CR29","doi-asserted-by":"crossref","unstructured":"Kim HN, El-Saddik A (2011) Personalized PageRank vectors for tag recommendations: inside FolkRank. In: Proceedings of the fifth ACM conference on recommender systems. ACM, New York, pp 45\u201352","DOI":"10.1145\/2043932.2043945"},{"key":"309_CR30","unstructured":"Langville AN, Meyer CD (2004) Updating pagerank with iterative aggregation. In: Proceedings of the 13th international World Wide Web conference on alternate track papers & posters. ACM, New York, pp 392\u2013393"},{"key":"309_CR31","doi-asserted-by":"crossref","unstructured":"Maehara T, Akiba T et al (2014) Computing personalized PageRank quickly by exploiting graph structures. In: Proceedings of the VLDB endowment, vol 7, pp 1023\u20131034","DOI":"10.14778\/2732977.2732978"},{"key":"309_CR32","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJC, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data. ACM, New York, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"309_CR33","doi-asserted-by":"crossref","unstructured":"Mei Q, Zhou D, Church K (2008) Query suggestion using hitting time. In: Proceedings of the 17th ACM conference on information and knowledge management. ACM, New York, pp 469\u2013478","DOI":"10.1145\/1458082.1458145"},{"key":"309_CR34","doi-asserted-by":"crossref","unstructured":"Palmer C, Gibbons P, Faloutsos C (2002) Anf: a fast and scalable tool for data mining in massive graphs. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, pp 81\u201390","DOI":"10.1145\/775047.775059"},{"key":"309_CR35","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/1032080","volume":"32","author":"W Piegorsch","year":"1990","unstructured":"Piegorsch W, Casella GE (1990) Inverting a sum of matrices. SIAM Rev 32:470","journal-title":"SIAM Rev"},{"key":"309_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s13278-014-0179-3","volume":"4","author":"B Perozzi","year":"2014","unstructured":"Perozzi B, McCubbin C, Halbert JT (2014) Scalable graph clustering with parallel approximate PageRank. Soc Netw Anal Min 4:179\u2013189","journal-title":"Soc Netw Anal Min"},{"key":"309_CR37","doi-asserted-by":"crossref","unstructured":"Sarkar P, Moore AW, Prakash A (2008) Fast incremental proximity search in large graphs. In: Proceedings of the 25th international conference on machine learning. ACM, pp 896\u2013903","DOI":"10.1145\/1390156.1390269"},{"key":"309_CR38","doi-asserted-by":"crossref","unstructured":"Sarma AD, Molla AR, Pandurangan G, Upfal E (2013) Fast distributed PageRank computation. In: Proceedings of 14th international conference on distributed computing and networking, pp 11\u201326","DOI":"10.1007\/978-3-642-35668-1_2"},{"key":"309_CR39","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C (2006) Center-piece subgraphs: problem definition and fast solutions. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp 404\u2013413","DOI":"10.1145\/1150402.1150448"},{"key":"309_CR40","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Koren Y (2007) Fast direction-aware proximity for graph mining. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 747\u2013756","DOI":"10.1145\/1281192.1281272"},{"key":"309_CR41","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Pan JY (2006) Fast random walk with restart and its applications. In: Proceedings of the sixth international conference on data mining, pp 613\u2013622","DOI":"10.1109\/ICDM.2006.70"},{"key":"309_CR42","doi-asserted-by":"crossref","unstructured":"Wei F (2010) Tedi: efficient shortest path query answering on graphs. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data. ACM, New York, pp 99\u2013110","DOI":"10.1145\/1807167.1807181"},{"key":"309_CR43","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0378-8733(94)90015-9","volume":"16","author":"DR White","year":"1994","unstructured":"White DR, Borgatti SP (1994) Betweenness centrality measures for directed graphs. Soc Netw 16:335\u2013346","journal-title":"Soc Netw"},{"key":"309_CR44","doi-asserted-by":"crossref","unstructured":"Xiao Y, Wu W, Pei J, Wang W, He Z (2009) Efficiently indexing shortest paths by exploiting symmetry in graphs. In: Proceedings of the 12th international conference on extending database technology: advances in database technology. ACM, pp 493\u2013504","DOI":"10.1145\/1516360.1516418"},{"key":"309_CR45","unstructured":"Zhou L, Chen L, Ozsu MT (2009) Distance-join: pattern match query in a large graph. In: Proceedings of the VLDB endowment, vol 2, pp 886\u2013897"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0309-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-015-0309-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0309-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0309-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T22:25:41Z","timestamp":1654035941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-015-0309-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,5]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["309"],"URL":"https:\/\/doi.org\/10.1007\/s13278-015-0309-6","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2016,1,5]]},"assertion":[{"value":"6 January 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2015","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2015","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2016","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"6"}}