Cover trees for nearest neighbor

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 97-104

  Beygelzimer, Alina ^a   Kakade, Sham ^b   Langford, John ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED EXPANSION CONSTANT; INTRINSIC DIMENSIONALITY; TREE DATA STRUCTURE;

LEARNING SYSTEMS; NAVIGATION; QUERY PROCESSING;

DATA STRUCTURES;

EID: 34250785135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143857     Document Type: Conference Paper

References (13)

1. Beygelzimer, A., Kakade, S., & Langford, J. (2005). Cover trees for nearest neighbor. Available at http://hunch.net/~jl/projects/cover_tree.
2. Clarkson, K. (1999). Nearest neighbor queries in metric spaces. Discrete and Computational Geometry, 22, 63-93.
3. Clarkson, K. (2002). Nearest neighbor searching in metric spaces: Experimental results for sb(s). http://cm.bell-labs.com/who/clarkson/Msb/readme. html.
4. Friedman, J., Bentley, J., & Finkel, R. (1977). An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 3, 209-226.
5. Gray, A., & Moore, A. (2000). N-body problems in statistical learning. Advances in Neural Information Processing Systems, 13, 521-527.
6. Gupta, A., Krauthgamer, R., & Lee, J. (2003). Bounded geometries, fractals, and low-distortion embeddings. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (pp. 534-543).
7. Har-Peled, S., & Mendel, M. (2006). Fast constructions of nets in low dimensional metrics and their applications. SIAM Journal on Computing, 35, 1148-1184.
8. Karger, D., & Ruhl, M. (2002). Finding nearest neighbors in growth restricted metrics. Proceedings of the 34th Annual ACM Symposium on Theory of Computing (pp. 741-750).
9. Krauthgamer, R., & Lee, J. (2004a). The black-box complexity of nearest neighbor search. Proceedings of the 31st International Colloquium on Automata, Languages and Programming (pp. 858-869).
10. Krauthgamer, R., & Lee, J. (2004b). Navigating nets: Simple algorithms for proximity search. Proceedings of the 15th Annual Symposium on Discrete Algorithms (pp. 791-801).
11. Laviolette, F., Marchand, M., & Shah, M. (2005). A PAC-bayes approach to the set covering machine. Advances in Neural Information Processing Systems, 18.
12. Omohundro, S. (1987). Efficient algorithms with neural network behavior. Journal of Complex Systems, 1, 273-347.
13. Uhlmann, J. (1991). Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40, 175-179.