WEKO3
アイテム
A Theoretical Analysis of Tree Edit Distance Measures
https://ipsj.ixsq.nii.ac.jp/records/17185
https://ipsj.ixsq.nii.ac.jp/records/17185defa9d19-9236-42d0-b93c-ae94c0fe8191
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
|
|
Copyright (c) 2005 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2005-12-15 | |||||||
| タイトル | ||||||||
| タイトル | A Theoretical Analysis of Tree Edit Distance Measures | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | A Theoretical Analysis of Tree Edit Distance Measures | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | オリジナル論文 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Center for Collaborative Research the University of Tokyo | ||||||||
| 著者所属 | ||||||||
| Research Center for Advanced Science and Technology the University of Tokyo | ||||||||
| 著者所属 | ||||||||
| Faculty of Information Sciences Hiroshima City University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Center for Collaborative Research the University of Tokyo | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Research Center for Advanced Science and Technology the University of Tokyo | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Faculty of Information Sciences Hiroshima City University | ||||||||
| 著者名 |
Tetsuji, Kuboyama
Kilho, Shin
Tetsuhiro, Miyahara
× Tetsuji, Kuboyama Kilho, Shin Tetsuhiro, Miyahara
|
|||||||
| 著者名(英) |
Tetsuji, Kuboyama
Kilho, Shin
Tetsuhiro, Miyahara
× Tetsuji, Kuboyama Kilho, Shin Tetsuhiro, Miyahara
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA11464803 | |||||||
| 書誌情報 |
情報処理学会論文誌数理モデル化と応用(TOM) 巻 46, 号 SIG17(TOM13), p. 31-45, 発行日 2005-12-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7780 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||