{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:21:05Z","timestamp":1743092465417,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030054984"},{"type":"electronic","value":"9783030054991"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-05499-1_4","type":"book-chapter","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T17:36:40Z","timestamp":1546623400000},"page":"65-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Earth Mover\u2019s Distance Between Rooted Labeled Unordered Trees Formulated from Complete Subtrees"],"prefix":"10.1007","author":[{"given":"Taiga","family":"Kawaguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takuya","family":"Yoshino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,5]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.11.017","volume":"470","author":"T Akutsu","year":"2013","unstructured":"Akutsu, T., Fukagawa, D., Halld\u00f3rsson, M.M., Takasu, A., Tanaka, K.: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theoret. Comput. Sci. 470, 10\u201322 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR2","unstructured":"Chawathe, S.S.: Comparing hierarchical data in external memory. In: Proceedings of VLDB 1999, pp. 90\u2013101 (1999)"},{"issue":"1","key":"4_CR3","first-page":"2","volume":"6","author":"ED Demaine","year":"2009","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algo. 6(1), 2 (2009)","journal-title":"ACM Trans. Algo."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Gollapudi, S., Panigrahy, S.: The power of two min-hashes for similarity search among hierarchical data objects. In: Proceedings of PODS 2008, pp. 211\u2013219 (2008)","DOI":"10.1145\/1376916.1376946"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-642-21458-5_34","volume-title":"Combinatorial Pattern Matching","author":"K Hirata","year":"2011","unstructured":"Hirata, K., Yamamoto, Y., Kuboyama, T.: Improved MAX SNP-hard results for finding an edit distance between unordered trees. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 402\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21458-5_34"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","volume":"143","author":"T Jiang","year":"1995","unstructured":"Jiang, T., Wang, L., Zhang, K.: Alignment of trees - an alternative to tree edit. Theoret. Comput. Sci. 143, 137\u2013148 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR7","unstructured":"Kawaguchi, T., Hirata, K.: On earth mover\u2019s distance based on complete subtrees for rooted labeled trees. In: Proceedings of SISA 2017, pp. 225\u2013228 (2017)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Kawaguchi, T., Hirata, K.: Earth mover\u2019s distance for rooted labeled unordered trees based on Tai mapping hierarchy. In: Proceedings of ICPRAM 2018, pp. 159\u2013168 (2018)","DOI":"10.5220\/0006633701590168"},{"key":"4_CR9","unstructured":"Kuboyama, T.: Matching and learning in trees. Ph.D. thesis, University of Tokyo (2007)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2007","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover\u2019s distance as a metric for image retrieval. Int. J. Comput. Vision 40, 99\u2013121 (2007)","journal-title":"Int. J. Comput. Vision"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"SM Selkow","year":"1977","unstructured":"Selkow, S.M.: The tree-to-tree editing problem. Inform. Process. Lett. 6, 184\u2013186 (1977)","journal-title":"Inform. Process. Lett."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K-C Tai","year":"1979","unstructured":"Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26, 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"4_CR13","unstructured":"Valiente, G.: An efficient bottom-up distance between trees. In: Proceedings of SPIRE 2001, pp. 212\u2013219 (2001)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1142\/S0129054114500154","volume":"25","author":"Y Yamamoto","year":"2014","unstructured":"Yamamoto, Y., Hirata, K., Kuboyama, T.: Tractable and intractable variations of unordered tree edit distance. Int. J. Found. Comput. Sci. 25, 307\u2013329 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s00224-016-9705-1","volume":"60","author":"T Yoshino","year":"2017","unstructured":"Yoshino, T., Hirata, K.: Tai mapping hierarchy for rooted labeled trees through common subforest. Theory Comput. Syst. 60, 759\u2013783 (2017)","journal-title":"Theory Comput. Syst."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0031-3203(94)00109-Y","volume":"28","author":"K Zhang","year":"1995","unstructured":"Zhang, K.: Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recog. 28, 463\u2013474 (1995)","journal-title":"Pattern Recog."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01975866","volume":"15","author":"K Zhang","year":"1996","unstructured":"Zhang, K.: A constrained edit distance between unordered labeled trees. Algorithmica 15, 205\u2013222 (1996)","journal-title":"Algorithmica"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K Zhang","year":"1994","unstructured":"Zhang, K., Jiang, T.: Some MAX SNP-hard results concerning unordered labeled trees. Inform. Process. Lett. 49, 249\u2013254 (1994)","journal-title":"Inform. Process. Lett."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1142\/S0129054196000051","volume":"7","author":"K Zhang","year":"1996","unstructured":"Zhang, K., Wang, J., Shasha, D.: On the editing distance between undirected acyclic graphs. Int. J. Found. Comput. Sci. 7, 43\u201358 (1996)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition Applications and Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05499-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T01:03:14Z","timestamp":1672794194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05499-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030054984","9783030054991"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05499-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPRAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Pattern Recognition Applications and Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Funchal","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpram2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icpram.org\/?y=2018","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":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","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":"10","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":"0","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":"10% - 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":"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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}