{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:17:24Z","timestamp":1742995044172,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030611323"},{"type":"electronic","value":"9783030611330"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61133-0_3","type":"book-chapter","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T10:04:54Z","timestamp":1604570694000},"page":"33-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Axiomatic Role Similarity Measure Based on Graph Topology"],"prefix":"10.1007","author":[{"given":"Weiren","family":"Yu","sequence":"first","affiliation":[]},{"given":"Sima","family":"Iranmanesh","sequence":"additional","affiliation":[]},{"given":"Aparajita","family":"Haldar","sequence":"additional","affiliation":[]},{"given":"Maoyin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hakan","family":"Ferhatosmanoglu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Antonellis, I., Garcia-Molina, H., Chang, C.-C.: SimRank++: query rewriting through link analysis of the click graph. In: PVLDB, vol. 1, no. 1 (2008)","DOI":"10.14778\/1453856.1453903"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2776894","volume":"10","author":"H Chen","year":"2015","unstructured":"Chen, H., Giles, C.L.: ASCOS++: an asymmetric similarity measure for weighted networks to address the problem of SimRank. ACM Trans. Knowl. Discov. Data 10(2), 15:1\u201315:26 (2015)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Lai, L., Qin, L., Lin, X.: StructSim: querying structural node similarity at billion scale. In: ICDE, pp. 1950\u20131953 (2020)","DOI":"10.1109\/ICDE48307.2020.00211"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Onizuka, M.: Efficient search algorithm for SimRank. In: ICDE, pp. 589\u2013600 (2013)","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"He, G., Feng, H., Li, C., Chen, H.: Parallel SimRank computation on large graphs with iterative aggregation. In: KDD (2010)","DOI":"10.1145\/1835804.1835874"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.is.2013.12.008","volume":"42","author":"J He","year":"2014","unstructured":"He, J., Liu, H., Yu, J.X., Li, P., He, W., Du, X.: Assessing single-pair similarity over graphs by aggregating first-meeting probabilities. Inf. Syst. 42, 107\u2013122 (2014)","journal-title":"Inf. Syst."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In: KDD, pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"issue":"9","key":"3_CR8","first-page":"937","volume":"10","author":"M Jiang","year":"2017","unstructured":"Jiang, M., Fu, A.W., Wong, R.C., Wang, K.: READS: a random walk approach for efficient and accurate dynamic SimRank. PVLDB 10(9), 937\u2013948 (2017)","journal-title":"PVLDB"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Jin, R., Lee, V.E., Hong, H.: Axiomatic ranking of network role similarity. In: Apt\u00e9, C., Ghosh, J., Smyth, P. (eds.) Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, 21\u201324 August 2011, pp. 922\u2013930. ACM (2011)","DOI":"10.1145\/2020408.2020561"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2518176","volume":"8","author":"R Jin","year":"2014","unstructured":"Jin, R., Lee, V.E., Li, L.: Scalable and axiomatic ranking of network role similarity. TKDD 8(1), 3:1\u20133:37 (2014)","journal-title":"TKDD"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Kusumoto, M., Maehara, T., Kawarabayashi, K.: Scalable similarity search for SimRank. In: SIGMOD, pp. 325\u2013336 (2014)","DOI":"10.1145\/2588555.2610526"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Li, C., et al.: Fast computation of SimRank for static and dynamic information networks. In: EDBT (2010)","DOI":"10.1145\/1739041.1739098"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-21042-1_10","volume-title":"Web-Age Information Management","author":"L Li","year":"2015","unstructured":"Li, L., Qian, L., Lee, V.E., Leng, M., Chen, M., Chen, X.: Fast and accurate computation of role similarity via vertex centrality. In: Dong, X.L., Yu, X., Li, J., Sun, Y. (eds.) WAIM 2015. LNCS, vol. 9098, pp. 123\u2013134. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21042-1_10"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Li, P., Liu, H., Yu, J.X., He, J., Du, X.: Fast single-pair simrank computation. In: Proceedings of the SIAM International Conference on Data Mining, SDM 2010, Columbus, Ohio, USA, 29 April\u20131 May, pp. 571\u2013582. SIAM (2010)","DOI":"10.1137\/1.9781611972801.50"},{"issue":"1","key":"3_CR15","first-page":"24","volume":"9","author":"Z Li","year":"2015","unstructured":"Li, Z., Fang, Y., Liu, Q., Cheng, J., Cheng, R., Lui, J.C.S.: Walking in the cloud: parallel SimRank at scale. PVLDB 9(1), 24\u201335 (2015)","journal-title":"PVLDB"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1326561.1326565","volume":"2","author":"Y Lin","year":"2008","unstructured":"Lin, Y., Sundaram, H., Chi, Y., Tatemura, J., Tseng, B.L.: Detecting splogs via temporal dynamics using self-similarity analysis. TWEB 2(1), 4:1\u20134:35 (2008)","journal-title":"TWEB"},{"issue":"1","key":"3_CR17","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). https:\/\/doi.org\/10.1007\/s10115-011-0427-z","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"3_CR18","first-page":"14","volume":"11","author":"Y Liu","year":"2017","unstructured":"Liu, Y., et al.: ProbeSim: scalable single-source and top-k SimRank computations on dynamic graphs. PVLDB 11(1), 14\u201326 (2017)","journal-title":"PVLDB"},{"issue":"1","key":"3_CR19","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). https:\/\/doi.org\/10.1007\/s00778-009-0168-8","journal-title":"VLDB J."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Maehara, T., Kusumoto, M., Kawarabayashi, K.: Scalable simrank join algorithm. In: ICDE, pp. 603\u2013614 (2015)","DOI":"10.1109\/ICDE.2015.7113318"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Rothe, S., Sch\u00fctze, H.: CoSimRank: a flexible & efficient graph-theoretic similarity measure. In: ACL, pp. 1392\u20131402. The Association for Computer Linguistics (2014)","DOI":"10.3115\/v1\/P14-1131"},{"issue":"8","key":"3_CR22","first-page":"838","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. PVLDB 8(8), 838\u2013849 (2015)","journal-title":"PVLDB"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s41019-019-0086-8","volume":"4","author":"Y Shao","year":"2019","unstructured":"Shao, Y., Liu, J., Shi, S., Zhang, Y., Cui, B.: Fast de-anonymization of social networks with structural information. Data Sci. Eng. 4(1), 76\u201392 (2019). https:\/\/doi.org\/10.1007\/s41019-019-0086-8","journal-title":"Data Sci. Eng."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Tian, B., Xiao, X.: SLING: a near-optimal index structure for SimRank. In: SIGMOD, pp. 1859\u20131874 (2016)","DOI":"10.1145\/2882903.2915243"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Wang, Y., Lian, X., Chen, L.: Efficient simrank tracking in dynamic graphs. In: ICDE pp. 545\u2013556 (2018)","DOI":"10.1109\/ICDE.2018.00056"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ins.2015.07.036","volume":"326","author":"S Yoon","year":"2016","unstructured":"Yoon, S., Kim, S., Park, S.: C-Rank: a link-based similarity measure for scientific literature databases. Inf. Sci. 326, 25\u201340 (2016)","journal-title":"Inf. Sci."},{"key":"3_CR27","unstructured":"Youngmann, B., Milo, T., Somech, A.: Boosting SimRank with semantics. In: EDBT, pp. 37\u201348 (2019)"},{"key":"3_CR28","unstructured":"Yu, W., Iranmanesh, S., Haldar, A., Ferhatosmanoglu, M.Z.H.: An axiomatic role similarity measure based on graph topology, Technical report (2020). https:\/\/warwick.ac.uk\/fac\/sci\/dcs\/people\/weiren_yu\/rolesim_star.pdf"},{"key":"3_CR29","unstructured":"Yu, W., Lin, X., Zhang, W.: Towards efficient SimRank computation on large networks. In: ICDE, pp. 601\u2013612 (2013)"},{"issue":"7","key":"3_CR30","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1109\/TKDE.2014.2339828","volume":"27","author":"W Yu","year":"2015","unstructured":"Yu, W., Lin, X., Zhang, W., McCann, J.A.: Fast all-pairs SimRank assessment on large graphs and bipartite domains. IEEE Trans. Knowl. Data Eng. 27(7), 1810\u20131823 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"3_CR31","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00778-017-0488-z","volume":"27","author":"W Yu","year":"2017","unstructured":"Yu, W., Lin, X., Zhang, W., McCann, J.A.: Dynamical SimRank search on time-varying networks. VLDB J. 27(1), 79\u2013104 (2017). https:\/\/doi.org\/10.1007\/s00778-017-0488-z","journal-title":"VLDB J."},{"issue":"3","key":"3_CR32","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00778-018-0536-3","volume":"28","author":"W Yu","year":"2019","unstructured":"Yu, W., Lin, X., Zhang, W., Pei, J., McCann, J.A.: SimRank*: effective and scalable pairwise similarity search based on graph topology. VLDB J. 28(3), 401\u2013426 (2019). https:\/\/doi.org\/10.1007\/s00778-018-0536-3","journal-title":"VLDB J."},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W., Zhang, Y., Le, J.: SimFusion+: extending simfusion towards efficient estimation on large and dynamic networks. In: SIGIR, pp. 365\u2013374 (2012)","DOI":"10.1145\/2348283.2348334"},{"issue":"5","key":"3_CR34","first-page":"569","volume":"8","author":"W Yu","year":"2015","unstructured":"Yu, W., McCann, J.A.: Efficient partial-pairs SimRank search for large networks. PVLDB 8(5), 569\u2013580 (2015)","journal-title":"PVLDB"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Yu, W., Wang, F.: Fast exact CoSimRank search on evolving and static graphs. In: WWW, pp. 599\u2013608 (2018)","DOI":"10.1145\/3178876.3186126"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-Rank: a comprehensive structural similarity measure over information networks. In: CIKM (2009)","DOI":"10.1145\/1645953.1646025"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Zhu, R., Zou, Z., Li, J.: SimRank computation on uncertain graphs. In: ICDE, pp. 565\u2013576 (2016)","DOI":"10.1109\/ICDE.2016.7498271"}],"container-title":["Communications in Computer and Information Science","Software Foundations for Data Interoperability and Large Scale Graph Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61133-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T02:34:19Z","timestamp":1619231659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-61133-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030611323","9783030611330"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61133-0_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LSGDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Large Scale Graph Data Analytics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lsgda2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lsgda.github.io\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","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":"6","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":"1","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":"33% - 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":"2,8","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)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}