Structural entropic difference: a bounded distance metric for unordered trees

R. Connor, F. Simeoni, M. Iakovos

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

2 Citations (Scopus)


We show a new metric for comparing unordered, tree-structured data. While such data is increasingly important in its own right, the methodology underlying the construction of the metric is generic and may be reused for other classes of ordered and partially ordered data. The metric is based on the information content of the two values under consideration, which is measured using Shannon's entropy equations. In essence, the more commonality the values possess, the closer they are. As values in this domain may have no commonality, a good metric should be bounded to represent this. This property has been achieved, but is in tension with triangle inequality.
Original languageEnglish
Title of host publicationSISAP '09: Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Number of pages9
Publication statusPublished - 2009


  • structural entropic difference
  • unordered trees
  • computer science


Dive into the research topics of 'Structural entropic difference: a bounded distance metric for unordered trees'. Together they form a unique fingerprint.

Cite this