The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—In this paper we present cost estimates for finding the <it>k</it>-nearest neighbors to a test pattern according to a Minkowski <it>p</it>-metric, as a function of the size of the buckets in partitioning searching algorithms. The asymptotic expected number of operations to find the nearest neighbor is presented as a function of the average number of patterns per bucket <it>n</it> and is shown to contain a global minimum.</p>
INDEX TERMS
k nearest-neighbor search, nearest-neighbor search, complexity analysis, cost analysis, Minkowski p-metric, k-d tree partitioning, ordered partitioning, product partitioning.
CITATION

P. Zakarauskas and J. M. Ozard, "Complexity Analysis for Partitioning Nearest Neighbor Searching Algorithms," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 18, no. , pp. 663-668, 1996.
doi:10.1109/34.506419
86 ms
(Ver 3.3 (11022016))