Sublinear time algorithms for earth mover's distance
We study the problem of estimating the Earth Mover's Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness testers and additive-error estimators over domains in [0, 1][superscript d], with sample complexities independent of do...
Main Authors: | , , , |
---|---|
Other Authors: | , |
Format: | Article |
Language: | English |
Published: |
Springer New York,
2012-07-11T14:18:02Z.
|
Subjects: | |
Online Access: | Get fulltext |