A new dissimilarity measure between trees by decomposition of unit-cost edit distance

Authors:
Hisashi Koga;Hiroaki Saito;Toshinori Watanabe;Takanori Yokoyama
Affiliations:
Graduate Schools of Information Systems, University of Electro-Communications, Tokyo, Japan;Graduate Schools of Information Systems, University of Electro-Communications, Tokyo, Japan;Graduate Schools of Information Systems, University of Electro-Communications, Tokyo, Japan;Graduate Schools of Information Systems, University of Electro-Communications, Tokyo, Japan
Venue:
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
Year:
2007

Citing 6
Cited 0

Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
Fast algorithms for the unit cost editing distance between trees

Journal of Algorithms
A graph distance metric based on the maximal common subgraph

Pattern Recognition Letters
On the Pattern Recognition of Noisy Subsequence Trees

IEEE Transactions on Pattern Analysis and Machine Intelligence
A survey on tree edit distance and related problems

Theoretical Computer Science
Approximate subtree identification in heterogeneous XML documents collections

XSym'05 Proceedings of the Third international conference on Database and XML Technologies

Quantified Score

Hi-index	0.01

Visualization

Abstract

Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of label and that of tree structure simultaneously. Therefore, even if the label similarity between two trees that share many nodes with the same label is high, the high label similarity is hard to be recognized from their tree edit distance when their tree sizes or shapes are quite different. To overcome this flaw, we propose a novel method that obtains a label dissimilarity measure and a structural dissimilarity measure separately by decomposing unit-cost edit distance.