Random projection trees and low dimensional manifolds

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 537-546

  Dasgupta, Sanjoy ^a   Freund, Yoav ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms

Indexed keywords

ALGORITHMS; FORESTRY; TREES (MATHEMATICS);

LOW DIMENSIONAL STRUCTURE; LOW-DIMENSIONAL MANIFOLDS; RANDOM PROJECTION TREES;

COMPUTATION THEORY;

EID: 57049122948     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374452     Document Type: Conference Paper

References (24)

1. S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45:891-923, 1998.
2. n. Bull. Soc. Math. France, 111(4):429-448, 1983.
3. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, 2003.
4. J. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, 1975.
5. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. In 23rd International Conference on Machine Learning, 2006.
6. E. Candes and T. Tao. Near optimal signal recovery from random projections: universal encoding strategies? IEEE Transactions on Information Theory, 52(12):5406-5425, 2006.
7. P. Chou, T. Lookabaugh, and R. Gray. Optimal pruning with applications to tree-structured source coding and modeling. IEEE Transactions on Information Theory, 35(2):299-315, 1989.
8. L. Devroye, L. Gyorfi, and G. Lugosi. A Probabilistic Theory of Pattern, Recognition. Springer, 1996.
9. M. do Carmo. Riemannian Geometry. Birkhauser, 1992.
10. D. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
11. R. Durrett. Probability: Theory and Examples. Duxbury, second edition, 1995.
12. Y. Freund, S. Dasgupta, M. Kabra, and N. Verma. Learning the structure of manifolds using random projections. In Neural Information Processing Systems, 2007.
13. H. Fuchs, Z. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Computer Graphics, 14(3):124-133, 1980.
14. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In 25th International Conference on Very Large Databases, 1999.
15. S. Graf and H. Luschgy. Foundations of quantization for probability distributions. Springer, 2000.
16. R. Gray and D. Neuhoff. Quantization. IEEE Transactions on Information Theory, 44(6):2325-2383, 1998.
17. A. Gupta, R. Krauthgamer, and J. Lee. Bounded geometries, fractals, and low-distortion embeddings. In IEEE Symposium on Foundations of Computer Science, pages 534-544, 2003.
18. J. Heinonen. Lectures on Analysis on Metric Spaces. Springer, 2001.
19. P. Indyk and A. Naor. Nearest neighbor preserving embeddings. ACM Transactions on Algorithms, 3(3), 2007.
20. R. Krauthgamer and J. Lee. Navigating nets: simple algorithms for proximity search. In ACM-SIAM Symposium on Discrete Algorithms, 2004.
21. T. Liu, A. Moore, A. Gray, and K. Yang. An investigation of practical approximate nearest neighbor algorithms. In Neurol Information Processing Systems, 2004.
22. P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of submanifolds with high confidence from random samples. Discrete and Computational Geometry, 2006.
23. S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, (290):2323-2326, 2000.
24. J. Tenenbaum, V. de Silva, and J. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.