{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:40:28Z","timestamp":1758271228399,"version":"3.40.4"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/icde.2014.6816660","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:28:25Z","timestamp":1401474505000},"page":"304-315","source":"Crossref","is-referenced-by-count":33,"title":["Fast incremental SimRank on link-evolving graphs"],"prefix":"10.1109","author":[{"given":"Weiren","family":"Yu","sequence":"first","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544859"},{"key":"17","article-title":"PathSim: Meta path-based top-k similarity search in heterogeneous information networks","volume":"4","author":"sun","year":"2011","journal-title":"PVLDB"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484114"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988674"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970397"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.50"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0168-8"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.109"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739098"},{"key":"21","doi-asserted-by":"crossref","DOI":"10.1145\/2348283.2348334","article-title":"SimFusion+: Extending simfusion towards efficient estimation on large and dynamic networks","author":"yu","year":"2012","journal-title":"SIGIR"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129098"},{"key":"20","article-title":"More is simpler: Effectively and efficiently assessing node-pair similarities based on hyperlinks","author":"yu","year":"2014","journal-title":"PVLDB"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929864"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453903"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1145\/775047.775126","article-title":"SimRank: A measure of structural-context similarity","author":"jeh","year":"2002","journal-title":"KDD"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140441"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1008"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1145\/1062745.1062885","article-title":"Incremental pagerank computation on evolving graphs","author":"desikan","year":"2005","journal-title":"WWW"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835874"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644931"}],"event":{"name":"2014 IEEE 30th International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2014,3,31]]},"location":"Chicago, IL, USA","end":{"date-parts":[[2014,4,4]]}},"container-title":["2014 IEEE 30th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6811095\/6816620\/06816660.pdf?arnumber=6816660","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:27:58Z","timestamp":1746250078000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6816660\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/icde.2014.6816660","relation":{},"subject":[],"published":{"date-parts":[[2014,3]]}}}