Papers
Topics
Authors
Recent
Search
2000 character limit reached

Improved Approximation Algorithms for Earth-Mover Distance in Data Streams

Published 24 Apr 2014 in cs.DS | (1404.6287v1)

Abstract: For two multisets SS and TT of points in [Δ]2[\Delta]^2, such that ∣S∣=∣T∣=n|S| = |T|= n, the earth-mover distance (EMD) between SS and TT is the minimum cost of a perfect bipartite matching with edges between points in SS and TT, i.e., EMD(S,T)=min⁡π:S→T∑a∈S∣∣a−π(a)∣∣1EMD(S,T) = \min_{\pi:S\rightarrow T}\sum_{a\in S}||a-\pi(a)||_1, where π\pi ranges over all one-to-one mappings. The sketching complexity of approximating earth-mover distance in the two-dimensional grid is mentioned as one of the open problems in the literature. We give two algorithms for computing EMD between two multi-sets when the number of distinct points in one set is a small value k=log⁡O(1)(Δn)k=\log^{O(1)}(\Delta n). Our first algorithm gives a (1+ϵ)(1+\epsilon)-approximation using O(kϵ−2log⁡4n)O(k\epsilon^{-2}\log^{4}n) space and works only in the insertion-only model. The second algorithm gives a O(min⁡(k3,log⁡Δ))O(\min(k^3,\log\Delta))-approximation using O(log⁡3Δ⋅log⁡log⁡Δ⋅log⁡n)O(\log^{3}\Delta\cdot\log\log\Delta\cdot\log n)-space in the turnstile model.

Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.