{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:11:46Z","timestamp":1779174706171,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T00:00:00Z","timestamp":1547164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004950","name":"Aston University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004950","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00778-018-0536-3","type":"journal-article","created":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T06:41:17Z","timestamp":1547188877000},"page":"401-426","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["SimRank*: effective and scalable pairwise similarity search based on graph topology"],"prefix":"10.1007","volume":"28","author":[{"given":"Weiren","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julie A.","family":"McCann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"issue":"1","key":"536_CR1","first-page":"408","volume":"1","author":"I Antonellis","year":"2008","unstructured":"Antonellis, I., Molina, H.G., Chang, C.: SimRank++: query rewriting through link analysis of the click graph. PVLDB 1(1), 408\u2013421 (2008)","journal-title":"PVLDB"},{"key":"536_CR2","unstructured":"Bencz\u00far, A.A., Csalog\u00e1ny, K., Sarl\u00f3s, T.: Link-based similarity search to fight web spam. AIRWeb, 9\u201316 (2006)"},{"issue":"1","key":"536_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P Berkhin","year":"2005","unstructured":"Berkhin, P.: Survey: a survey on PageRank computing. Internet Math 2(1), 73\u2013120 (2005)","journal-title":"Internet Math"},{"issue":"4","key":"536_CR4","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S0036144502415960","volume":"46","author":"VD Blondel","year":"2004","unstructured":"Blondel, V.D., Gajardo, A., Heymans, M., Senellart, P., Dooren, P.V.: A measure of similarity between graph vertices: applications to synonym extraction and web searching. SIAM Rev. 46(4), 647\u2013666 (2004)","journal-title":"SIAM Rev."},{"key":"536_CR5","volume-title":"A Combinatorial Approach to Matrix Theory and Its Applications. Discrete Mathematics and Its Applications","author":"R Brualdi","year":"2008","unstructured":"Brualdi, R., Cvetkovic, D.: A Combinatorial Approach to Matrix Theory and Its Applications. Discrete Mathematics and Its Applications. Taylor & Francis, Abingdon (2008)"},{"key":"536_CR6","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. WSDM, 95\u2013106 (2008)","DOI":"10.1145\/1341531.1341547"},{"issue":"2","key":"536_CR7","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2776894","volume":"10","author":"H Chen","year":"2015","unstructured":"Chen, H., Giles, C.L.: ASCOS++: an asymmetric similarity measure for weighted networks to address the problem of SimRank. TKDD 10(2), 15:1\u201315:26 (2015)","journal-title":"TKDD"},{"key":"536_CR8","doi-asserted-by":"crossref","unstructured":"Fogaras, D., R\u00e1cz, B.: Scaling link-based similarity search. WWW, 641\u2013650 (2005)","DOI":"10.1145\/1060745.1060839"},{"key":"536_CR9","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TKDE.2007.1008","volume":"19","author":"D Fogaras","year":"2007","unstructured":"Fogaras, D., R\u00e1cz, B.: Practical algorithms and lower bounds for similarity search in massive graphs. IEEE Trans. Knowl. Data Eng. 19, 585\u2013598 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"536_CR10","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Onizuka, M.: Efficient search algorithm for SimRank. ICDE, 589\u2013600 (2013)","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"536_CR11","doi-asserted-by":"crossref","unstructured":"He, G., Feng, H., Li, C., Chen, H.: Parallel SimRank computation on large graphs with iterative aggregation. KDD, 543\u2013552 (2010)","DOI":"10.1145\/1835804.1835874"},{"key":"536_CR12","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: SimRank: A measure of structural-context similarity. KDD, 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"issue":"9","key":"536_CR13","first-page":"937","volume":"10","author":"M Jiang","year":"2017","unstructured":"Jiang, M., Fu, A.W., Wong, R.C., Wang, K.: READS: a random walk approach for efficient and accurate dynamic SimRank. PVLDB 10(9), 937\u2013948 (2017)","journal-title":"PVLDB"},{"key":"536_CR14","doi-asserted-by":"crossref","unstructured":"Jin, R., Lee, V.E., Hong, H.: Axiomatic ranking of network role similarity. KDD, 922\u2013930 (2011)","DOI":"10.1145\/2020408.2020561"},{"issue":"2","key":"536_CR15","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/2901736","volume":"41","author":"J Jung","year":"2016","unstructured":"Jung, J., Shin, K., Sael, L., Kang, U.: Random walk with restart on large graphs using block elimination. ACM Trans. Database Syst. 41(2), 12:1\u201312:43 (2016)","journal-title":"ACM Trans. Database Syst."},{"key":"536_CR16","doi-asserted-by":"crossref","unstructured":"Kusumoto, M., Maehara, T., Kawarabayashi, K.: Scalable similarity search for SimRank. In: SIGMOD Conference, pp. 325\u2013336 (2014)","DOI":"10.1145\/2588555.2610526"},{"key":"536_CR17","doi-asserted-by":"crossref","unstructured":"Lee, P., Lakshmanan, L.V.S., Yu, J.X.: On top-\n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                   structural similarity search. ICDE, 774\u2013785 (2012)","DOI":"10.1109\/ICDE.2012.109"},{"issue":"2","key":"536_CR18","doi-asserted-by":"publisher","first-page":"026120","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht, E.A., Holme, P., Newman, M.E.J.: Vertex similarity in networks. Phys. Rev. E 73(2), 026120 (2006)","journal-title":"Phys. Rev. E"},{"key":"536_CR19","doi-asserted-by":"crossref","unstructured":"Li, C., Han, J., He, G., Jin, X., Sun, Y., Yu, Y., Wu, T.: Fast computation of SimRank for static and dynamic information networks. EDBT, 465\u2013476 (2010)","DOI":"10.1145\/1739041.1739098"},{"issue":"1","key":"536_CR20","first-page":"24","volume":"9","author":"Z Li","year":"2015","unstructured":"Li, Z., Fang, Y., Liu, Q., Cheng, J., Cheng, R., Lui, J.C.S.: Walking in the cloud: parallel SimRank at scale. PVLDB 9(1), 24\u201335 (2015)","journal-title":"PVLDB"},{"issue":"1\u20133","key":"536_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(99)00207-3","volume":"101","author":"X Lin","year":"2000","unstructured":"Lin, X.: On the computational complexity of edge concentration. Discrete Appl. Math. 101(1\u20133), 197\u2013205 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"536_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10115-011-0427-z","volume":"32","author":"Z Lin","year":"2012","unstructured":"Lin, Z., Lyu, M.R., King, I.: MatchSim: a novel similarity measure based on maximum neighborhood matching. Knowl. Inf. Syst. 32(1), 141\u2013166 (2012)","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"536_CR23","first-page":"14","volume":"11","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Zheng, B., He, X., Wei, Z., Xiao, X., Zheng, K., Lu, J.: ProbeSim: scalable single-source and top-\n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                   SimRank computations on dynamic graphs. PVLDB 11(1), 14\u201326 (2017)","journal-title":"PVLDB"},{"issue":"1","key":"536_CR24","first-page":"408","volume":"1","author":"D Lizorkin","year":"2008","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M.N., Turdakov, D.: Accuracy estimate and optimization techniques for SimRank computation. PVLDB 1(1), 408\u2013421 (2008)","journal-title":"PVLDB"},{"issue":"8","key":"536_CR25","first-page":"838","volume":"8","author":"Y Shao","year":"2015","unstructured":"Shao, Y., Cui, B., Chen, L., Liu, M., Xie, X.: An efficient similarity search framework for SimRank over large dynamic graphs. PVLDB 8(8), 838\u2013849 (2015)","journal-title":"PVLDB"},{"issue":"3","key":"536_CR26","first-page":"317","volume":"8","author":"W Tao","year":"2014","unstructured":"Tao, W., Yu, M., Li, G.: Efficient top-\n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                   SimRank-based similarity join. PVLDB 8(3), 317\u2013328 (2014)","journal-title":"PVLDB"},{"key":"536_CR27","doi-asserted-by":"crossref","unstructured":"Tian, B., Xiao, X.: SLING: a near-optimal index structure for SimRank. In: SIGMOD Conference, pp. 1859\u20131874 (2016)","DOI":"10.1145\/2882903.2915243"},{"key":"536_CR28","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Pan, J.-Y.: Fast random walk with restart and its applications. ICDM, 613\u2013622 (2006)","DOI":"10.1109\/ICDM.2006.70"},{"key":"536_CR29","doi-asserted-by":"crossref","unstructured":"Xi, W., Fox, E.A., Fan, W., Zhang, B., Chen, Z., Yan, J., Zhuang, D.: SimFusion: measuring similarity using unified relationship matrix. SIGIR, 130\u2013137 (2005)","DOI":"10.1145\/1076034.1076059"},{"key":"536_CR30","unstructured":"Yin, X., Han, J., Yu, P.S.: LinkClus: efficient clustering via heterogeneous semantic links. VLDB, 427\u2013438 (2006)"},{"key":"536_CR31","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W., Chang, L., Pei, J.: More is simpler: effectively and efficiently assessing node-pair similarities based on hyperlinks. PVLDB, 13\u201324 (2014)","DOI":"10.14778\/2732219.2732221"},{"issue":"7","key":"536_CR32","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1109\/TKDE.2014.2339828","volume":"27","author":"W Yu","year":"2015","unstructured":"Yu, W., Lin, X., Zhang, W., McCann, J.A.: Fast all-pairs SimRank assessment on large graphs and bipartite domains. IEEE Trans. Knowl. Data Eng. 27(7), 1810\u20131823 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"536_CR33","first-page":"569","volume":"8","author":"W Yu","year":"2015","unstructured":"Yu, W., McCann, J.A.: Efficient partial-pairs SimRank search for large networks. PVLDB 8(5), 569\u2013580 (2015)","journal-title":"PVLDB"},{"key":"536_CR34","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, J.A.: High quality graph-based similarity retrieval. SIGIR, 83\u201392 (2015)","DOI":"10.1145\/2766462.2767720"},{"issue":"5","key":"536_CR35","first-page":"601","volume":"10","author":"Z Zhang","year":"2017","unstructured":"Zhang, Z., Shao, Y., Cui, B., Zhang, C.: An experimental evaluation of SimRank-based similarity search algorithms. PVLDB 10(5), 601\u2013612 (2017)","journal-title":"PVLDB"},{"key":"536_CR36","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-Rank: a comprehensive structural similarity measure over information networks. CIKM, 553\u2013562 (2009)","DOI":"10.1145\/1645953.1646025"},{"issue":"7","key":"536_CR37","first-page":"493","volume":"6","author":"W Zheng","year":"2013","unstructured":"Zheng, W., Zou, L., Feng, Y., Chen, L., Zhao, D.: Efficient SimRank-based similarity join over large graphs. PVLDB 6(7), 493\u2013504 (2013)","journal-title":"PVLDB"},{"issue":"1","key":"536_CR38","first-page":"718","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. PVLDB 2(1), 718\u2013729 (2009)","journal-title":"PVLDB"},{"key":"536_CR39","doi-asserted-by":"crossref","unstructured":"Zhu, R., Zou, Z., Li, J.: SimRank computation on uncertain graphs. ICDE, 565\u2013576 (2016)","DOI":"10.1109\/ICDE.2016.7498271"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0536-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-018-0536-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0536-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T19:08:32Z","timestamp":1578683312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-018-0536-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,11]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["536"],"URL":"https:\/\/doi.org\/10.1007\/s00778-018-0536-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,11]]},"assertion":[{"value":"25 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}