Tree edit distance for hierarchical data compatible with HMIL paradigm

Břetislav Šopík, Tomáš Strenáčik

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment