Idioma:

An A Algorithm for Computing Edit Distance between Rooted Labeled Unordered Trees

Higuchi, Shoichi ; Kan, Tomohiro ; Yamamoto, Yoshiyuki ; Hirata, Kouichi

New Frontiers in Artificial Intelligence, p.186-196 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
An A Algorithm for Computing Edit Distance between Rooted Labeled Unordered Trees
Autor: Higuchi, Shoichi ; Kan, Tomohiro ; Yamamoto, Yoshiyuki ; Hirata, Kouichi
Assuntos: Cost Function ; Edit Distance ; Edit Operation ; Heuristic Function ; Short Path
É parte de: New Frontiers in Artificial Intelligence, p.186-196
Notas: This work is partially supported by Grand-in-Aid for Scientific Research 20500126, 21500145 and 22240010 from the Ministry of Education, Culture, Sports, Science and Technology, Japan.
Descrição: In this paper, we design an A* algorithm for computing the edit distance between rooted labeled unordered trees. First, we introduce some lower bounding functions that provide the constant factor lower bounds on the edit distance. Then, by using the lower bounding functions as a heuristic function, we design the A* algorithm as the best-first search for the edit distance search tree. Finally, we give experimental results for the A* algorithm.
Títulos relacionados: Lecture Notes in Computer Science
Editor: Berlin, Heidelberg: Springer Berlin Heidelberg
Idioma: Inglês

Voltar para lista de resultados