Near optimal dimensionality reductions that preserve volumes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5171 LNCS, Issue , 2008, Pages 523-534

  Magen, Avner ^a   Zouzias, Anastasios ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OP-TIMIZATION PROBLEM; EUCLIDEAN SPACES; OPTIMAL DIMENSIONALITY;

CANNING; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 51849127391     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85363-3_41     Document Type: Conference Paper

References (20)

1. Achlioptas, D.: Database-friendly random projections. In: PODS 2001: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 274-281. ACM, New York (2001)
2. Agarwal, P.K., Har-Peled, S., Yu, H.: Embeddings of surfaces, curves, and moving points in euclidean space. In: SCG 2007: Proceedings of the twenty-third annual symposium on Computational geometry, pp. 381-389. ACM, New York (2007)
3. Ailon, N., Chazelle, B.: Approximate nearest neighbors and the fast johnson-lindenstrauss transform. In: STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 557-563. ACM, New York (2006)
4. Ailon, N., Liberty, E.: Fast dimension reduction using rademacher series on dual bch codes. In: SODA 2008: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 1-9 (2008)
5. Alon, N.: Problems and results in extremal combinatorics, i. Discrete Math. (273), 31-53 (2003)
6. Clarkson, K.L.: Tighter bounds for random projections of manifolds. In: SCG 2008: Proceedings of the twenty-fourth annual symposium on Computational geometry, pp. 39-48. ACM, New York (2008)
7. Engebretsen, L., Indyk, P., O'Donnell, R.: Derandomized dimensionality reduction with applications. In: SODA 2002: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 705-712 (2002)
8. Feige, U.: Approximating the bandwidth via volume respecting embeddings (extended abstract). In: STOC 1998: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 90-99. ACM, New York (1998)
9. Frankl, P., Maehara, H.: The johnson-lindenstrauss lemma and the sphericity of some graphs. J. Comb. Theory Ser. A 44(3), 355-362 (1987)
10. Gordon, L.: Bounds for the distribution of the generalized variance. The Annals of Statistics 17(4), 1684-1692 (1989)
11. Indyk, P., Naor, A.: Nearest-neighbor-preserving embeddings. ACM Trans. Algorithms 3(3), 31 (2007)
12. Johnson, W.B., Lindenstrauss, J.: Extensions of lipschitz mappings into a hilbert space. In: Amer. Math. Soc. (ed.) Conference in modern analysis and probability, pp. 189-206. Providence, RI (1984)
13. Liberty, E., Ailon, N., Singer, A.: Fast random projections using lean walsh transforms. In: RANDOM (to appear, 2008)
14. 2 that preserve volumes and distance to affine spaces. Discrete & Computational Geometry 38(1), 139-153 (2007)
15. Matousek, J.: On the variants of johnson lindenstrauss lemma (manuscript) (2006)
16. Prekopa, A.: On random determinants i. Studia Scientiarum Mathematicarum Hungarica (2), 125-132 (1967)
17. Sarlos, T.: Improved approximation algorithms for large matrices via random projections. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 143-152. IEEE Computer Society, Los Alamitos (2006)
18. Sivakumar, D.: Algorithmic derandomization via complexity theory. In: STOC 2002: Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pp. 619-626. ACM, New York (2002)
19. Vempala, S.: Random projection: A new approach to vlsi layout. In: FOCS 1998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 389. IEEE Computer Society, Los Alamitos (1998)
20. Wakin, M.B., Baraniuk, R.G.: Random projections of signal manifolds. In: Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing. ICASSP 2006, vol. 5, p. V (May 2006)