{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:56:43Z","timestamp":1760709403320},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,5]]},"abstract":"<jats:p>Similarity among entities in graphs plays a key role in data analysis and mining. SimRank is a widely used and popular measurement to evaluate the similarity among the vertices. In real-life applications, graphs do not only grow in size, requiring fast and precise SimRank computation for large graphs, but also change and evolve continuously over time, demanding an efficient maintenance process to handle dynamic updates. In this paper, we propose a random walk based indexing scheme to compute SimRank efficiently and accurately over large dynamic graphs. We show that our algorithm outperforms the state-of-the-art static and dynamic SimRank algorithms.<\/jats:p>","DOI":"10.14778\/3099622.3099625","type":"journal-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T13:35:53Z","timestamp":1504791353000},"page":"937-948","source":"Crossref","is-referenced-by-count":36,"title":["READS"],"prefix":"10.14778","volume":"10","author":[{"given":"Minhao","family":"Jiang","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology"}]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}]},{"given":"Raymond Chi-Wing","family":"Wong","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology"}]}],"member":"320","published-online":{"date-parts":[[2017,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00528-2_8"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453903"},{"key":"e_1_2_1_3_1","volume-title":"AIRWeb","author":"Benczur A.","year":"2006","unstructured":"A. Benczur , K. Csalogany , and T. Sarlos . Link-based similarity search to fight web spam . In AIRWeb , 2006 . A. Benczur, K. Csalogany, and T. Sarlos. Link-based similarity search to fight web spam. In AIRWeb, 2006."},{"key":"e_1_2_1_4_1","volume-title":"The theory of probabilities","author":"Bernstein S.","year":"1946","unstructured":"S. Bernstein . The theory of probabilities . Gastehizdat Publishing House , Moscow , 1946 . S. Bernstein. The theory of probabilities. Gastehizdat Publishing House, Moscow, 1946."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060839"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835874"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020561"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610526"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.109"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739098"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0168-8"},{"key":"e_1_2_1_16_1","volume-title":"CoRR abs\/1411.7228","author":"Maehara T.","year":"2014","unstructured":"T. Maehara , M. Kusumoto , and K. Kawarabayashi . Efficient simrank computation via linearization . In CoRR abs\/1411.7228 , 2014 . T. Maehara, M. Kusumoto, and K. Kawarabayashi. Efficient simrank computation via linearization. In CoRR abs\/1411.7228, 2014."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113318"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1984806"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742141"},{"key":"e_1_2_1_20_1","volume-title":"In Proceedings of the 23rd International Conference on Computational Linguistics: COLING","author":"Scheible C.","year":"2010","unstructured":"C. Scheible , F. Laws , L. Michelbacher , and H. Schutze . Sentiment translation through multi-edge graphs . In In Proceedings of the 23rd International Conference on Computational Linguistics: COLING , 2010 . C. Scheible, F. Laws, L. Michelbacher, and H. Schutze. Sentiment translation through multi-edge graphs. In In Proceedings of the 23rd International Conference on Computational Linguistics: COLING, 2010."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2757807.2757809"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735520"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915243"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816660"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732221"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735489"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767720"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-010-0100-6"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055552"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536349.2536350"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3099622.3099625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:58:15Z","timestamp":1672225095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3099622.3099625"}},"subtitle":["a random walk approach for efficient and accurate dynamic SimRank"],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["10.14778\/3099622.3099625"],"URL":"https:\/\/doi.org\/10.14778\/3099622.3099625","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,5]]}}}