Complexity analysis for partitioning nearest neighbor searching algorithms | IEEE Journals & Magazine | IEEE Xplore

Complexity analysis for partitioning nearest neighbor searching algorithms


Abstract:

Presents cost estimates for finding the k-nearest neighbors to a test pattern according to a Minkowski p-metric, as a function of the size of the buckets in partitioning ...Show More

Abstract:

Presents cost estimates for finding the k-nearest neighbors to a test pattern according to a Minkowski p-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 n and is shown to contain a global minimum.
Page(s): 663 - 668
Date of Publication: 06 August 2002

ISSN Information:


References

References is not available for this document.