Pattern matching in unordered trees (Extended Abstract)

Document Type

Conference Proceeding

Publication Date

1-1-1992

Abstract

We consider the problem of comparison between tmordered trees, i.e., trees for which the order among siblings is unimportant. The criterion for comparison is the distance as measured by a weighted sum of the costs of deletion, insertion and relabel operations on tree nodes. Such comparisons may contribute to pattern recognition efforts in any field (e.g., genetics) where data can naturally be characterized by unordered trees. We first observe that the problem is NP-complete. Then we present an enumerative algorithm and several heuristics leading to approximate solutions. The algorithms are based on probabilistic hill climbing and bipartite matching techniques. The paper evaluates the accuracy and time efficiency of the heuristics by applying them to a set of trees transformed from industrial parts based on a previously proposed morphological model.

Identifier

84919298849 (Scopus)

ISBN

[0818629053]

Publication Title

Proceedings International Conference on Tools with Artificial Intelligence Ictai

External Full Text Location

https://doi.org/10.1109/TAI.1992.246429

ISSN

10823409

First Page

352

Last Page

361

Volume

1992-November

This document is currently not available here.

Share

COinS