Tree edit distance for hierarchical data compatible with HMIL paradigm

07/26/2022
by   Břetislav Šopík, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2018

Revisiting the tree edit distance and its backtracing: A tutorial

Almost 30 years ago, Zhang and Shasha published a seminal paper describi...
research
09/15/2022

Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance

Computing the edit distance of two strings is one of the most basic prob...
research
05/07/2019

Kendall Tau Sequence Distance: Extending Kendall Tau from Ranks to Sequences

An edit distance is a measure of the minimum cost sequence of edit opera...
research
07/26/2021

An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs

The unordered tree edit distance is a natural metric to compute distance...
research
04/29/2019

Soft edit distance for differentiable comparison of symbolic sequences

Edit distance, also known as Levenshtein distance, is an essential way t...
research
12/17/2019

Testing Membership for Timed Automata

Given a timed automata which admits thick components and a timed word x,...
research
08/25/2019

Adversarial Edit Attacks for Tree Data

Many machine learning models can be attacked with adversarial examples, ...

Please sign up or login with your details

Forgot password? Click here to reset