Overcoming the ℓ1 non-embeddability barrier: Algorithms for product metrics

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 865-874

  Andoni, Alexandr ^a   Indyk, Piotr ^a   Krauthgamer, Robert ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDINGS; NEAREST NEIGHBOR SEARCH; SET THEORY; TOPOLOGY;

COMPUTATIONAL PROBLEM; CONSTANT DISTORTION; CONSTANT FACTOR APPROXIMATION; INHERENT LIMITATIONS; METRIC SPACES; NEAREST NEIGHBORS; NEW APPROACHES; PRODUCT METRICS;

COMPUTATIONAL EFFICIENCY;

EID: 70349150918     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.94     Document Type: Conference Paper

References (45)

1. N. Ailon, B. Chazelle, S. Comandur, and D. Liu. Estimating the distance to a monotone function. Random Struct. Algorithms, 31(3):371-383, 2007.
2. M. Ajtai, T. S. Jayram, R. Kumar, and D. Sivakumar. Approximate counting of inversions in a data stream. In Proc. of STOC, pages 370-379, 2002. (Pubitemid 35009397)
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Proc. of STOC, pages 20-29, 1996.
4. A. Andoni. Approximate nearest neighbor problem in high dimensions. M.Eng. Thesis, Massachusetts Institute of Technology, June 2005.
5. A. Andoni, K. Do Ba, and P. Indyk. Block heavy hitters. MIT Technical Report MIT-CSAIL-TR-2008-2024, 2008.
6. A. Andoni and P. Indyk. Efficient algorithms for substring near neighbor problem. In Proc. of SODA, pages 1203-1212, 2006. (Pubitemid 43275348)
7. A. Andoni, P. Indyk, and R. Krauthgamer. Earth mover distance over high-dimensional spaces. Proc. of SODA, pages 343-352, 2008.
8. A. Andoni and R. Krauthgamer. The computational hardness of estimating edit distance. In Proc. of FOCS, pages 724-734, 2007.
9. A. Andoni and R. Krauthgamer. The smoothed complexity of edit distance. In Proc. of ICALP, pages 357-369, 2008.
10. S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the sparsest cut. In Proc. of STOC, pages 553-562, 2005.
11. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings, and graph partitionings. In Proc. of STOC, pages 222-231, 2004.
12. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 21(1):291-301 (electronic), 1998.
13. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proc. of PODS, pages 1-16, 2002.
14. T. Batu, F. Ergün, J. Kilian, A. Magen, S. Raskhodnikova, R. Rubinfeld, and R. Sami. A sublinear algorithm for weakly approximating edit distance. In Proc. of STOC, pages 316-324, 2003.
15. M. Charikar. Similarity estimation techniques from rounding. In Proc. of STOC, pages 380-388, 2002.
16. 1. Theory of Computing, 2(11):207-224, 2006.
17. E. Chávez, G. Navarro, R. Baeza-Yates, and J. Marroquin. Searching in metric spaces. ACM Computing Surveys, 33(3):273-321, Sept. 2001.
18. G. Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. J. Algorithms, 55(1):58-75, 2005. (Pubitemid 40357145)
19. G. Cormode and S. Muthukrishnan. Space efficient mining of multigraph streams. In Proc. of PODS, 2005.
20. N. R. Devanur, S. A. Khot, R. Saket, and N. K. Vishnoi. Integrality gaps for sparsest cut and minimum linear arrangement problems. In Proc. of STOC, pages 537-546, 2006. (Pubitemid 44306588)
21. F. Ergun, S. Kannan, R. Kumar, R. Rubinfeld, and M. Viswanathan. Spot-checkers. J. Comput. Syst. Sci., 60(3):717-751, 2000.
22. P. Flajolet and G. Martin. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci., 31:182-209, 1985.
23. P. Gopalan, T. S. Jayram, R. Krauthgamer, and R. Kumar. Estimating the sortedness of a data stream. In Proc. of SODA, 2007.
24. S. Har-Peled. A replacement for voronoi diagrams of near linear size. In Proc. of FOCS, pages 94-103, 2001.
25. ∞ norm. J. Comput. Syst. Sci., to appear. Preliminary version appeared in FOCS'98.
26. P. Indyk. Tutorial: Algorithmic applications of low-distortion geometric embeddings. Proc. of FOCS, pages 10-33, 2001. (Pubitemid 33068364)
27. P. Indyk. Approximate nearest neighbor algorithms for frechet metric via product metrics. Proc. of SoCG, pages 102-106, 2002.
28. P. Indyk. Approximate nearest neighbor under edit distance via product metrics. In Proc. of SODA, pages 646-650, 2004.
29. P. Indyk. A near linear time constant factor approximation for euclidean bichromatic matching (cost). In Proc. of SODA, 2007.
30. P. Indyk and J. Matoušek. Discrete metric spaces. CRC Handbook of Discrete and Computational Geometry, 2nd edition, 2003.
31. P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. Proc. of STOC, pages 604-613, 1998.
32. P. Indyk and N. Thaper. Fast color image retrieval via embeddings. Workshop on Statistical and Computational Theories of Vision (at ICCV), 2003.
33. P. Indyk and D. Woodruff. Optimal approximations of the frequency moments of data streams. Proc. of STOC, 2005.
34. T. Jayram and D. Woodruff. Cascaded stream aggregates. Manuscript, 2008.
35. W. B. Johnson and J. Lindenstrauss, editors. Handbook of the geometry of Banach spaces. Vol.I. North-Holland Publishing Co., Amsterdam, 2001.
36. S. Khot and A. Naor. Nonembeddability theorems via fourier analysis. Math. Ann., 334(4):821-852, 2006. Preliminary version appeared in FOCS'05.
37. 1. Proc. of FOCS, 00:53-62, 2005. (Pubitemid 44375719)
38. 1. In Proc. of SODA, pages 1010-1017, 2006.
39. N. Linial. Finite metric spaces - combinatorics, geometry and algorithms. Proceedings of the International Congress of Mathematicians III, pages 573-586, 2002.
40. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
41. J. I. Marden. Analyzing and Modeling Rank Data. Monographs on Statistics and Applied Probability 64. CRC Press, 1995.
42. J. Matousek. Lectures on Discrete Geometry. Springer, 2002.
43. 1. Proc. of FOCS, 2006.
44. R. Ostrovsky and Y. Rabani. Low distortion embedding for edit distance. J. ACM, 54(5), 2007. Preliminary version appeared in STOC'05.
45. Y. Rubner, C. Tomassi, and L. J. Guibas. The earth mover's distance as a metric for image retrieval. International Journal of Computer Vision, 40(2):99-121, 2000. (Pubitemid 32136368)