{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:19Z","timestamp":1779174799016,"version":"3.51.4"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["NSFC61232006"],"award-info":[{"award-number":["NSFC61232006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["NSFC61021004"],"award-info":[{"award-number":["NSFC61021004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["DP140103578"],"award-info":[{"award-number":["DP140103578"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["DP120104168"],"award-info":[{"award-number":["DP120104168"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["DE120102144"],"award-info":[{"award-number":["DE120102144"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["DP120104168"],"award-info":[{"award-number":["DP120104168"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tkde.2014.2339828","type":"journal-article","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T19:55:01Z","timestamp":1405540501000},"page":"1810-1823","source":"Crossref","is-referenced-by-count":16,"title":["Fast All-Pairs SimRank Assessment on Large Graphs and Bipartite Domains"],"prefix":"10.1109","volume":"27","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":"Julie A.","family":"McCann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Approximation of the Lambert $W$ function","volume":"8","author":"hassani","year":"2005","journal-title":"RGMIA Res Rep Collection"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835874"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150476"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.109"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739098"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.50"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00207-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0168-8"},{"key":"ref19","first-page":"601","article-title":"Towards efficient SimRank computation on large networks","author":"yu","year":"0","journal-title":"Proc IEEE 29th Int Conf Data Eng"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129098"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060839"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988676"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579168"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971392"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"408","DOI":"10.14778\/1453856.1453903","article-title":"SimRank++: Query rewriting through link analysis of the click graph","volume":"1","author":"antonellis","year":"0","journal-title":"Proc VLDB Endowment"},{"key":"ref9","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7116676\/06857337.pdf?arnumber=6857337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:05:09Z","timestamp":1642003509000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6857337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":19,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2339828","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}