Tree edit distance for hierarchical data compatible with HMIL paradigm
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
TreeForm: End-to-end Annotation and Evaluation for Form Document Parsing
Visually Rich Form Understanding (VRFU) poses a complex research problem due to the documents' highly structured nature and yet highly variable style and content. Current annotation schemes decompose form understanding a…
FormAnytime Hierarchical Clustering
We propose a new anytime hierarchical clustering method that iteratively transforms an arbitrary initial hierarchy on the configuration of measurements along a sequence of trees we prove for a fixed data set must termina…
Anomaly DetectionClusteringThe DOPE Distance is SIC: A Stable, Informative, and Computable Metric on Time Series And Ordered Merge Trees
Metrics for merge trees that are simultaneously stable, informative, and efficiently computable have so far eluded researchers. We show in this work that it is possible to devise such a metric when restricting merge tree…
Dynamic Time WarpingTime SeriesTime Series AnalysisTime Series ClassificationTree Edit Distance Learning via Adaptive Symbol Embeddings
Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Rece…
Metric LearningAn A*-algorithm for the Unordered Tree Edit Distance with Custom Costs
The unordered tree edit distance is a natural metric to compute distances between trees without intrinsic child order, such as representations of chemical molecules. While the unordered tree edit distance is MAX SNP-hard…