Approximate classification via earthmover metrics
From MaRDI portal
Publication:5501372
Recommendations
- On earthmover distance, metric labeling, and 0-extension
- On earthmover distance, metric labeling, and 0-extension
- Approximation algorithms for the metric labeling problem via a new linear programming formulation
- Approximation Algorithms for the 0-Extension Problem
- A constant factor approximation algorithm for a class of classification problems
Cited in
(9)- Nonembeddability theorems via Fourier analysis
- On Lipschitz extension from finite subsets
- A tight bound on approximating arbitrary metrics by tree metrics
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- On earthmover distance, metric labeling, and 0-extension
- Approximating spaces of Nagata dimension zero by weighted trees
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- An explicit bound on the transportation cost distance
- On earthmover distance, metric labeling, and 0-extension
This page was built for publication: Approximate classification via earthmover metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501372)
