{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:50:40Z","timestamp":1743018640372,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448472"},{"type":"electronic","value":"9783662448489"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44848-9_2","type":"book-chapter","created":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T01:42:21Z","timestamp":1409535741000},"page":"17-33","source":"Crossref","is-referenced-by-count":3,"title":["Fast Nearest Neighbor Search on Large Time-Evolving Graphs"],"prefix":"10.1007","author":[{"given":"Leman","family":"Akoglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rohit","family":"Khandekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vibhore","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun-Lung","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using pagerank vectors. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.44"},{"issue":"3","key":"2_CR2","first-page":"173","volume":"4","author":"B. Bahmani","year":"2010","unstructured":"Bahmani, B., Chowdhury, A., Goel, A.: Fast Incremental and Personalized PageRank. PVLDB\u00a04(3), 173\u2013184 (2010)","journal-title":"PVLDB"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Chakrabarti, K., Xin, D.: Fast personalized PageRank on MapReduce. In: SIGMOD (2011)","DOI":"10.1145\/1989323.1989425"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S.: Dynamic personalized pagerank in entity-relation graphs. In: WWW 2007 (2007)","DOI":"10.1145\/1242572.1242650"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y.-Y., Gan, Q., Suel, T.: Local methods for estimating pagerank values. In: CIKM 2004 (2004)","DOI":"10.1145\/1031171.1031248"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Condon, A., Karp, R.M.: Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms\u00a018(2) (2001)","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Das Sarma, A., Gollapudi, S., Panigrahy, R.: Estimating pagerank on graph streams. In: PODS (2008)","DOI":"10.1145\/1376916.1376928"},{"key":"2_CR8","unstructured":"Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: ICDM 2001 (2001)"},{"key":"2_CR9","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications. Wiley (1971)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-30216-2_9","volume-title":"Algorithms and Models for the Web-Graph","author":"D. Fogaras","year":"2004","unstructured":"Fogaras, D., R\u00e1cz, B.: Towards scaling fully personalized pagerank. In: Leonardi, S. (ed.) WAW 2004. LNCS, vol.\u00a03243, pp. 105\u2013117. Springer, Heidelberg (2004)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, M., Pathak, A., Chakrabarti, S.: Fast algorithms for top-k personalized pagerank queries. In: WWW 2008 (2008)","DOI":"10.1145\/1367497.1367738"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. In: WWW 2002 (2002)","DOI":"10.1145\/511511.511513"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW 2003 (2003)","DOI":"10.1145\/775189.775191"},{"key":"2_CR14","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.\u00a0386, 51\u201365 (2004)","journal-title":"Linear Algebra Appl."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel algorithms for multi-constraint graph partitioning. Supercomputing, 1\u201313 (1998)","DOI":"10.1109\/SC.1998.10018"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Updating pagerank with iterative aggregation. In: WWW Alt (2004)","DOI":"10.1145\/1013367.1013491"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics 6(1) (2009)","DOI":"10.1080\/15427951.2009.10129177"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"McSherry, F.: A uniform approach to accelerated pagerank computation. In: WWW 2005 (2005)","DOI":"10.1145\/1060745.1060829"},{"key":"2_CR19","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: NIPS 2001 (2001)"},{"key":"2_CR20","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab (November 1999)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W.: Fast nearest-neighbor search in disk-resident graphs. In: KDD (2010)","DOI":"10.1145\/1835804.1835871"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"I","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Computer Science Review\u00a0I, 27\u201364 (2007)","journal-title":"Computer Science Review"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Stanton, I., Kliot, G.: Streaming graph partitioning for large distributed graphs. In: KDD 2012, pp. 1222\u20131230 (2012)","DOI":"10.1145\/2339530.2339722"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numer. Math.\u00a013, 354\u2013356 (1969)","journal-title":"Numer. Math."},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.-Y.: Fast random walk with restart and its applications. In: ICDM (2006)","DOI":"10.1109\/ICDM.2006.70"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Tong, H., Papadimitriou, S., Yu, P.S., Faloutsos, C.: Proximity Tracking on Time-Evolving Bipartite Graphs. In: SDM (2008)","DOI":"10.1137\/1.9781611972788.64"},{"key":"2_CR27","unstructured":"Woodbury, M.A.: Inverting modified matrices. Memorandum, Statistical Research Group"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44848-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T20:05:05Z","timestamp":1568491505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44848-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448472","9783662448489"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44848-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}