{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:12:07Z","timestamp":1742994727465,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306747"},{"type":"electronic","value":"9783031306754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30675-4_17","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T10:02:24Z","timestamp":1681466544000},"page":"252-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchical All-Pairs SimRank Calculation"],"prefix":"10.1007","author":[{"given":"Liangfu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Cuiping","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xue","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Abbassi, Z., Mirrokni, V.S.: A recommender system based on local random walks and spectral methods. In: WebKDD, pp. 102\u2013108. ACM (2007)","DOI":"10.1145\/1348549.1348561"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Fogaras, D., R\u00e1cz, B.: Scaling link-based similarity search. In: Proceedings of the 14th International Conference on World Wide Web, pp. 641\u2013650 (2005)","DOI":"10.1145\/1060745.1060839"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Onizuka, M.: Efficient search algorithm for simrank. In: ICDE 2013, Brisbane, Australia, 8\u201312 April 2013, pp. 589\u2013600 (2013)","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"He, G., Feng, H., Li, C., Chen, H.: Parallel SimRank computation on large graphs with iterative aggregation. In: SIGKDD, Washington, DC, USA, 25\u201328 July 2010, pp. 543\u2013552 (2010)","DOI":"10.1145\/1835804.1835874"},{"issue":"9","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1109\/TKDE.2011.91","volume":"24","author":"G He","year":"2012","unstructured":"He, G., Li, C., Chen, H., Du, X., Feng, H.: Using graphics processors for high performance SimRank computation. IEEE Trans. Knowl. Data Eng. 24(9), 1711\u20131725 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD, 23\u201326 July 2002, Edmonton, Alberta, Canada, pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"issue":"9","key":"17_CR7","first-page":"937","volume":"10","author":"M Jiang","year":"2017","unstructured":"Jiang, M., Fu, A.W.C., Wong, R.C.W.: Reads: a random walk approach for efficient and accurate dynamic SimRank. PVLDB 10(9), 937\u2013948 (2017)","journal-title":"PVLDB"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Jin, R., Lee, V.E., Hong, H.: Axiomatic ranking of network role similarity. In: Proceedings of the 17th ACM SIGKDD, pp. 922\u2013930. ACM (2011)","DOI":"10.1145\/2020408.2020561"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Li, C., et al.: Fast computation of SimRank for static and dynamic information networks. In: EDBT 2010, 13th International Conference on Extending Database Technology, Lausanne, Switzerland, 22\u201326 March 2010, Proceedings, pp. 465\u2013476 (2010)","DOI":"10.1145\/1739041.1739098"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10115-011-0427-z","volume":"32","author":"Z Lin","year":"2012","unstructured":"Lin, Z., Lyu, M.R., King, I.: MatchSim: a novel similarity measure based on maximum neighborhood matching. Knowl. Inf. Syst. 32(1), 141\u2013166 (2012)","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.14778\/3151113.3151115","volume":"11","author":"Y Liu","year":"2017","unstructured":"Liu, Y., et al.: ProbeSim: scalable single-source and top-k SimRank computations on dynamic graphs. Proceed. VLDB Endow. 11(1), 14\u201326 (2017)","journal-title":"Proceed. VLDB Endow."},{"issue":"1","key":"17_CR12","first-page":"422","volume":"1","author":"D Lizorkin","year":"2008","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M.N., Turdakov, D.: Accuracy estimate and optimization techniques for SimRank computation. PVLDB 1(1), 422\u2013433 (2008)","journal-title":"PVLDB"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00778-009-0168-8","volume":"19","author":"D Lizorkin","year":"2010","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M.N., Turdakov, D.: Accuracy estimate and optimization techniques for SimRank computation. VLDB J. 19(1), 45\u201366 (2010)","journal-title":"VLDB J."},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TKDE.2016.2626282","volume":"29","author":"J Lu","year":"2017","unstructured":"Lu, J., Gong, Z., Lin, X.: A novel and fast SimRank algorithm. IEEE Trans. Knowl. Data Eng. 29(3), 572\u2013585 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Luo, X., Gao, J., Zhou, C., Yu, J.X.: UniWalk: unidirectional random walk based scalable SimRank computation over large graph. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 325\u2013336. IEEE (2017)","DOI":"10.1109\/ICDE.2017.92"},{"issue":"8","key":"17_CR16","doi-asserted-by":"publisher","first-page":"838","DOI":"10.14778\/2757807.2757809","volume":"8","author":"Y Shao","year":"2015","unstructured":"Shao, Y., Cui, B., Chen, L., Liu, M., Xie, X.: An efficient similarity search framework for SimRank over large dynamic graphs. Proceed. VLDB Endow. 8(8), 838\u2013849 (2015)","journal-title":"Proceed. VLDB Endow."},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2207243.2207252","volume":"13","author":"N Spirin","year":"2012","unstructured":"Spirin, N., Han, J.: Survey on web spam detection: principles and algorithms. ACM SIGKDD Explorations Newsl 13(2), 50\u201364 (2012)","journal-title":"ACM SIGKDD Explorations Newsl"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Tian, B., Xiao, X.: SLING: a near-optimal index structure for SimRank. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, 26 June - 01 July 2016, pp. 1859\u20131874 (2016)","DOI":"10.1145\/2882903.2915243"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Wang, Y., Lian, X., Chen, L.: Efficient SimRank tracking in dynamic graphs. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 545\u2013556. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00056"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Wei, Z., et al.: PRSim: Sublinear time SimRank computation on large power-law graphs. In: Proceedings of the 2019 International Conference on Management of Data, pp. 1042\u20131059 (2019)","DOI":"10.1145\/3299869.3319873"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Le, J.: A space and time efficient algorithm for SimRank computation. In: Advances in Web Technologies and Applications, Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010, Busan, Korea, 6\u20138 April 2010, pp. 164\u2013170 (2010)","DOI":"10.1109\/APWeb.2010.42"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W.: Towards efficient SimRank computation on large networks. In: 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, 8\u201312 April 2013, pp. 601\u2013612 (2013)","DOI":"10.1109\/ICDE.2013.6544859"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W.: Fast incremental SimRank on link-evolving graphs. In: IEEE 30th International Conference on Data Engineering, Chicago, ICDE 2014, IL, USA, 31 March - 4 April 2014, pp. 304\u2013315 (2014)","DOI":"10.1109\/ICDE.2014.6816660"},{"issue":"1","key":"17_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00778-017-0488-z","volume":"27","author":"W Yu","year":"2018","unstructured":"Yu, W., Lin, X., Zhang, W., McCann, J.A.: Dynamical SimRank search on time-varying networks. VLDB J.-Int. J. Very Large Data Bases 27(1), 79\u2013104 (2018)","journal-title":"VLDB J.-Int. J. Very Large Data Bases"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, J.A.: Sig-SR: SimRank search over singular graphs. In: The 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2014, Gold Coast, QLD, Australia, 06-11 July 2014, pp. 859\u2013862 (2014)","DOI":"10.1145\/2600428.2609459"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, J.A.: High quality graph-based similarity search. In: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, Santiago, Chile, 9\u201313 August 2015, pp. 83\u201392 (2015)","DOI":"10.1145\/2766462.2767720"},{"issue":"3","key":"17_CR27","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s11280-010-0100-6","volume":"15","author":"W Yu","year":"2012","unstructured":"Yu, W., Zhang, W., Lin, X., Zhang, Q., Le, J.: A space and time efficient algorithm for SimRank computation. World Wide Web 15(3), 327\u2013353 (2012)","journal-title":"World Wide Web"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-37450-0_2","volume-title":"Database Systems for Advanced Applications","author":"Y Zhang","year":"2013","unstructured":"Zhang, Y., Li, C., Chen, H., Sheng, L.: Fast SimRank computation over disk-resident graphs. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds.) DASFAA 2013. LNCS, vol. 7826, pp. 16\u201330. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37450-0_2"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30675-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T08:45:19Z","timestamp":1729241119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30675-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306747","9783031306754"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30675-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}