Finding Nearest Neighbors in Growth-restricted Metrics (2002)
by
David R. Karger
,
Matthias Ruhl
| Venue: | In 34th Annual ACM Symposium on the Theory of Computing |
| Citations: | 123 - 0 self |
BibTeX
@INPROCEEDINGS{Karger02findingnearest,
author = {David R. Karger and Matthias Ruhl},
title = {Finding Nearest Neighbors in Growth-restricted Metrics},
booktitle = {In 34th Annual ACM Symposium on the Theory of Computing},
year = {2002},
pages = {741--750}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Euclidean. Nearest neighbor algorithms for general metric spaces are quite weak, which motivates a search for other classes of metric spaces that can be tractably searched.
Citations
| 3028 | H.: Chord: A scalable Peer-To-Peer lookup service for internet applications - Stoica, Morris, et al. |
| 1228 | A global geometric framework for nonlinear dimensionality reduction - Tenenbaum, Silva, et al. - 2000 |
| 911 | Multidimensional binary search trees used for associative searching - Bentley - 1975 |
| 422 | Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaraman, et al. - 1997 |
| 284 | Searching in metric spaces - Chávez, Navarro, et al. - 2001 |
| 225 | Data structures and algorithms for nearest neighbor search in general metric spaces - Yianilos - 1993 |
| 159 | Near neighbor search in large metric spaces - Brin - 1995 |
| 142 | Satisfying general proximity/similarity queries with metric trees - Uhlmann - 1991 |
| 99 | Nearest neighbor queries in metric spaces - Clarkson - 1999 |
| 80 | Optimal expected-time algorithms for closest point problems - Bentley, Weide, et al. - 1980 |
| 61 | Mapping a manifold of perceptual observations - Tenenbaum - 1998 |
