A learning framework for nearest neighbor search

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Cayton, Lawrence ^a   Dasgupta, Sanjoy ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS; NEAREST NEIGHBOR SEARCH; TREES (MATHEMATICS);

GENERAL LEARNING; GENERALISATION; LEARN+; LEARNING FRAMEWORKS; LEARNING TECHNIQUES; LOCALITY SENSITIVE HASHING; MISS-RATE; NEAR NEIGHBOR SEARCHES; NEAREST-NEIGHBOUR; RETRIEVAL TIME;

DATA STRUCTURES;

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

References (16)

1. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 3(3):209-226, 1977.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A.Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45(6):891-923, 1998.
3. T. Liu, A. W. Moore, A. Gray, and K. Yang. An investigation of practical approximate neighbor algorithms. In Neural Information Processing Systems (NIPS), 2004.
4. S. Dasgupta and Y. Freund. Random projection trees and low dimensional manifolds. Technical report, UCSD, 2007.
5. P. Indyk. Nearest neighbors in high dimensional spaces. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry. CRC Press, 2006.
6. M. T. Orchard. A fast nearest-neighbor search algorithm. In ICASSP, pages 2297-3000, 1991.
7. E. Vidal. An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recognition Letters, 4:145-157, 1986.
8. S. Omohundro. Five balltree construction algorithms. Technical report, ICSI, 1989.
9. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. In ICML, 2006.
10. K. L. Clarkson. Nearest-neighbor searching and metric space dimensions. In Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pages 15-59. MIT Press, 2006.
11. S. Maneewongvatana and D. Mount. The analysis of a probabilistic approach to nearest neighbor searching. In Workshop on Algorithms and Data Structures, 2001.
12. S. Maneewongvatana and D. Mount. Analysis of approximate nearest neighbor searching with clustered point sets. In Workshop on Algorithm Engineering and Experimentation (ALENEX), 1999.
13. Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SCG 2004, pages 253-262, New York, NY, USA, 2004. ACM Press.
14. O. Bousquet, S. Boucheron, and G. Lugosi. Theory of classification: a survey of recent advances. ESAIM: Probability and Statistics, 9:323-375, 2004.
15. D. Mount and S. Arya. ANN library. http://www.cs.umd.edu/-mount/ANN/.
16. N. Rasiwasia, P. Moreno, and N. Vasconcelos. Bridging the gap: query by semantic example. IEEE Transactions on Multimedia, 2007.