{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T14:20:19Z","timestamp":1693146019031},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T00:00:00Z","timestamp":1434585600000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10115-015-0843-6","type":"journal-article","created":{"date-parts":[[2015,6,17]],"date-time":"2015-06-17T11:49:20Z","timestamp":1434541760000},"page":"261-299","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Locality-sensitive and Re-use Promoting Personalized PageRank computations"],"prefix":"10.1007","volume":"47","author":[{"given":"Jung Hyun","family":"Kim","sequence":"first","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":[[2015,6,18]]},"reference":[{"key":"843_CR1","doi-asserted-by":"crossref","unstructured":"Avrachenkov K, Litvak N, Nemirovsky D, Smirnova E, Sokol M (2011) Quick detection of top-k personalized pagerank lists. WAW\u201911, pp 50\u201361","DOI":"10.1007\/978-3-642-21286-4_5"},{"key":"843_CR2","doi-asserted-by":"crossref","unstructured":"Bahmani B, Chakrabarti K, Xin D (2011) Fast personalized PageRank on MapReduce. In: SIGMOD\u201911, pp 973\u2013984","DOI":"10.1145\/1989323.1989425"},{"issue":"3","key":"843_CR3","first-page":"173","volume":"4","author":"B Bahmani","year":"2010","unstructured":"Bahmani B, Chowdhury A, Goel A (2010) Fast incremental and personalized PageRank. PVLDB 4(3):173\u2013184","journal-title":"PVLDB"},{"key":"843_CR4","doi-asserted-by":"crossref","unstructured":"Balmin A, Hristidis V, Papakonstantinou Y (2004) ObjectRank: authority-based keyword search in databases. VLDB","DOI":"10.1016\/B978-012088469-8.50051-6"},{"key":"843_CR5","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: WWW\u201911","DOI":"10.1145\/1963405.1963493"},{"key":"843_CR6","doi-asserted-by":"crossref","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":"843_CR7","unstructured":"Candan KS, Li WS (2000) Using random walks for mining web document associations. In: PAKDD, pp 294\u2013305"},{"issue":"2","key":"843_CR8","doi-asserted-by":"crossref","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":"843_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti S (2007) Dynamic personalized pagerank in entity-relation graphs. In: WWW \u201907","DOI":"10.1145\/1242572.1242650"},{"key":"843_CR10","unstructured":"Chen M, Liu J, Tang X (2008) Clustering via random walk hitting time on directed graphs. In: AAAI\u201908, pp 616\u2013621"},{"issue":"5","key":"843_CR11","doi-asserted-by":"crossref","first-page":"937","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):937\u2013946","journal-title":"SIAM J Comput"},{"key":"843_CR12","doi-asserted-by":"crossref","unstructured":"Csalogany K, Fogaras D, Racz B, Sarlos T (2005) Towards scaling fully personalized PageRank: algorithms, lower bounds, and experiments. Internet Math 2(3):333\u2013358","DOI":"10.1080\/15427951.2005.10129104"},{"key":"843_CR13","doi-asserted-by":"crossref","unstructured":"Feige U, Hajiaghayi M, Lee JR (2005) Improved approximation algorithms for minimum-weight vertex separators. STOC","DOI":"10.1145\/1060590.1060674"},{"issue":"3","key":"843_CR14","first-page":"355","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss F, Pirotte A, Renders J, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. TKDE 19(3):355\u2013369","journal-title":"TKDE"},{"issue":"5","key":"843_CR15","first-page":"442","volume":"5","author":"Y Fujiwara","year":"2012","unstructured":"Fujiwara Y, Nakatsuji M, Onizuka M, Kitsuregawa M (2012) Fast and exact top-k search for random walk with restart. PVLDB 5(5):442\u2013453","journal-title":"PVLDB"},{"key":"843_CR16","unstructured":"Gunnels J, Lin C, Morrow G, De Geijn RV (1998) Analysis of a class of parallel matrix multiplication algorithms. http:\/\/www.cs.utexas.edu\/users\/plapack\/papers\/ipps98\/ipps98.html"},{"issue":"5","key":"843_CR17","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1109\/71.598277","volume":"8","author":"A Gupta","year":"1997","unstructured":"Gupta A, Karypis G, Kumar V (1997) Highly scalable parallel algorithms for sparse matrix factorization. IEEE Trans Parallel Distrib Syst 8(5):502\u2013520","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"843_CR18","doi-asserted-by":"crossref","unstructured":"Gupta M, Pathak A, Chakrabarti S (2008) Fast algorithms for top-k personalized PageRank queries. In: WWW\u201908, pp. 1225\u20131226","DOI":"10.1145\/1367497.1367738"},{"key":"843_CR19","doi-asserted-by":"crossref","unstructured":"Haveliwala TH (2002) Topic-sensitive PageRank. In: WWW\u201902, pp 517\u2013526","DOI":"10.1145\/511446.511513"},{"key":"843_CR20","doi-asserted-by":"crossref","unstructured":"Huang S, Li X, Candan KS, Sapino ML (2014) \u201cCan you really trust that seed?\u201d Reducing the impact of seed noise in personalized PageRank. In: International conference on advances in social network analysis and mining (ASONAM). Beijing, China","DOI":"10.1109\/ASONAM.2014.6921586"},{"key":"843_CR21","doi-asserted-by":"crossref","unstructured":"Jeh G, Widom J (2002) Scaling personalized web search. Stanford University Technical Report","DOI":"10.1145\/775189.775191"},{"key":"843_CR22","doi-asserted-by":"crossref","unstructured":"Kamvar SD, Haveliwala TH, Manning CD, Golub GH (2003) Extrapolation methods for accelerating PageRank computations. In: WWW\u201903, pp 261\u2013270","DOI":"10.1145\/775152.775190"},{"issue":"1","key":"843_CR23","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"843_CR24","doi-asserted-by":"crossref","unstructured":"Kim JH, Candan KS, Sapino ML (2013) LR-PPR: Locality-Sensitive, Re-use Promoting, Approximate Personalized PageRank Computation. In: ACM international conference on information and knowledge management (CIKM\u201913), October 2013","DOI":"10.1145\/2505515.2505651"},{"key":"843_CR25","doi-asserted-by":"crossref","unstructured":"Kim JH, Candan KS, Sapino ML (2012) Impact neighborhood indexing (INI) in diffusion graphs. In: CIKM\u201912, pp 2184\u20132188","DOI":"10.1145\/2396761.2398598"},{"issue":"5","key":"843_CR26","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J Kleinberg","year":"1999","unstructured":"Kleinberg J (1999) Authoritative sources in a hyperlinked environment. J ACM 46(5):604\u2013632","journal-title":"J ACM"},{"issue":"1","key":"843_CR27","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10115-013-0691-1","volume":"42","author":"W Liu","year":"2015","unstructured":"Liu W, Li G, Cheng J (2015) Fast PageRank approximation by adaptive sampling. J Knowl Inf Syst (KAIS) 42(1):127\u2013146","journal-title":"J Knowl Inf Syst (KAIS)"},{"key":"843_CR28","doi-asserted-by":"crossref","unstructured":"Lofgren P, Banerjee S, Goel A, Seshadhri C (2014) 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), pp 1436\u20131445","DOI":"10.1145\/2623330.2623745"},{"key":"843_CR29","doi-asserted-by":"crossref","unstructured":"Maehara T, Akiba T, Iwata Y, Kawarabayashi K (2014) Computing personalized PageRank quickly by exploiting graph structures. In: VLDB\u201914","DOI":"10.14778\/2732977.2732978"},{"key":"843_CR30","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern M, Bik A, Dehnert J, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: SIGMOD\u201910","DOI":"10.1145\/1807167.1807184"},{"key":"843_CR31","doi-asserted-by":"crossref","unstructured":"Mei Q, Zhou D, Church K (2008) Query suggestion using hitting time. In: CIKM\u201908","DOI":"10.1145\/1458082.1458145"},{"key":"843_CR32","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"M Newman","year":"2006","unstructured":"Newman M (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104","journal-title":"Phys Rev E"},{"key":"843_CR33","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: KDD\u201902","DOI":"10.1145\/775047.775059"},{"issue":"4","key":"843_CR34","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1145\/321420.321434","volume":"14","author":"C Pease Marshall","year":"1967","unstructured":"Pease Marshall C (1967) Matrix inversion using parallel. Proc J ACM 14(4):757\u2013764","journal-title":"Proc J ACM"},{"key":"843_CR35","doi-asserted-by":"crossref","unstructured":"Piegorsch W, Casella GE (1990) Inverting a sum of matrices. In: SIAM review","DOI":"10.1137\/1032080"},{"key":"843_CR36","doi-asserted-by":"crossref","unstructured":"Sarkar P, Moore AW, Prakash A (2008) Fast incremental proximity search in large graphs. In: ICML\u201908","DOI":"10.1145\/1390156.1390269"},{"key":"843_CR37","doi-asserted-by":"crossref","unstructured":"Song HH, Cho TW, Dave V, Zhang Y, Qiu L (2009) Scalable proximity estimation and link prediction in online social networks. In: Internet measurement conference. ACM, pp 322\u2013335","DOI":"10.1145\/1644893.1644932"},{"key":"843_CR38","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C (2006) Center-piece subgraphs: problem definition and fast solutions. In: KDD, pp 404\u2013413","DOI":"10.1145\/1150402.1150448"},{"key":"843_CR39","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Koren Y (2007) Fast direction-aware proximity for graph mining. In: KDD, pp 747\u2013756","DOI":"10.1145\/1281192.1281272"},{"key":"843_CR40","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Pan JY (2006) Fast random walk with restart and its applications. In: ICDM\u201906, pp 613\u2013622","DOI":"10.1109\/ICDM.2006.70"},{"key":"843_CR41","doi-asserted-by":"crossref","unstructured":"Wei F (2010) TEDI: efficient shortest path query answering on graphs. In: SIGMOD\u201910","DOI":"10.1145\/1807167.1807181"},{"key":"843_CR42","unstructured":"Williams VV (2011) Breaking the Coppersmith\u2013Winograd barrier. Unpublished manuscript. http:\/\/www.cs.berkeley.edu\/~virgi\/matrixmult.pdf"},{"key":"843_CR43","doi-asserted-by":"crossref","unstructured":"Wu Y, Raschid L (2009) ApproxRank: estimating rank for a subgraph. In: ICDE\u201909, pp 54\u201365","DOI":"10.1109\/ICDE.2009.108"},{"key":"843_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. EDBT","DOI":"10.1145\/1516360.1516418"},{"key":"843_CR45","unstructured":"Zhou L, Chen L, Ozsu MT (2009) Distance-join: pattern match query in a large graph. VLDB"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0843-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0843-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0843-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T04:20:51Z","timestamp":1566879651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0843-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,18]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["843"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0843-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,18]]}}}