Complexity Analysis for Partitioning Nearest Neighbor Searching Algorithms

Authors:
Pierre Zakarauskas;John M. Ozard
Affiliations:
-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1996

Citing 6
Cited 3

Coding and information theory (2nd ed.)

Coding and information theory (2nd ed.)
A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal bucket size for multiattribute retrieval in partitioned files

Information Systems
New techniques for best-match retrieval

ACM Transactions on Information Systems (TOIS)
New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)

Pattern Recognition Letters
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)

The neighborhood method and its coupling with the wavelet method for signal separation of chaotic signals

Signal Processing
Fast and Accurate Handwritten Character Recognition Using Approximate Nearest Neighbours Search on Large Databases

Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Data mining tasks and methods: Classification: nearest-neighbor approaches

Handbook of data mining and knowledge discovery

Quantified Score

Hi-index	0.15

Visualization

Abstract

In this paper we present 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.