Random Projection Trees revisited

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Dhesi, Aman ^a   Kar, Purushottam ^b  

^a Princeton University   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; TREES (MATHEMATICS);

INTRINSIC DIMENSIONALITIES; LOCAL COVARIANCE; LOWER DIMENSIONAL MANIFOLDS; NEAR-OPTIMAL; NEW RESULTS; RANDOM PROJECTION TREES; SPACE PARTITIONING; TREE STRUCTURES;

DATA STRUCTURES;

DATA; FORESTRY; STRUCTURES;

EID: 85162003049     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Sanjoy Dasgupta and Yoav Freund. Random Projection Trees and Low dimensional Manifolds. In 40th Annual ACM Symposium on Theory of Computing, pages 537-546, 2008.
2. Piotr Indyk and Rajeev Motwani. Approximate Nearest Neighbors : Towards Removing the Curse of Dimensionality. In 30th Annual ACM Symposium on Theory of Computing, pages 604-613, 1998.
3. Joshua B. Tenenbaum, Vin de Silva, and John C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(22):2319-2323, 2000.
4. Piotr Indyk and Assaf Naor. Nearest-Neighbor-Preserving Embeddings. ACM Transactions on Algorithms, 3, 2007.
5. Richard G. Baraniuk and Michael B. Wakin. Random Projections of Smooth Manifolds. Foundations of Computational Mathematics, 9(1):51-77, 2009.
6. Yoav Freund, Sanjoy Dasgupta, Mayank Kabra, and Nakul Verma. Learning the structure of manifolds using random projections. In Twenty-First Annual Conference on Neural Information Processing Systems, 2007.
7. Samory Kpotufe. Escaping the curse of dimensionality with a tree-based regressor. In 22nd Annual Conference on Learning Theory, 2009.
8. Donghui Yan, Ling Huang, and Michael I. Jordan. Fast Approximate Spectral Clustering. In 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 907-916, 2009.
9. John Wright and Gang Hua. Implicit Elastic Matching with Random Projections for Pose-Variant Face Recognition. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pages 1502-1509, 2009.
10. Jian Pu, Junping Zhang, Peihong Guo, and Xiaoru Yuan. Interactive Super-Resolution through Neighbor Embedding. In 9th Asian Conference on Computer Vision, pages 496-505, 2009.
11. Jon Louis Bentley. Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM, 18(9):509-517, 1975.
12. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, and Angela Y. Wu. An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. Journal of the ACM, 45(6):891-923, 1998.
13. Christian A. Duncan, Michael T. Goodrich, and Stephen G. Kobourov. Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. Journal of Algorithms, 38(1):303-333, 2001.
14. Hanan Samet. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers, 2005.
15. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, and Angela Y. Wu. A local search approximation algorithm for k-means clustering. Computational Geometry, 28(2-3):89-112, 2004.
16. Partha Niyogi, Stephen Smale, and Shmuel Weinberger. Finding the Homology of Submanifolds with High Confidence from Random Samples. Discrete & Computational Geometry, 39(1-3):419-441, 2008.
17. Sebastián Montiel and Antonio Ros. Curves and Surfaces, volume 69 of Graduate Studies in Mathematics. American Mathematical Society and Real Sociedad Matemática Epañola, 2005.