Sublinear Time Algorithms for Earth Mover's Distance
| dc.creator | Ba, Khanh Do | |
| dc.creator | Nguyen, Huy L | |
| dc.creator | Nguyen, Huy N | |
| dc.creator | Rubinfeld, Ronitt | |
| dc.date | 2009-04-02 | |
| dc.date.accessioned | 2026-07-07T12:59:31Z | |
| dc.date.available | 2026-07-07T12:59:31Z | |
| dc.description | We study the problem of estimating the Earth Mover's Distance (EMD) between probability distributions when given access only to samples. We give closeness testers and additive-error estimators over domains in $[0, Δ]^d$, with sample complexities independent of domain size - permitting the testability even of continuous distributions over infinite domains. Instead, our algorithms depend on other parameters, such as the diameter of the domain space, which may be significantly smaller. We also prove lower bounds showing the dependencies on these parameters to be essentially optimal. Additionally, we consider whether natural classes of distributions exist for which there are algorithms with better dependence on the dimension, and show that for highly clusterable data, this is indeed the case. Lastly, we consider a variant of the EMD, defined over tree metrics instead of the usual L1 metric, and give optimal algorithms. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/0904.0292 | |
| dc.identifier | http://arxiv.org/abs/0904.0292 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/225596 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Sublinear Time Algorithms for Earth Mover's Distance | |
| dc.type | text |