On the impossibility of dimension reduction in ℓ1

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 514-523

  Brinkman, B ^a   Charikar, M ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

Algorithm design and analysis; Approximation algorithms; Clustering algorithms; Computer science; Embedded computing; Engineering profession; Extraterrestrial measurements; Linear programming; Upper bound; US Department of Energy

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER SCIENCE; GRAPH THEORY; LINEAR PROGRAMMING; PROFESSIONAL ASPECTS;

ALGORITHM DESIGN AND ANALYSIS; EMBEDDED COMPUTING; ENGINEERING PROFESSION; EXTRATERRESTRIAL MEASUREMENTS; UPPER BOUND; US DEPARTMENT OF ENERGY;

CLUSTERING ALGORITHMS;

EID: 84943387259     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238224     Document Type: Conference Paper

References (27)

1. D. Achlioptas. Database-friendly random projections. In Proc. 20th PODS, 2001.
2. N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments. JCSS 58(1): 137-147, 1999
3. J. Arias-de Reyna and L. Rodriguez-Piazza. Finite metric spaces needing high dimension for lipschitz embeddings in banach spaces. Israel Journal of Mathematics, 79:103-111, 1992.
4. R. Arriaga and S. Vempala. An algorithmic theory of learning: Robust Concepts and Random Projection. In Proc. 40th FOCS, pp. 616-623, 1999.
5. p-spaces. European Journal of Combinatorics, 11:305-311, 1990.
6. J. Bourgain. On Lipschitz embedding of finite metric spaces into Hilbert space. Israel Journal of Mathematics. 52:46-52, 1985.
7. M. Charikar and A. Sahai. Dimension reduction in the ℓ norm. In Proc. 43rd FOCS, pp. 551-560, 2002.
8. S. Dasgupta. Learning Mixtures of Gaussians. In Proc. 40th FOCS, pp. 634-644, 1999.
9. S. Dasgupta and A. Gupta. An elementary proof of the Johnson-Lindenstrauss lemma. Technical Report TR-99-06, International Computer Science Institute, Berkeley, CA, 1999.
10. M. Deza and M. Laurent. Geometry of Cuts and Metrics. Springer, 1997.
11. P. Frankl and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Comb. Theory, Ser. B, 44:355-362, 1988.
12. A. Gupta, I. Newman, Y. Rabinovich and A. Sinclair. Cuts, trees and ℓ embeddings of graphs. In Proceedings of the 40th annual IEEE conference on foundations of computer science, 1999.
13. P. Indyk. Dimensionality reduction techniques for proximity problems. In Proc. 9th SODA, pp. 371-378, 2000.
14. P. Indyk. Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. In Proc. 41st FOCS, pp. 189-197, 2000.
15. P. Indyk. Algorithmic applications of low-distortion embeddings. In Proc. 42nd FOCS, pp. 10-33, 2001.
16. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. 30th STOC pp. 604-613, 1998.
17. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mapping into Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
18. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM J. Computing, 30(2): 457-474, 2000.
19. p and Dimension Reduction in L. Personal communication, submitted for publication
20. N. Linial. Finite Metric Spaces - Combinatorics, Geometry and Algorithms. In Proc. International Congress of Mathematicians, 2002.
21. J. Matousek. On the distortion required for embedding finite metric spaces into normed spaces. Israel Journal of Mathematics, 93:333-344, 1996.
22. J. Matousek. Embedding finite metric spaces into Euclidean spaces, chapter in Lectures on discrete geometry. Graduate Texts in Mathematics, Vol. 212, Springer Verlag, 2002.
23. I. Newman and Y. Rabinovich A lower bound on the distortion of embedding planar metrics into Euclidean space. In Proceedings of the eighteenth annual symposium on Computational geometry, pp. 94-96, 2002.
24. R. Ostrovsky and Y. Rabani Polynomial Time Approximation Schemes for Geometric k-Clustering. In Proc. 41st FOCS, pp. 349-358, 2000.
25. S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the Symposium on Computational Geometry, pages 300-306, 1999.
26. n. Compositio Math., 61(2):159-169, 1987.
27. n. Proc. Amer. Math. Soc., 108(2):363-369, 1990.