{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:03:21Z","timestamp":1743116601319,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811579806"},{"type":"electronic","value":"9789811579813"}],"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-981-15-7981-3_2","type":"book-chapter","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T16:06:38Z","timestamp":1597939598000},"page":"16-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Incremental Partitioning Graph Similarity Search Based on Tree Structure Index"],"prefix":"10.1007","author":[{"given":"Yuhang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingli","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Shang, H., Lin, X., et al.: Connected substructure similarity search. In: SIGMOD 2010, pp. 903\u2013914 (2010)","DOI":"10.1145\/1807167.1807264"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Gouda, K., Hassaan, M.: CSI_GED: an efficient approach for graph edit similarity computation. In: ICDE 2016, pp. 265\u2013276 (2016)","DOI":"10.1109\/ICDE.2016.7498246"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Zhu, G., Lin, X., et al.: TreeSpan: efficiently computing similarity all-matching. In: SIGMOD 2012, pp. 529\u2013540 (2012)","DOI":"10.1145\/2213836.2213896"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Maergner, P., Riesen, K., et al.: A structural approach to offline signature verification using graph edit distance. In: ICDAR 2017, pp. 1216\u20131222 (2017)","DOI":"10.1109\/ICDAR.2017.201"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1093\/bioinformatics\/btz496","volume":"36","author":"C Geng","year":"2020","unstructured":"Geng, C., Jung, Y., et al.: iScore: a novel graph kernel-based function for scoring protein-protein docking models. Bioinformatics 36(1), 112\u2013121 (2020)","journal-title":"Bioinformatics"},{"issue":"1","key":"2_CR6","first-page":"25","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., et al.: Comparing stars: on approximating graph edit distance. PVLDB 2(1), 25\u201336 (2009)","journal-title":"PVLDB"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-38221-5_15","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K Riesen","year":"2013","unstructured":"Riesen, K., Emmenegger, S., Bunke, H.: A novel software toolkit for graph edit distance computation. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol. 7877, pp. 142\u2013151. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38221-5_15"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TKDE.2010.28","volume":"24","author":"G Wang","year":"2012","unstructured":"Wang, G., Wang, B., et al.: Efficiently indexing large sparse graphs for similarity search. IEEE Trans. Knowl. Data Eng. 24(3), 440\u2013451 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00778-013-0306-1","volume":"22","author":"X Zhao","year":"2013","unstructured":"Zhao, X., Xiao, C., Lin, X., Wang, W., Ishikawa, Y.: Efficient processing of graph similarity queries with edit distance constraints. VLDB J. 22(6), 727\u2013752 (2013). https:\/\/doi.org\/10.1007\/s00778-013-0306-1","journal-title":"VLDB J."},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/TKDE.2014.2349924","volume":"27","author":"W Zheng","year":"2015","unstructured":"Zheng, W., Zou, L., et al.: Efficient graph similarity search over large graph databases. IEEE Trans. Knowl. Data Eng. 27(4), 964\u2013978 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Ullmann, J.R.: Degree reduction in labeled graph retrieval. ACM J. Exp. Algorithmics 20, 1.3:1.1\u20131.3:1.54 (2015)","DOI":"10.1145\/2699878"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Li, Z., Jian, X., et al.: An efficient probabilistic approach for graph similarity search. In: ICDE 2018, pp. 533\u2013544 (2018)","DOI":"10.1109\/ICDE.2018.00055"},{"issue":"3","key":"2_CR13","first-page":"169","volume":"7","author":"X Zhao","year":"2013","unstructured":"Zhao, X., Xiao, C., et al.: A partition-based approach to structure similarity search. PVLDB 7(3), 169\u2013180 (2013)","journal-title":"PVLDB"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Liang, Y., Zhao, P.: Similarity search in graph databases: a multi-layered indexing approach. In: ICDE 2017, pp. 783\u2013794 (2017)","DOI":"10.1109\/ICDE.2017.129"},{"key":"2_CR15","unstructured":"Kim, J., Choi, D.-H., Li, C.: Inves: incremental partitioning-based verification for graph similarity search. In: EDBT 2019, pp. 229\u2013240 (2019)"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-7981-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:30:11Z","timestamp":1710250211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-15-7981-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811579806","9789811579813"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-7981-3_2","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":"20 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPCSEE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of Pioneering Computer Scientists, Engineers and Educators","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiyuan","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":"18 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpcsee2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2020.icpcsee.org","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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"392","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":"74","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":"24","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":"5","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)"}}]}}