dc.contributor.author | Indyk, Piotr | |
dc.contributor.author | Price, Eric C. | |
dc.date.accessioned | 2012-09-17T17:53:06Z | |
dc.date.available | 2012-09-17T17:53:06Z | |
dc.date.issued | 2011-06 | |
dc.identifier.isbn | 978-1-4503-0691-1 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/73011 | |
dc.description.abstract | We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m x n matrices A such that for any x, given Ax, we can recover a k-sparse approximation to x under the EMD distance. One construction yields m=O(k log (n/k)) and a 1 + ε approximation factor, which matches the best achievable bound for other error measures, such as the l[subscript 1] norm.
Our algorithms are obtained by exploiting novel connections to other problems and areas, such as streaming algorithms for k-median clustering and model-based compressive sensing. We also provide novel algorithms and results for the latter problems. | en_US |
dc.language.iso | en_US | |
dc.publisher | Association for Computing Machinery (ACM) | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1145/1993636.1993720 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Piotr Indyk and Eric Price. 2011. K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance. In Proceedings of the 43rd annual ACM symposium on Theory of computing (STOC '11). ACM, New York, NY, USA, 627-636. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.approver | Indyk, Piotr | |
dc.contributor.mitauthor | Indyk, Piotr | |
dc.contributor.mitauthor | Price, Eric C. | |
dc.relation.journal | Proceedings of the 43rd annual ACM symposium on Theory of computing (STOC '11) | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
dspace.orderedauthors | Indyk, Piotr; Price, Eric | en |
dc.identifier.orcid | https://orcid.org/0000-0002-7983-9524 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |