Data structures and algorithms for nearest neighbor search in general metric spaces
Citations
6,447 citations
6,340 citations
Cites background from "Data structures and algorithms for ..."
...For more information on efficient nearest-neighbor searching, see the recent survey [478], and [47, 48, 49, 53, 101, 232, 367, 479, 541, 761, 909, 989]....
[...]
4,478 citations
2,079 citations
Cites background or methods from "Data structures and algorithms for ..."
...approximation of the similarities between the input objects using vantage-point trees (Yianilos, 1993), and subsequently, they approximate the forces between the points in the embedding with the help of either a Barnes-Hut algorithm (Barnes and Hut, 1986) or a dual-tree algorithm (Gray and Moore, 2001, 2003)....
[...]
...In a vantage-point tree, each node stores an input object and the radius of a (hyper)ball that is centered on this object (Yianilos, 1993)....
[...]
..., 2006), vantage-point trees (Yianilos, 1993), and trees constructed using hierarchical clustering (Fukunaga and Narendra, 1975; Brin, 1995; Nister and Stewenius, 2006)....
[...]
1,786 citations
Cites background from "Data structures and algorithms for ..."
...The nearest neighbor search has a time complexity of O(p2), and it can be sped up further by leveraging out-of-the-box tools for fast (approximate or exact) nearest neighbor retrieval (Garcia et al., 2008; Yianilos, 1993; Andoni & Indyk, 2006)....
[...]
References
10,526 citations
4,236 citations
"Data structures and algorithms for ..." refers methods in this paper
...More recently, the Voronoi digram [21] has provided a useful tool in low- dimensional Euclidian settings { and Figure 1: vp-tree decomposition Figure 2: kd-tree decomposition the overall eld and outlook of Computational Geometry has yielded many interesting results such as those of [22, 23, 24, 25] and earlier [26]....
[...]
2,910 citations
776 citations
"Data structures and algorithms for ..." refers background or methods in this paper
...Fukunaga in [8, 9] exploits the triangle inequality to reduce distance computations searching a hierarchical decomposition of Euclidian Space....
[...]
...This contrasts with the coordinate aligned hyperplanar cuts of the kdtree (See Figures 1 & 2), and the use of computed Euclidian cluster centroids in [8]....
[...]
...Comparisons with the experiments of [8] are more difcult because leaf level buckets are employed....
[...]