Pattern matching in unordered trees (Extended Abstract)

Dennis Shasha, J. T.L. Wang, K. Zhang, F. Y. Shih

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication4th International Conference on Tools with Artificial Intelligence, ICTAI 1992
PublisherIEEE Computer Society
Pages352-361
Number of pages10
ISBN (Electronic)0818629053
DOIs
StatePublished - Jan 1 1992
Event4th International Conference on Tools with Artificial Intelligence, ICTAI 1992 - Arlington, United States
Duration: Nov 10 1992Nov 13 1992

Publication series

NameProceedings - International Conference on Tools with Artificial Intelligence, ICTAI
Volume1992-November
ISSN (Print)1082-3409

Conference

Conference4th International Conference on Tools with Artificial Intelligence, ICTAI 1992
CountryUnited States
CityArlington
Period11/10/9211/13/92

Fingerprint

Pattern matching
Pattern recognition
Computational complexity
Costs
Genetics

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Computer Science Applications

Cite this

Shasha, D., Wang, J. T. L., Zhang, K., & Shih, F. Y. (1992). Pattern matching in unordered trees (Extended Abstract). In 4th International Conference on Tools with Artificial Intelligence, ICTAI 1992 (pp. 352-361). [246429] (Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI; Vol. 1992-November). IEEE Computer Society. https://doi.org/10.1109/TAI.1992.246429

Pattern matching in unordered trees (Extended Abstract). / Shasha, Dennis; Wang, J. T.L.; Zhang, K.; Shih, F. Y.

4th International Conference on Tools with Artificial Intelligence, ICTAI 1992. IEEE Computer Society, 1992. p. 352-361 246429 (Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI; Vol. 1992-November).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shasha, D, Wang, JTL, Zhang, K & Shih, FY 1992, Pattern matching in unordered trees (Extended Abstract). in 4th International Conference on Tools with Artificial Intelligence, ICTAI 1992., 246429, Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI, vol. 1992-November, IEEE Computer Society, pp. 352-361, 4th International Conference on Tools with Artificial Intelligence, ICTAI 1992, Arlington, United States, 11/10/92. https://doi.org/10.1109/TAI.1992.246429
Shasha D, Wang JTL, Zhang K, Shih FY. Pattern matching in unordered trees (Extended Abstract). In 4th International Conference on Tools with Artificial Intelligence, ICTAI 1992. IEEE Computer Society. 1992. p. 352-361. 246429. (Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI). https://doi.org/10.1109/TAI.1992.246429
Shasha, Dennis ; Wang, J. T.L. ; Zhang, K. ; Shih, F. Y. / Pattern matching in unordered trees (Extended Abstract). 4th International Conference on Tools with Artificial Intelligence, ICTAI 1992. IEEE Computer Society, 1992. pp. 352-361 (Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI).
@inproceedings{097ae2c736e3402fbc56ae8c28af5727,
title = "Pattern matching in unordered trees (Extended Abstract)",
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.",
author = "Dennis Shasha and Wang, {J. T.L.} and K. Zhang and Shih, {F. Y.}",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/TAI.1992.246429",
language = "English (US)",
series = "Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI",
publisher = "IEEE Computer Society",
pages = "352--361",
booktitle = "4th International Conference on Tools with Artificial Intelligence, ICTAI 1992",

}

TY - GEN

T1 - Pattern matching in unordered trees (Extended Abstract)

AU - Shasha, Dennis

AU - Wang, J. T.L.

AU - Zhang, K.

AU - Shih, F. Y.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84919298849&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84919298849&partnerID=8YFLogxK

U2 - 10.1109/TAI.1992.246429

DO - 10.1109/TAI.1992.246429

M3 - Conference contribution

T3 - Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

SP - 352

EP - 361

BT - 4th International Conference on Tools with Artificial Intelligence, ICTAI 1992

PB - IEEE Computer Society

ER -