{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T15:58:20Z","timestamp":1774195100886,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T00:00:00Z","timestamp":1403049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ERATO"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,18]]},"DOI":"10.1145\/2588555.2610526","type":"proceedings-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T13:06:05Z","timestamp":1403269565000},"page":"325-336","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":74,"title":["Scalable similarity search for SimRank"],"prefix":"10.1145","author":[{"given":"Mitsuru","family":"Kusumoto","sequence":"first","affiliation":[{"name":"Preferred Infrastructure, Inc, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takanori","family":"Maehara","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00528-2_8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/43601"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453903"},{"key":"e_1_3_2_1_4_1","first-page":"9","volume-title":"AIRWeb","author":"Benczur A. A.","year":"2006","unstructured":"A. A. Benczur , K. Csalogany , and T. Sarlos . Link-based similarity search to fight web spam . In AIRWeb , pages 9 -- 16 , 2006 . A. A. Benczur, K. Csalogany, and T. Sarlos. Link-based similarity search to fight web spam. In AIRWeb, pages 9--16, 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.136"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2351316.2351321"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060839"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"e_1_3_2_1_11_1","first-page":"576","volume-title":"VLDB","author":"Gyongyi Z.","year":"2004","unstructured":"Z. Gyongyi , H. Garcia-Molina , and J. O. Pedersen . Combating web spam with TrustRank . In VLDB , pages 576 -- 587 . Morgan Kaufmann , 2004 . Z. Gyongyi, H. Garcia-Molina, and J. O. Pedersen. Combating web spam with TrustRank. In VLDB, pages 576--587. Morgan Kaufmann, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835874"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03348-3_19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1927585.1927592"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0271(63)90016-0"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google's PageRank and beyond: The science of search engine rankings","author":"Langville A. N.","year":"2006","unstructured":"A. N. Langville and C. D. Meyer . Google's PageRank and beyond: The science of search engine rankings . Princeton University Press , 2006 . A. N. Langville and C. D. Meyer. Google's PageRank and beyond: The science of search engine rankings. Princeton University Press, 2006."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739098"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01307-2_36"},{"key":"e_1_3_2_1_21_1","first-page":"571","volume-title":"SDM","author":"Li P.","year":"2010","unstructured":"P. Li , H. Liu , J. X. Yu , J. He , and X. Du . Fast single-pair simrank computation . In SDM , pages 571 -- 582 . SIAM , 2010 . P. Li, H. Liu, J. X. Yu, J. He, and X. Du. Fast single-pair simrank computation. In SDM, pages 571--582. SIAM, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.127"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2007.54"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-011-0427-z"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0168-8"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_29_1","first-page":"25","volume-title":"ACL (Student Research Workshop)","author":"Scheible C.","year":"2010","unstructured":"C. Scheible . Sentiment translation through lexicon induction . In ACL (Student Research Workshop) , pages 25 -- 30 . The Association for Computer Linguistics , 2010 . C. Scheible. Sentiment translation through lexicon induction. In ACL (Student Research Workshop), pages 25--30. The Association for Computer Linguistics, 2010."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630240406"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_1_33_1","first-page":"427","volume-title":"VLDB","author":"Yin X.","year":"2006","unstructured":"X. Yin , J. Han , and P. S. Yu . LinkClus: Efficient clustering via heterogeneous semantic links . In VLDB , pages 427 -- 438 . ACM, 2006 . X. Yin, J. Han, and P. S. Yu. LinkClus: Efficient clustering via heterogeneous semantic links. In VLDB, pages 427--438. ACM, 2006."},{"key":"e_1_3_2_1_34_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-642-17313-4_17","volume-title":"ADMA (2)","author":"Yu L.","year":"2010","unstructured":"L. Yu , Z. Shu , and X. Yang . SimRate: Improve collaborative recommendation based on rating graph for sparsity . In ADMA (2) , volume 6441 of Lecture Notes in Computer Science , pages 167 -- 174 . Springer , 2010 . L. Yu, Z. Shu, and X. Yang. SimRate: Improve collaborative recommendation based on rating graph for sparsity. In ADMA (2), volume 6441 of Lecture Notes in Computer Science, pages 167--174. Springer, 2010."},{"key":"e_1_3_2_1_35_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-642-14246-8_29","volume-title":"WAIM","author":"Yu W.","year":"2010","unstructured":"W. Yu , X. Lin , and J. Le . Taming computational complexity: Efficient and parallel SimRank optimizations on undirected graphs . In WAIM , volume 6184 of Lecture Notes in Computer Science , pages 280 -- 296 . Springer , 2010 . W. Yu, X. Lin, and J. Le. Taming computational complexity: Efficient and parallel SimRank optimizations on undirected graphs. In WAIM, volume 6184 of Lecture Notes in Computer Science, pages 280--296. Springer, 2010."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732221"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-010-0100-6"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646025"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536349.2536350"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"}],"event":{"name":"SIGMOD\/PODS'14: International Conference on Management of Data","location":"Snowbird Utah USA","acronym":"SIGMOD\/PODS'14","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2588555.2610526","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2588555.2610526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:49Z","timestamp":1750230049000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2588555.2610526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,18]]},"references-count":40,"alternative-id":["10.1145\/2588555.2610526","10.1145\/2588555"],"URL":"https:\/\/doi.org\/10.1145\/2588555.2610526","relation":{},"subject":[],"published":{"date-parts":[[2014,6,18]]},"assertion":[{"value":"2014-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}