{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:11:05Z","timestamp":1751602265690,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":30,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186126","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"599-608","source":"Crossref","is-referenced-by-count":11,"title":["Fast Exact CoSimRank Search on Evolving and Static Graphs"],"prefix":"10.1145","author":[{"given":"Weiren","family":"Yu","sequence":"first","affiliation":[{"name":"Aston University, Birmingham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Wang","sequence":"additional","affiliation":[{"name":"Aston University, Birmingham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186126-1","doi-asserted-by":"crossref","unstructured":"Leman Akoglu and Christos Faloutsos. 2009. RTG: a recursive realistic graph generator using random typing. Data Min. Knowl. Discov. 19, 2 (2009), 194--209. https:\/\/doi.org\/10.1007\/s10618-009-0140--7","DOI":"10.1007\/s10618-009-0140-7"},{"key":"key-10.1145\/3178876.3186126-2","doi-asserted-by":"crossref","unstructured":"Ioannis Antonellis, Hector Garcia-Molina, and Chi-Chao Chang. 2008. SimRank++: Query rewriting through link analysis of the click graph. In WWW. 1177--1178. https:\/\/doi.org\/10.1145\/1367497.1367714","DOI":"10.1145\/1367497.1367714"},{"key":"key-10.1145\/3178876.3186126-3","doi-asserted-by":"crossref","unstructured":"Bahman Bahmani, Abdur Chowdhury, and Ashish Goel. 2010. Fast Incremental and Personalized PageRank. PVLDB 4, 3 (2010).","DOI":"10.14778\/1929861.1929864"},{"key":"key-10.1145\/3178876.3186126-4","doi-asserted-by":"crossref","unstructured":"Orkut Buyukkokten, Hector Garcia-Molina, and Andreas Paepcke. 2001. Seeing the whole in parts: Text summarization for web browsing on handheld devices. In WWW. 652--662. https:\/\/doi.org\/10.1145\/371920.372178","DOI":"10.1145\/371920.372178"},{"key":"key-10.1145\/3178876.3186126-5","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri, Venkatesh Ganti, and Dong Xin. 2009. Exploiting web search to generate synonyms for entities. In WWW. 151--160. https:\/\/doi.org\/10.1145\/1526709.1526731","DOI":"10.1145\/1526709.1526731"},{"key":"key-10.1145\/3178876.3186126-6","doi-asserted-by":"crossref","unstructured":"D&#180;aniel Fogaras and Bal&#180;azs R&#180;acz. 2005. Scaling link-based similarity search. In WWW. 641--650. https:\/\/doi.org\/10.1145\/1060745.1060839","DOI":"10.1145\/1060745.1060839"},{"key":"key-10.1145\/3178876.3186126-7","doi-asserted-by":"crossref","unstructured":"Yasuhiro Fujiwara, Makoto Nakatsuji, Hiroaki Shiokawa, and Makoto Onizuka. 2013. Efficient search algorithm for SimRank. In ICDE. 589--600. https:\/\/doi.org\/10.1109\/ICDE.2013.6544858","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"key-10.1145\/3178876.3186126-8","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2002. SimRank: A measure of structural-context similarity. In SIGKDD. 538--543. https:\/\/doi.org\/10.1145\/775047.775126","DOI":"10.1145\/775047.775126"},{"key":"key-10.1145\/3178876.3186126-9","doi-asserted-by":"crossref","unstructured":"Minhao Jiang, Ada Wai-Chee Fu, Raymond Chi-Wing Wong, and Ke Wang. 2017. READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank. PVLDB 10, 9 (2017), 937--948. http:\/\/www.vldb.org\/pvldb\/vol10\/p937-jiang.pdf","DOI":"10.14778\/3099622.3099625"},{"key":"key-10.1145\/3178876.3186126-10","doi-asserted-by":"crossref","unstructured":"Mitsuru Kusumoto, Takanori Maehara, and Ken-ichi Kawarabayashi. 2014. Scalable similarity search for SimRank. In SIGMOD. 325--336. https:\/\/doi.org\/10.1145\/2588555.2610526","DOI":"10.1145\/2588555.2610526"},{"key":"key-10.1145\/3178876.3186126-11","unstructured":"Florian Laws, Lukas Michelbacher, Beate Dorow, Christian Scheible, Ulrich Heid, and Hinrich Sch&#168;utze. 2010. A Linguistically Grounded Graph Model for Bilingual Lexicon Extraction. In COLING. 614--622. http:\/\/aclweb.org\/anthology\/C\/C10\/C10--2070.pdf"},{"key":"key-10.1145\/3178876.3186126-12","doi-asserted-by":"crossref","unstructured":"Jure Leskovec, Jon M. Kleinberg, and Christos Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. TKDD 1, 1 (2007), 2. https:\/\/doi.org\/10.1145\/1217299.1217301","DOI":"10.1145\/1217299.1217301"},{"key":"key-10.1145\/3178876.3186126-13","doi-asserted-by":"crossref","unstructured":"Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizhou Sun, Yintao Yu, and Tianyi Wu. 2010. Fast computation of SimRank for static and dynamic information networks. In EDBT. 465--476. https:\/\/doi.org\/10.1145\/1739041.1739098","DOI":"10.1145\/1739041.1739098"},{"key":"key-10.1145\/3178876.3186126-14","doi-asserted-by":"crossref","unstructured":"Zhenjiang Lin, Michael R. Lyu, and Irwin King. 2006. PageSim: A novel link-based measure of web page similarity. In WWW. 1019--1020. https:\/\/doi.org\/10.1145\/1135777.1135994","DOI":"10.1145\/1135777.1135994"},{"key":"key-10.1145\/3178876.3186126-15","doi-asserted-by":"crossref","unstructured":"Dmitry Lizorkin, Pavel Velikhov, Maxim N. Grinev, and Denis Turdakov. 2010. Accuracy estimate and optimization techniques for SimRank computation. VLDB J. 19, 1 (2010), 45--66. https:\/\/doi.org\/10.1007\/s00778-009-0168--8","DOI":"10.1007\/s00778-009-0168-8"},{"key":"key-10.1145\/3178876.3186126-16","doi-asserted-by":"crossref","unstructured":"Phuong Nguyen, Paolo Tomeo, Tommaso Di Noia, and Eugenio Di Sciascio. 2015. An evaluation of SimRank and Personalized PageRank to build a recommender system for the Web of Data. In WWW. 1477--1482. https:\/\/doi.org\/10.1145\/2740908.2742141","DOI":"10.1145\/2740908.2742141"},{"key":"key-10.1145\/3178876.3186126-17","doi-asserted-by":"crossref","unstructured":"Alexandros Ntoulas, Junghoo Cho, and Christopher Olston. 2004. What's new on the web? The evolution of the web from a search engine perspective. In WWW. 1--12. https:\/\/doi.org\/10.1145\/988672.988674","DOI":"10.1145\/988672.988674"},{"key":"key-10.1145\/3178876.3186126-18","unstructured":"Sascha Rothe and Hinrich Sch&#168;utze. 2014. CoSimRank: A Flexible &#38; Efficient Graph-Theoretic Similarity Measure. In ACL. 1392-- 1402. http:\/\/aclweb.org\/anthology\/P\/P14\/P14--1131.pdf"},{"key":"key-10.1145\/3178876.3186126-19","doi-asserted-by":"crossref","unstructured":"Tam&#180;as Sarl&#180;os, Andr&#180;as A. Bencz&#180;ur, K&#180;aroly Csalog&#180;any, D&#180;aniel Fogaras, and Bal&#180;azs R&#180;acz. 2006. To randomize or not to randomize: Space optimal summaries for hyperlink analysis. In WWW. 297-- 306. https:\/\/doi.org\/10.1145\/1135777.1135823","DOI":"10.1145\/1135777.1135823"},{"key":"key-10.1145\/3178876.3186126-20","doi-asserted-by":"crossref","unstructured":"Yingxia Shao, Bin Cui, Lei Chen, Mingming Liu, and Xing Xie. 2015. An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs. PVLDB 8, 8 (2015), 838--849. http:\/\/www.vldb.org\/pvldb\/vol8\/p838-shao.pdf","DOI":"10.14778\/2757807.2757809"},{"key":"key-10.1145\/3178876.3186126-21","doi-asserted-by":"crossref","unstructured":"Yizhou Sun, Jiawei Han, Xifeng Yan, Philip S. Yu, and Tianyi Wu. 2011. PathSim: Meta path-based top-K similarity search in heterogeneous information networks. PVLDB 4, 11 (2011), 992--1003. http:\/\/www.vldb.org\/pvldb\/vol4\/p992-sun.pdf","DOI":"10.14778\/3402707.3402736"},{"key":"key-10.1145\/3178876.3186126-22","unstructured":"Akihiro Tamura, Taro Watanabe, and Eiichiro Sumita. 2012. Bilingual Lexicon Extraction from Comparable Corpora Using Label Propagation. In EMNLP-CoNLL. 24--36. http:\/\/www.aclweb.org\/anthology\/D12--1003"},{"key":"key-10.1145\/3178876.3186126-23","doi-asserted-by":"crossref","unstructured":"Boyu Tian and Xiaokui Xiao. 2016. SLING: A NearOptimal Index Structure for SimRank. In SIGMOD. 1859--1874. https:\/\/doi.org\/10.1145\/2882903.2915243","DOI":"10.1145\/2882903.2915243"},{"key":"key-10.1145\/3178876.3186126-24","unstructured":"Yining Wang, Liwei Wang, Yuanzhi Li, Di He, and Tie-Yan Liu. 2013. A Theoretical Analysis of NDCG Type Ranking Measures. In COLT. 25--54. http:\/\/jmlr.org\/proceedings\/papers\/v30\/Wang13.html"},{"key":"key-10.1145\/3178876.3186126-25","doi-asserted-by":"crossref","unstructured":"Weiren Yu, Xuemin Lin, and Wenjie Zhang. 2014. Fast incremental SimRank on link-evolving graphs. In ICDE. 304--315. https:\/\/doi.org\/10.1109\/ICDE.2014.6816660","DOI":"10.1109\/ICDE.2014.6816660"},{"key":"key-10.1145\/3178876.3186126-26","doi-asserted-by":"crossref","unstructured":"Weiren Yu, Xuemin Lin, Wenjie Zhang, and Julie A. McCann. 2018. Dynamical SimRank search on timevarying networks. VLDB J. 27, 1 (2018), 79--104. https:\/\/doi.org\/10.1007\/s00778-017-0488-z","DOI":"10.1007\/s00778-017-0488-z"},{"key":"key-10.1145\/3178876.3186126-27","doi-asserted-by":"crossref","unstructured":"Weiren Yu and Julie A. McCann. 2015. Co-Simmate: Quick Retrieving All Pairwise Co-Simrank Scores. In ACL. 327--333. http:\/\/aclweb.org\/anthology\/P\/P15\/P15--2054.pdf","DOI":"10.3115\/v1\/P15-2054"},{"key":"key-10.1145\/3178876.3186126-28","doi-asserted-by":"crossref","unstructured":"Weiren Yu and Julie A. McCann. 2016. Random Walk with Restart over Dynamic Graphs. In ICDM. 589--598. https:\/\/doi.org\/10.1109\/ICDM.2016.0070","DOI":"10.1109\/ICDM.2016.0070"},{"key":"key-10.1145\/3178876.3186126-29","doi-asserted-by":"crossref","unstructured":"Weiren Yu, Wenjie Zhang, Xuemin Lin, Qing Zhang, and Jiajin Le. 2012. A space and time efficient algorithm for SimRank computation. World Wide Web 15, 3 (2012), 327--353. https:\/\/doi.org\/10.1007\/s11280-010-0100--6","DOI":"10.1007\/s11280-010-0100-6"},{"key":"key-10.1145\/3178876.3186126-30","doi-asserted-by":"crossref","unstructured":"Peixiang Zhao, Jiawei Han, and Yizhou Sun. 2009. P-Rank: A comprehensive structural similarity measure over information networks. In CIKM. 553--562. https:\/\/doi.org\/10.1145\/1645953.1646025","DOI":"10.1145\/1645953.1646025"}],"event":{"number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '18","name":"the 2018 World Wide Web Conference","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186126","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186126&ftid=1957533&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:25:46Z","timestamp":1751563546000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186126"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186126","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}