期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A metric normalization of tree edit distance 被引量:1
1
作者 yujian li (1) liyujian@bjut.edu.cn zhang chenguang (12) 《Frontiers of Computer Science》 SCIE EI CSCD 2011年第1期119-125,共7页
Traditional normalized tree edit distances do not satisfy the triangle inequality. We present a metric normalization method for tree edit distance, which results in a new normalized tree edit distance fulfilling the t... Traditional normalized tree edit distances do not satisfy the triangle inequality. We present a metric normalization method for tree edit distance, which results in a new normalized tree edit distance fulfilling the triangle inequality, under the condition that the weight function is a metric over the set of elementary edit operations with all costs of insertions/deletions having the same weight. We prove that the new distance, in the range [0, 1], is a genuine metric as a simple function of the sizes of two ordered labeled trees and the tree edit distance between them, which can be directly computed through tree edit distance with the same complexity. Based on an efficient algorithm to represent digits as ordered labeled trees, we show that the normalized tree edit metric can provide slightly better results than other existing methods in handwritten digit recognition experiments using the approximating and eliminating search algorithm (AESA) algorithm. 展开更多
关键词 METRIC NORMALIZATION tree edit distance triangle inequality approximating and eliminating searchalgorithm (AESA)
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部