• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Li, Yu-Jian (Li, Yu-Jian.) | Zhang, Chen-Guang (Zhang, Chen-Guang.)

Indexed by:

EI Scopus PKU CSCD

Abstract:

Using a simple function of the sizes of two trees and the edit distance between them, this paper presents a normalized tree edit distance, which not only satisfies the triangle inequality, but also is a genuine metric valued in [0, 1] under the condition that the weight function is a metric over the set of elementary edit operations with all costs of insertions/deletions of the same weight. Moreover, the distance can be directly computed through tree edit distances and it has the same computing time complexity with the tree edit distance. Handwritten digits recognition experiments show that the metric normalization can reach 91.6%, which is 0.2% and 0.8% better than that of the other two existing methods respectively when the AESA is used.

Keyword:

Forestry Trees (mathematics) Character recognition

Author Community:

  • [ 1 ] [Li, Yu-Jian]College of Computer Science, Beijing University of Technology, Beijing 100124, China
  • [ 2 ] [Zhang, Chen-Guang]College of Computer Science, Beijing University of Technology, Beijing 100124, China

Reprint Author's Address:

Email:

Show more details

Related Keywords:

Related Article:

Source :

Journal of Beijing University of Technology

ISSN: 0254-0037

Year: 2011

Issue: 4

Volume: 37

Page: 576-582

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 0

Online/Total:351/5462173
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.