# Tree edit distance for hierarchical data compatible with HMIL paradigm

arXiv: https://arxiv.org/abs/2208.00782 · HTML: https://mlsanity.com/paper/2208.00782/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 15 references that are in the map.
- First posted on arXiv 26 Jul 2022.

## Builds on (most cited first, 3 of 3)

- [Discriminative models for multi-instance problems with tree-structure](https://mlsanity.com/paper/1703.02868/) (2017)
- [New Techniques for Graph Edit Distance Computation](https://mlsanity.com/paper/1908.00265/) (2019)
- [Mapping the Internet: Modelling Entity Interactions in Complex Heterogeneous Networks](https://mlsanity.com/paper/2104.09650/) (2021)

## Abstract (arXiv)

We define edit distance for hierarchically structured data compatible with the hierarchical multi-instance learning paradigm. Example of such data is dataset represented in JSON format where inner Array objects are interpreted as unordered bags of elements. We prove correct analytical properties of the defined distance.