Random projection trees and low dimensional manifolds
- 17 May 2008
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 537-546
- https://doi.org/10.1145/1374376.1374452
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Finding the Homology of Submanifolds with High Confidence from Random SamplesDiscrete & Computational Geometry, 2008
- Nearest-neighbor-preserving embeddingsACM Transactions on Algorithms, 2007
- Cover trees for nearest neighborPublished by Association for Computing Machinery (ACM) ,2006
- Laplacian Eigenmaps for Dimensionality Reduction and Data RepresentationNeural Computation, 2003
- A Global Geometric Framework for Nonlinear Dimensionality ReductionScience, 2000
- An optimal algorithm for approximate nearest neighbor searching in fixed dimensionsJournal of the ACM, 1998
- QuantizationIEEE Transactions on Information Theory, 1998
- Optimal pruning with applications to tree-structured source coding and modelingIEEE Transactions on Information Theory, 1989
- On visible surface generation by a priori tree structuresACM SIGGRAPH Computer Graphics, 1980
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975