mlsanityData to 13 Oct 2026

Tree edit distance for hierarchical data compatible with HMIL paradigm

arXiv 2208.00782 ↗First posted 26 Jul 2022cs.DB cs.LGcited by 0

Not on the map. Why?

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.

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

Builds on

3 of 15 references.

References · 3

  1. 2017Discriminative models for multi-instance problems with tree-structurecited by 8
  2. 2019New Techniques for Graph Edit Distance Computationcited by 5
  3. 2021Mapping the Internet: Modelling Entity Interactions in Complex Heterogeneous Networkscited by 3

Built on by

Not cited yet.