Which spatial partition trees are adaptive to intrinsic dimension?

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Volumn , Issue , 2009, Pages 565-574

  Verma, Nakul ^a   Kpotufe, Samory ^a   Dasgupta, Sanjoy ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORESTRY; NEAREST NEIGHBOR SEARCH;

INTRINSIC DIMENSIONS; K-D TREE; LOW DIMENSIONAL STRUCTURE; RANDOM PROJECTION TREES; SPATIAL PARTITION TREE;

TREES (MATHEMATICS);

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

References (10)

1. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Symposium on Computational Geometry, 1998.
2. R. Baraniuk and M.Wakin. Random projections of smooth manifolds. Foundations of Computational Mathematics, 2007.
3. K. Clarkson. Tighter bounds for random projections of manifolds. Comp. Geometry, 2007.
4. S. Dasgupta and Y. Freund. Random projection trees and low dimensional manifolds. ACM Symposium on Theory of Computing, 2008.
5. L. Devroye, L. Gyorfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, 1996.
6. P. Indyk and A. Naor. Nearest neighbor preserving embeddings. ACM Transactions on Al-gorithms, 3(3), 2007.
7. M.W. Kadous. Temporal Classification: Extending the Classification Paradigm to Multivariate Time Series. PhD thesis, School of Comp. Sci. and Engg., University of New SouthWales, 2002.
8. S. Kpotufe. Escaping the curse of dimensionality with a tree-based regressor. Conference on Computational Learning Theory, 2009.
9. P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of submanifolds with high confidence from random samples. Disc. Computational Geometry, 2006.
10. C. Scott and R.D. Nowark. Minimax-optimal classification with dyadic decision trees. IEEE Transactions on Information Theory, 52, 2006.