{"links":{},"id":17185,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00017185","sets":["934:989:1002:1003"]},"path":["1003"],"owner":"1","recid":"17185","title":["A Theoretical Analysis of Tree Edit Distance Measures"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-12-15"},"_buckets":{"deposit":"80cb1564-3fe6-4c70-a0b7-aa7b5c9ba067"},"_deposit":{"id":"17185","pid":{"type":"depid","value":"17185","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"A Theoretical Analysis of Tree Edit Distance Measures","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Theoretical Analysis of Tree Edit Distance Measures"},{"subitem_title":"A Theoretical Analysis of Tree Edit Distance Measures","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"オリジナル論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2005-12-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Center for Collaborative Research the University of Tokyo"},{"subitem_text_value":"Research Center for Advanced Science and Technology the University of Tokyo"},{"subitem_text_value":"Faculty of Information Sciences Hiroshima City University"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Center for Collaborative Research the University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Research Center for Advanced Science and Technology the University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Information Sciences Hiroshima City University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/17185/files/IPSJ-TOM4617005.pdf"},"date":[{"dateType":"Available","dateValue":"2007-12-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM4617005.pdf","filesize":[{"value":"366.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"12d93176-1da6-4114-96cc-e64bae187531","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tetsuji, Kuboyama"},{"creatorName":"Kilho, Shin"},{"creatorName":"Tetsuhiro, Miyahara"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tetsuji, Kuboyama","creatorNameLang":"en"},{"creatorName":"Kilho, Shin","creatorNameLang":"en"},{"creatorName":"Tetsuhiro, Miyahara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"The notion of the tree edit distance provides a unifying framework for measuring distance and finding approximate common patterns between two trees. A diversity of tree edit distance measures have been proposed to deal with tree related problems  such as minor containment  maximum common subtree isomorphism  maximum common embedded subtree  and alignment of trees. These classes of problems are characterized by the conditions of the tree mappings  which specify how to associate the nodes in one tree with the nodes in the other. In this paper  we study the declarative semantics of edit distance measures based on the tree mapping. In prior work  the edit distance measures have been not well-formalized. So the relationship among various algorithms based on the tree edit distance has hardly been studied. Our framework enables us to study the relationship. By using our framework  we reveal the declarative semantics of the alignment of trees  which has remained unknown in prior work.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The notion of the tree edit distance provides a unifying framework for measuring distance and finding approximate common patterns between two trees. A diversity of tree edit distance measures have been proposed to deal with tree related problems, such as minor containment, maximum common subtree isomorphism, maximum common embedded subtree, and alignment of trees. These classes of problems are characterized by the conditions of the tree mappings, which specify how to associate the nodes in one tree with the nodes in the other. In this paper, we study the declarative semantics of edit distance measures based on the tree mapping. In prior work, the edit distance measures have been not well-formalized. So the relationship among various algorithms based on the tree edit distance has hardly been studied. Our framework enables us to study the relationship. By using our framework, we reveal the declarative semantics of the alignment of trees, which has remained unknown in prior work.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"45","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"31","bibliographicIssueDates":{"bibliographicIssueDate":"2005-12-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG17(TOM13)","bibliographicVolumeNumber":"46"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:50:15.010320+00:00","updated":"2025-01-22T23:28:24.102805+00:00"}