A bounded distance metric for comparing tree structure

@article{Connor2011ABD,
  title={A bounded distance metric for comparing tree structure},
  author={Richard C. H. Connor and Fabio Simeoni and Michael Iakovos and Robert Moss},
  journal={Inf. Syst.},
  year={2011},
  volume={36},
  pages={748-764}
}
Comparing tree-structured data for structural similarity is a recurring theme and one on which much effort has been spent. Most approaches so far are grounded, implicitly or explicitly, in algorithmic information theory, being approximations to an information distance derived from Kolmogorov complexity. In this paper we propose a novel complexity metric, also grounded in information theory, but calculated via Shannon's entropy equations. This is used to formulate a directly and efficiently… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS

Extended Subtree: A New Similarity Function for Tree Structured Data

  • IEEE Transactions on Knowledge and Data Engineering
  • 2014
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Black-box tree test case generation through diversity

  • Automated Software Engineering
  • 2018
VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS