{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:12:39Z","timestamp":1779174759899,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T00:00:00Z","timestamp":1269216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-08-42769IIS-09-05215"],"award-info":[{"award-number":["IIS-08-42769IIS-09-05215"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["6.07E+15"],"award-info":[{"award-number":["6.07E+15"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2008AA01Z120"],"award-info":[{"award-number":["2008AA01Z120"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"publisher","award":["NNX08AC35A"],"award-info":[{"award-number":["NNX08AC35A"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,3,22]]},"DOI":"10.1145\/1739041.1739098","type":"proceedings-article","created":{"date-parts":[[2010,3,16]],"date-time":"2010-03-16T19:27:05Z","timestamp":1268767625000},"page":"465-476","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":127,"title":["Fast computation of SimRank for static and dynamic information networks"],"prefix":"10.1145","author":[{"given":"Cuiping","family":"Li","sequence":"first","affiliation":[{"name":"Renmin University of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[{"name":"UIUC, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoming","family":"He","sequence":"additional","affiliation":[{"name":"Renmin University of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Jin","sequence":"additional","affiliation":[{"name":"UIUC, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizhou","family":"Sun","sequence":"additional","affiliation":[{"name":"UIUC, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yintao","family":"Yu","sequence":"additional","affiliation":[{"name":"UIUC, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyi","family":"Wu","sequence":"additional","affiliation":[{"name":"UIUC, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,3,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066244"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"e_1_3_2_1_4_1","volume-title":"Of the Advances in Neural Information Processing Systems(NIPS)","author":"Ng A.","year":"2002","unstructured":"A. Ng , M. Jordan , and Y. Weiss , \" On spectral clustering: Analysis and an algorithm,\" in Proc . Of the Advances in Neural Information Processing Systems(NIPS) , 2002 . A. Ng, M. Jordan, and Y. Weiss, \"On spectral clustering: Analysis and an algorithm,\" in Proc. Of the Advances in Neural Information Processing Systems(NIPS), 2002."},{"key":"e_1_3_2_1_5_1","volume-title":"Of the National Academy of Sciences","author":"Girvan M.","year":"2002","unstructured":"M. Girvan and M. Newman , \" Community structure in social and biological networks,\" in Proc . Of the National Academy of Sciences , 2002 . M. Girvan and M. Newman, \"Community structure in social and biological networks,\" in Proc. Of the National Academy of Sciences, 2002."},{"key":"e_1_3_2_1_6_1","volume-title":"The pagerank citation ranking: Bringing order to the web,\" Technical report","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd , \" The pagerank citation ranking: Bringing order to the web,\" Technical report , Stanford University Database Group , http:\/\/citeseer.nj.nec.com\/368196.html, 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd, \"The pagerank citation ranking: Bringing order to the web,\" Technical report, Stanford University Database Group, http:\/\/citeseer.nj.nec.com\/368196.html, 1998."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/635484.635487"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150432"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014068"},{"key":"e_1_3_2_1_12_1","first-page":"73","article-title":"Vertex similarity in networks","volume":"026120","author":"Leicht E.","year":"2006","unstructured":"E. Leicht , P. Holme , and M. Newman , \" Vertex similarity in networks ,\" Phys. Rev. , vol. 026120 , p. E 73 , 2006 . E. Leicht, P. Holme, and M. Newman, \"Vertex similarity in networks,\" Phys. Rev., vol. 026120, p. E 73, 2006.","journal-title":"Phys. Rev."},{"key":"e_1_3_2_1_13_1","volume-title":"Algorithmic computation and approximation of semantic similarity,\" in Proc. of the 15th Int'l Conference on World Wide Web (WWW'06)","author":"Maguitman A. G.","year":"2006","unstructured":"A. G. Maguitman , F. Menczer , F. Erdinc , H. Roinestad , and A. Vespignani , \" Algorithmic computation and approximation of semantic similarity,\" in Proc. of the 15th Int'l Conference on World Wide Web (WWW'06) , 2006 . A. G. Maguitman, F. Menczer, F. Erdinc, H. Roinestad, and A. Vespignani, \"Algorithmic computation and approximation of semantic similarity,\" in Proc. of the 15th Int'l Conference on World Wide Web (WWW'06), 2006."},{"key":"e_1_3_2_1_14_1","volume-title":"Accuracy estimate and optimization techniques for simrank computation,\" in Proc. of the 34st Int'l Conference on Very Large Databases (VLDB'08)","author":"Lizorkin D.","year":"2008","unstructured":"D. Lizorkin , P. Velikhov , M. Grinev , and D. Turdakov , \" Accuracy estimate and optimization techniques for simrank computation,\" in Proc. of the 34st Int'l Conference on Very Large Databases (VLDB'08) , 2008 . D. Lizorkin, P. Velikhov, M. Grinev, and D. Turdakov, \"Accuracy estimate and optimization techniques for simrank computation,\" in Proc. of the 34st Int'l Conference on Very Large Databases (VLDB'08), 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060839"},{"key":"e_1_3_2_1_16_1","volume-title":"of the 16th International Symposium on Mathematical Theory of Network and Systems (MTNS","author":"Benner P.","year":"2004","unstructured":"P. Benner , \"Factorized solution of sylvester equations with applications in control,\" in Proc. of the 16th International Symposium on Mathematical Theory of Network and Systems (MTNS 2004 ), 2004. P. Benner, \"Factorized solution of sylvester equations with applications in control,\" in Proc. of the 16th International Symposium on Mathematical Theory of Network and Systems (MTNS 2004), 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717907","volume-title":"Matrix Analysis for Scientists and Engineers","author":"Laub A. J.","year":"2004","unstructured":"A. J. Laub , Matrix Analysis for Scientists and Engineers . Society for Industrial and Applied Mathematics , 2004 . A. J. Laub, Matrix Analysis for Scientists and Engineers. Society for Industrial and Applied Mathematics, 2004."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014135"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_1_20_1","volume-title":"Proximity tracking on time-evolving bipartite graphs.\" in Proc. of SDM","author":"Tong H.","year":"2008","unstructured":"H. Tong , S. Papadimitriou , P. S. Yu , and C. Faloutsos , \" Proximity tracking on time-evolving bipartite graphs.\" in Proc. of SDM , 2008 . H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos, \"Proximity tracking on time-evolving bipartite graphs.\" in Proc. of SDM, 2008."},{"key":"e_1_3_2_1_21_1","volume-title":"Johns Hopkins","author":"Golub G.","year":"1996","unstructured":"G. Golub and C. Loan , Matrix Computation . Johns Hopkins , 1996 . G. Golub and C. Loan, Matrix Computation. Johns Hopkins, 1996."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1032080"},{"key":"e_1_3_2_1_23_1","volume-title":"http:\/\/www.comlab.ox.ac.uk\/files\/721\/NA-08-03.pdf","author":"Stoll M.","year":"2008","unstructured":"M. Stoll , \" A krylov-schur approach to the truncated svd,\" in NA Group technical reports , http:\/\/www.comlab.ox.ac.uk\/files\/721\/NA-08-03.pdf , 2008 . M. Stoll, \"A krylov-schur approach to the truncated svd,\" in NA Group technical reports, http:\/\/www.comlab.ox.ac.uk\/files\/721\/NA-08-03.pdf, 2008."},{"key":"e_1_3_2_1_24_1","volume-title":"The pagerank citation ranking: Bringing order to the web,\" Technical report","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd , \" The pagerank citation ranking: Bringing order to the web,\" Technical report , Stanford University Database Group , http:\/\/citeseer.nj.nec.com\/368196.html, 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd, \"The pagerank citation ranking: Bringing order to the web,\" Technical report, Stanford University Database Group, http:\/\/citeseer.nj.nec.com\/368196.html, 1998."},{"key":"e_1_3_2_1_25_1","volume-title":"Less is more: Compact matrix decomposition for large sparse graphs,\" in Proc. of SDM","author":"Sun J.","year":"2007","unstructured":"J. Sun , Y. Xie , H. Zhang , and C. Faloutsos ., \" Less is more: Compact matrix decomposition for large sparse graphs,\" in Proc. of SDM , 2007 . J. Sun, Y. Xie, H. Zhang, and C. Faloutsos., \"Less is more: Compact matrix decomposition for large sparse graphs,\" in Proc. of SDM, 2007."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1037127"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.164"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453904"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076059"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281269"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_34_1","volume-title":"Graphs over time: densification laws, shrinking diameters and possible explanations,\" in Proc. of the 13th Int'l Conference on Knowledge discovery and data mining(KDD'07)","author":"Leskovec J.","year":"2007","unstructured":"J. Leskovec , J. M. Kleinberg , and C. Faloutsos , \" Graphs over time: densification laws, shrinking diameters and possible explanations,\" in Proc. of the 13th Int'l Conference on Knowledge discovery and data mining(KDD'07) , 2007 . J. Leskovec, J. M. Kleinberg, and C. Faloutsos, \"Graphs over time: densification laws, shrinking diameters and possible explanations,\" in Proc. of the 13th Int'l Conference on Knowledge discovery and data mining(KDD'07), 2007."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150445"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281212"},{"key":"e_1_3_2_1_37_1","volume-title":"Indexing by latent semantic analysis.\" in Journal of the Society for Information Science","author":"Deerwester S.","year":"1990","unstructured":"S. Deerwester , S. T. Dumais , G. W. Furnas , T. K. Landauer , and R. Harshman ., \" Indexing by latent semantic analysis.\" in Journal of the Society for Information Science , 1990 . S. Deerwester, S. T. Dumais, G. W. Furnas, T. K. Landauer, and R. Harshman., \"Indexing by latent semantic analysis.\" in Journal of the Society for Information Science, 1990."},{"key":"e_1_3_2_1_38_1","unstructured":"I. Jolliffe \"Principal component analysis \" Springer 2002. I. Jolliffe \"Principal component analysis \" Springer 2002."}],"event":{"name":"EDBT\/ICDT '10: EDBT\/ICDT '10 joint conference","location":"Lausanne Switzerland","acronym":"EDBT\/ICDT '10"},"container-title":["Proceedings of the 13th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1739041.1739098","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1739041.1739098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:40Z","timestamp":1750249420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1739041.1739098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,22]]},"references-count":38,"alternative-id":["10.1145\/1739041.1739098","10.1145\/1739041"],"URL":"https:\/\/doi.org\/10.1145\/1739041.1739098","relation":{},"subject":[],"published":{"date-parts":[[2010,3,22]]},"assertion":[{"value":"2010-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}