{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:13:35Z","timestamp":1743099215967,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030602581"},{"type":"electronic","value":"9783030602598"}],"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-60259-8_10","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T10:04:33Z","timestamp":1602756273000},"page":"127-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LSimRank: Node Similarity in a Labeled Graph"],"prefix":"10.1007","author":[{"given":"Yang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Cheng","family":"Long","sequence":"additional","affiliation":[]},{"given":"Zitong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,16]]},"reference":[{"key":"10_CR1","unstructured":"Konect datasets: The koblenz network collection. http:\/\/konect.uni-koblenz.de"},{"key":"10_CR2","unstructured":"Technical report: LSimRank: Node similarity in a labeled graph. https:\/\/www.dropbox.com\/sh\/19il4hol726ltic\/AABsMjX-28wJN4IlYArJS6yYa?dl=0"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"408","DOI":"10.14778\/1453856.1453903","volume":"1","author":"I Antonellis","year":"2008","unstructured":"Antonellis, I., Molina, H.G., Chang, C.C.: Simrank++: query rewriting through link analysis of the click graph. Proc. VLDB Endowment 1(1), 408\u2013421 (2008)","journal-title":"Proc. VLDB Endowment"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Arora, A., Sachan, M., Bhattacharya, A.: Mining statistically significant connected subgraphs in vertex labeled graphs. In: SIGMOD, pp. 1003\u20131014 (2014)","DOI":"10.1145\/2588555.2588574"},{"issue":"2","key":"10_CR5","first-page":"15","volume":"10","author":"H-H Chen","year":"2015","unstructured":"Chen, H.-H., Giles, C.L.: Ascos++: an asymmetric similarity measure for weighted networks to address the problem of simrank. ACM Trans. Knowl. Discov. Data (TKDD) 10(2), 15 (2015)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Conte, A., Ferraro, G., Grossi, R., Marino, A., Sadakane, K., Uno, T.: Node similarity with q-grams for real-world labeled networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1282\u20131291. ACM (2018)","DOI":"10.1145\/3219819.3220085"},{"key":"10_CR7","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. ACM (2005)","DOI":"10.1145\/1060745.1060839"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 538\u2013543. ACM (2002)","DOI":"10.1145\/775047.775126"},{"issue":"9","key":"10_CR9","doi-asserted-by":"publisher","first-page":"937","DOI":"10.14778\/3099622.3099625","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. Proc. VLDB Endowment 10(9), 937\u2013948 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"10_CR10","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 International Conference on Knowledge Discovery and Data Mining, pp. 922\u2013930. ACM (2011)","DOI":"10.1145\/2020408.2020561"},{"key":"10_CR11","unstructured":"Leskovec, J., Krevl, A.: Snap datasets: standford large network dataset collection (2016). http:\/\/snap.standford.edu\/data"},{"issue":"7","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019\u20131031 (2007)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"10_CR13","unstructured":"Lin, D., et al.: An information-theoretic definition of similarity. In: Icml, vol. 98, pp. 296\u2013304. Citeseer (1998)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.14778\/3151113.3151115","volume":"11","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Zheng, B., He, X., Wei, Z., Xiao, X., Zheng, K., Lu, J.: Probesim: scalable single-source and top-k simrank computations on dynamic graphs. Proc. VLDB Endowment 11(1), 14\u201326 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Rothe, S., Sch\u00fctze, H.: Cosimrank: a flexible & efficient graph-theoretic similarity measure. In: Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), vol. 1, pp. 1392\u20131402 (2014)","DOI":"10.3115\/v1\/P14-1131"},{"issue":"8","key":"10_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. Proc. VLDB Endowment 8(8), 838\u2013849 (2015)","journal-title":"Proc. VLDB Endowment"},{"issue":"10","key":"10_CR17","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TKDE.2013.2297920","volume":"26","author":"C Shi","year":"2014","unstructured":"Shi, C., Kong, X., Huang, Y., Philip, S.Y., Wu, B.: Hetesim: a general framework for relevance measure in heterogeneous networks. IEEE Trans. Knowl. Data Eng. 26(10), 2479\u20132492 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"10_CR18","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1109\/TKDE.2017.2779126","volume":"30","author":"J Song","year":"2018","unstructured":"Song, J., Luo, X., Gao, J., Zhou, C., Wei, H., Uniwalk, J.X.Y.: Unidirectional random walk based scalable simrank computation over large graph. IEEE Trans. Knowl. Data Eng. 30(5), 992\u20131006 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10_CR19","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 Explor. Newsletter 13(2), 50\u201364 (2012)","journal-title":"ACM SIGKDD Explor. Newsletter"},{"issue":"11","key":"10_CR20","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proc. VLDB Endowment 4(11), 992\u20131003 (2011)","journal-title":"Proc. VLDB Endowment"},{"key":"10_CR21","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, pp. 1859\u20131874. ACM (2016)","DOI":"10.1145\/2882903.2915243"},{"issue":"6","key":"10_CR22","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/TKDE.2014.2373385","volume":"27","author":"Y Xiong","year":"2014","unstructured":"Xiong, Y., Zhu, Y., Philip, S.Y.: Top-k similarity join in heterogeneous information networks. IEEE Trans. Knowl. Data Eng. 27(6), 1710\u20131723 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10_CR23","unstructured":"Youngmann, B., Milo, T., Somech, A.: Boosting simrank with semantics. In: EDBT, pp. 37\u201348 (2019)"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.14778\/2732219.2732221","volume":"7","author":"W Yu","year":"2013","unstructured":"Yu, W., Lin, X., Zhang, W., Chang, L., Pei, J.: More is simpler: effectively and efficiently assessing node-pair similarities based on hyperlinks. Proc. VLDB Endowment 7(1), 13\u201324 (2013)","journal-title":"Proc. VLDB Endowment"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 553\u2013562. ACM (2009)","DOI":"10.1145\/1645953.1646025"},{"issue":"1","key":"10_CR26","doi-asserted-by":"publisher","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. Proc. VLDB Endowment 2(1), 718\u2013729 (2009)","journal-title":"Proc. VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60259-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T08:03:19Z","timestamp":1619251399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60259-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030602581","9783030602598"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60259-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"16 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/apwebwaim2020\/","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":"259","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":"68","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":"37","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":"26% - 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":"4.6","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 organized as a fully online conference.","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)"}}]}}